./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_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 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:55:49,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:55:49,872 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 14:55:49,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:55:49,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:55:49,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:55:49,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:55:49,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:55:49,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:55:49,902 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:55:49,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:55:49,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:55:49,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:55:49,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:55:49,906 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:55:49,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:55:49,906 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:55:49,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:55:49,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:55:49,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:55:49,907 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:55:49,912 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:55:49,912 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:55:49,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:55:49,912 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:55:49,913 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:55:49,913 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:55:49,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:55:49,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:55:49,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:55:49,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:55:49,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:55:49,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:55:49,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:55:49,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:55:49,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:55:49,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:55:49,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:55:49,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:55:49,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:55:49,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:55:49,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:55:49,917 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 -> 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 [2024-11-20 14:55:50,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:55:50,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:55:50,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:55:50,178 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:55:50,178 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:55:50,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2024-11-20 14:55:51,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:55:51,902 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:55:51,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2024-11-20 14:55:51,916 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a0356f6/4a9bd70c0f414696a06b79d07953b11b/FLAGfb2479781 [2024-11-20 14:55:51,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a0356f6/4a9bd70c0f414696a06b79d07953b11b [2024-11-20 14:55:51,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:55:51,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:55:51,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:55:51,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:55:51,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:55:51,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:55:51" (1/1) ... [2024-11-20 14:55:51,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4097b105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:51, skipping insertion in model container [2024-11-20 14:55:51,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:55:51" (1/1) ... [2024-11-20 14:55:51,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:55:52,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:55:52,327 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:55:52,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:55:52,426 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:55:52,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52 WrapperNode [2024-11-20 14:55:52,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:55:52,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:55:52,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:55:52,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:55:52,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 14:55:52,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 14:55:52,479 INFO L138 Inliner]: procedures = 127, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 154 [2024-11-20 14:55:52,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:55:52,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:55:52,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:55:52,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:55:52,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 14:55:52,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 14:55:52,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 14:55:52,521 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 9, 20]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 15 writes are split as follows [0, 2, 13]. [2024-11-20 14:55:52,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 14:55:52,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 14:55:52,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 14:55:52,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 14:55:52,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 14:55:52,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 14:55:52,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:55:52,553 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:55:52,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:55:52,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:55:52,554 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 14:55:52,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:55:52,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:55:52,589 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-20 14:55:52,592 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-20 14:55:52,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 14:55:52,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 14:55:52,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 14:55:52,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 14:55:52,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 14:55:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 14:55:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-20 14:55:52,646 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-20 14:55:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:55:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:55:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 14:55:52,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 14:55:52,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 14:55:52,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 14:55:52,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 14:55:52,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 14:55:52,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 14:55:52,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:55:52,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-20 14:55:52,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-20 14:55:52,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-20 14:55:52,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 14:55:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 14:55:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 14:55:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:55:52,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:55:52,802 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:55:52,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:55:53,253 INFO L? ?]: Removed 156 outVars from TransFormulas that were not future-live. [2024-11-20 14:55:53,254 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:55:53,271 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:55:53,273 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-20 14:55:53,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:55:53 BoogieIcfgContainer [2024-11-20 14:55:53,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:55:53,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:55:53,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:55:53,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:55:53,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:55:51" (1/3) ... [2024-11-20 14:55:53,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c50e047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:55:53, skipping insertion in model container [2024-11-20 14:55:53,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (2/3) ... [2024-11-20 14:55:53,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c50e047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:55:53, skipping insertion in model container [2024-11-20 14:55:53,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:55:53" (3/3) ... [2024-11-20 14:55:53,282 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2024-11-20 14:55:53,298 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:55:53,299 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2024-11-20 14:55:53,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:55:53,357 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;@5adb4815, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:55:53,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2024-11-20 14:55:53,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 137 states have internal predecessors, (151), 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-20 14:55:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:55:53,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:55:53,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:55:53,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:55:53,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:55:53,372 INFO L85 PathProgramCache]: Analyzing trace with hash 895949618, now seen corresponding path program 1 times [2024-11-20 14:55:53,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:55:53,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680541841] [2024-11-20 14:55:53,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:55:53,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:55:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:53,629 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-20 14:55:53,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:55:53,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680541841] [2024-11-20 14:55:53,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680541841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:55:53,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:55:53,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:55:53,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584497754] [2024-11-20 14:55:53,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:55:53,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:55:53,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:55:53,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:55:53,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:55:53,672 INFO L87 Difference]: Start difference. First operand has 142 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 137 states have internal predecessors, (151), 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-20 14:55:53,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:55:53,846 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2024-11-20 14:55:53,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:55:53,851 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-20 14:55:53,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:55:53,859 INFO L225 Difference]: With dead ends: 138 [2024-11-20 14:55:53,859 INFO L226 Difference]: Without dead ends: 135 [2024-11-20 14:55:53,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:55:53,864 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 3 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:55:53,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 218 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:55:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-20 14:55:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-20 14:55:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 70 states have (on average 1.9714285714285715) internal successors, (138), 130 states have internal predecessors, (138), 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-20 14:55:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2024-11-20 14:55:53,919 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 6 [2024-11-20 14:55:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:55:53,919 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2024-11-20 14:55:53,919 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-20 14:55:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2024-11-20 14:55:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:55:53,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:55:53,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:55:53,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:55:53,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:55:53,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:55:53,921 INFO L85 PathProgramCache]: Analyzing trace with hash 895949619, now seen corresponding path program 1 times [2024-11-20 14:55:53,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:55:53,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832025050] [2024-11-20 14:55:53,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:55:53,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:55:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:54,065 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-20 14:55:54,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:55:54,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832025050] [2024-11-20 14:55:54,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832025050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:55:54,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:55:54,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:55:54,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257319751] [2024-11-20 14:55:54,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:55:54,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:55:54,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:55:54,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:55:54,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:55:54,069 INFO L87 Difference]: Start difference. First operand 135 states and 144 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-20 14:55:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:55:54,225 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2024-11-20 14:55:54,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:55:54,227 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-20 14:55:54,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:55:54,228 INFO L225 Difference]: With dead ends: 132 [2024-11-20 14:55:54,228 INFO L226 Difference]: Without dead ends: 132 [2024-11-20 14:55:54,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:55:54,230 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 3 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:55:54,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 219 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:55:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-20 14:55:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-20 14:55:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 70 states have (on average 1.9285714285714286) internal successors, (135), 127 states have internal predecessors, (135), 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-20 14:55:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2024-11-20 14:55:54,244 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2024-11-20 14:55:54,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:55:54,244 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2024-11-20 14:55:54,244 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-20 14:55:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2024-11-20 14:55:54,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:55:54,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:55:54,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:55:54,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:55:54,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:55:54,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:55:54,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1271068585, now seen corresponding path program 1 times [2024-11-20 14:55:54,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:55:54,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311617472] [2024-11-20 14:55:54,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:55:54,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:55:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:54,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:55:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:54,430 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-20 14:55:54,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:55:54,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311617472] [2024-11-20 14:55:54,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311617472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:55:54,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:55:54,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:55:54,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75027698] [2024-11-20 14:55:54,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:55:54,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:55:54,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:55:54,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:55:54,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:55:54,437 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:55:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:55:54,597 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2024-11-20 14:55:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:55:54,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-20 14:55:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:55:54,599 INFO L225 Difference]: With dead ends: 143 [2024-11-20 14:55:54,599 INFO L226 Difference]: Without dead ends: 143 [2024-11-20 14:55:54,599 INFO L431 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-20 14:55:54,600 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 10 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:55:54,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 320 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:55:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-20 14:55:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2024-11-20 14:55:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 128 states have internal predecessors, (136), 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-20 14:55:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2024-11-20 14:55:54,610 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 14 [2024-11-20 14:55:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:55:54,610 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2024-11-20 14:55:54,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:55:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2024-11-20 14:55:54,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 14:55:54,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:55:54,612 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:55:54,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:55:54,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:55:54,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:55:54,613 INFO L85 PathProgramCache]: Analyzing trace with hash -29197696, now seen corresponding path program 1 times [2024-11-20 14:55:54,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:55:54,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234392099] [2024-11-20 14:55:54,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:55:54,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:55:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:54,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:55:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:54,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:55:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:55:54,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:55:54,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234392099] [2024-11-20 14:55:54,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234392099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:55:54,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:55:54,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:55:54,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110021049] [2024-11-20 14:55:54,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:55:54,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:55:54,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:55:54,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:55:54,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:55:54,894 INFO L87 Difference]: Start difference. First operand 133 states and 142 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-20 14:55:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:55:55,198 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2024-11-20 14:55:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:55:55,199 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 24 [2024-11-20 14:55:55,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:55:55,200 INFO L225 Difference]: With dead ends: 132 [2024-11-20 14:55:55,203 INFO L226 Difference]: Without dead ends: 132 [2024-11-20 14:55:55,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:55:55,205 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 7 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:55:55,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 450 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:55:55,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-20 14:55:55,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-20 14:55:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 127 states have internal predecessors, (135), 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-20 14:55:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2024-11-20 14:55:55,219 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 24 [2024-11-20 14:55:55,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:55:55,219 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2024-11-20 14:55:55,219 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-20 14:55:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2024-11-20 14:55:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 14:55:55,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:55:55,221 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:55:55,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:55:55,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:55:55,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:55:55,222 INFO L85 PathProgramCache]: Analyzing trace with hash -29197695, now seen corresponding path program 1 times [2024-11-20 14:55:55,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:55:55,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354807141] [2024-11-20 14:55:55,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:55:55,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:55:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:55,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:55:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:55,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:55:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:55:55,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:55:55,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354807141] [2024-11-20 14:55:55,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354807141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:55:55,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:55:55,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:55:55,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365411818] [2024-11-20 14:55:55,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:55:55,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:55:55,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:55:55,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:55:55,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:55:55,506 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-20 14:55:55,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:55:55,770 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2024-11-20 14:55:55,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:55:55,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2024-11-20 14:55:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:55:55,771 INFO L225 Difference]: With dead ends: 131 [2024-11-20 14:55:55,772 INFO L226 Difference]: Without dead ends: 131 [2024-11-20 14:55:55,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:55:55,773 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 6 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:55:55,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 474 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:55:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-20 14:55:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-20 14:55:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 71 states have (on average 1.8873239436619718) internal successors, (134), 126 states have internal predecessors, (134), 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-20 14:55:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2024-11-20 14:55:55,780 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 24 [2024-11-20 14:55:55,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:55:55,781 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2024-11-20 14:55:55,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-20 14:55:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2024-11-20 14:55:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 14:55:55,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:55:55,782 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:55:55,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:55:55,782 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:55:55,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:55:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2005784929, now seen corresponding path program 1 times [2024-11-20 14:55:55,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:55:55,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676926271] [2024-11-20 14:55:55,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:55:55,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:55:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:56,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:55:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:56,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:55:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:55:56,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:55:56,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676926271] [2024-11-20 14:55:56,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676926271] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:55:56,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141266959] [2024-11-20 14:55:56,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:55:56,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:55:56,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:55:56,174 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-20 14:55:56,178 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-20 14:55:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:56,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 14:55:56,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:55:56,358 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-20 14:55:56,421 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-20 14:55:56,461 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-20 14:55:56,462 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-20 14:55:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-20 14:55:56,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:55:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:55:56,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141266959] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:55:56,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:55:56,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-11-20 14:55:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460537887] [2024-11-20 14:55:56,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:55:56,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:55:56,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:55:56,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:55:56,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-20 14:55:56,681 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 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-20 14:55:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:55:57,064 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2024-11-20 14:55:57,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:55:57,065 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 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 26 [2024-11-20 14:55:57,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:55:57,067 INFO L225 Difference]: With dead ends: 136 [2024-11-20 14:55:57,067 INFO L226 Difference]: Without dead ends: 136 [2024-11-20 14:55:57,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-11-20 14:55:57,070 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:55:57,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 455 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 378 Invalid, 0 Unknown, 141 Unchecked, 0.3s Time] [2024-11-20 14:55:57,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-20 14:55:57,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-20 14:55:57,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 130 states have internal predecessors, (140), 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-20 14:55:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2024-11-20 14:55:57,081 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 26 [2024-11-20 14:55:57,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:55:57,081 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2024-11-20 14:55:57,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 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-20 14:55:57,082 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2024-11-20 14:55:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 14:55:57,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:55:57,082 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:55:57,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 14:55:57,283 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-20 14:55:57,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:55:57,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:55:57,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2005784930, now seen corresponding path program 1 times [2024-11-20 14:55:57,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:55:57,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824093410] [2024-11-20 14:55:57,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:55:57,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:55:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:57,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:55:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:57,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:55:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:57,749 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-20 14:55:57,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:55:57,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824093410] [2024-11-20 14:55:57,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824093410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:55:57,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499004831] [2024-11-20 14:55:57,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:55:57,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:55:57,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:55:57,754 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-20 14:55:57,757 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-20 14:55:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:57,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 14:55:57,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:55:57,898 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-20 14:55:57,903 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-20 14:55:58,001 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-20 14:55:58,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:55:58,042 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-20 14:55:58,049 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:55:58,049 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-20 14:55:58,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-20 14:55:58,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:55:58,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499004831] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:55:58,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:55:58,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2024-11-20 14:55:58,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733984623] [2024-11-20 14:55:58,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:55:58,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 14:55:58,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:55:58,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 14:55:58,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2024-11-20 14:55:58,178 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 14:55:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:55:58,619 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2024-11-20 14:55:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:55:58,619 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-11-20 14:55:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:55:58,621 INFO L225 Difference]: With dead ends: 136 [2024-11-20 14:55:58,621 INFO L226 Difference]: Without dead ends: 136 [2024-11-20 14:55:58,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=224, Unknown=1, NotChecked=30, Total=306 [2024-11-20 14:55:58,623 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:55:58,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 571 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 530 Invalid, 0 Unknown, 140 Unchecked, 0.4s Time] [2024-11-20 14:55:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-20 14:55:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-20 14:55:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 130 states have internal predecessors, (139), 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-20 14:55:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2024-11-20 14:55:58,633 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 26 [2024-11-20 14:55:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:55:58,634 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2024-11-20 14:55:58,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 14:55:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2024-11-20 14:55:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:55:58,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:55:58,635 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:55:58,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 14:55:58,835 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-20 14:55:58,836 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:55:58,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:55:58,836 INFO L85 PathProgramCache]: Analyzing trace with hash -880845001, now seen corresponding path program 1 times [2024-11-20 14:55:58,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:55:58,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319784095] [2024-11-20 14:55:58,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:55:58,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:55:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:58,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:55:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:59,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:55:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:55:59,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:55:59,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319784095] [2024-11-20 14:55:59,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319784095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:55:59,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304625780] [2024-11-20 14:55:59,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:55:59,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:55:59,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:55:59,028 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-20 14:55:59,030 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-20 14:55:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:59,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 14:55:59,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:55:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:55:59,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:55:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:55:59,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304625780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:55:59,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:55:59,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-20 14:55:59,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855286098] [2024-11-20 14:55:59,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:55:59,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:55:59,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:55:59,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:55:59,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:55:59,213 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 14:55:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:55:59,341 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2024-11-20 14:55:59,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:55:59,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-20 14:55:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:55:59,343 INFO L225 Difference]: With dead ends: 136 [2024-11-20 14:55:59,343 INFO L226 Difference]: Without dead ends: 136 [2024-11-20 14:55:59,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 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-20 14:55:59,344 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:55:59,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 677 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:55:59,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-20 14:55:59,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-20 14:55:59,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.84) internal successors, (138), 130 states have internal predecessors, (138), 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-20 14:55:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2024-11-20 14:55:59,353 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 28 [2024-11-20 14:55:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:55:59,353 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2024-11-20 14:55:59,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 14:55:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2024-11-20 14:55:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:55:59,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:55:59,354 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:55:59,366 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-20 14:55:59,555 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-20 14:55:59,556 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:55:59,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:55:59,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1541171918, now seen corresponding path program 1 times [2024-11-20 14:55:59,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:55:59,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878184062] [2024-11-20 14:55:59,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:55:59,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:55:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:59,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:55:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:59,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:55:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 14:55:59,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:55:59,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878184062] [2024-11-20 14:55:59,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878184062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:55:59,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513188202] [2024-11-20 14:55:59,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:55:59,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:55:59,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:55:59,661 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-20 14:55:59,663 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-20 14:55:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:55:59,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 14:55:59,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:55:59,798 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-20 14:55:59,851 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-20 14:55:59,893 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-20 14:55:59,893 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-20 14:55:59,904 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-20 14:55:59,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:55:59,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513188202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:55:59,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:55:59,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2024-11-20 14:55:59,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84060515] [2024-11-20 14:55:59,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:55:59,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:55:59,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:55:59,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:55:59,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2024-11-20 14:55:59,953 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 14:56:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:00,317 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2024-11-20 14:56:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:56:00,317 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-20 14:56:00,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:00,318 INFO L225 Difference]: With dead ends: 135 [2024-11-20 14:56:00,318 INFO L226 Difference]: Without dead ends: 135 [2024-11-20 14:56:00,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2024-11-20 14:56:00,319 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 9 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:00,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 562 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 512 Invalid, 0 Unknown, 138 Unchecked, 0.3s Time] [2024-11-20 14:56:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-20 14:56:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-20 14:56:00,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 129 states have internal predecessors, (137), 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-20 14:56:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2024-11-20 14:56:00,325 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 29 [2024-11-20 14:56:00,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:00,325 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2024-11-20 14:56:00,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 14:56:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2024-11-20 14:56:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:56:00,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:00,326 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:00,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 14:56:00,530 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-20 14:56:00,531 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:00,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:00,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1541171917, now seen corresponding path program 1 times [2024-11-20 14:56:00,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:00,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251773290] [2024-11-20 14:56:00,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:00,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:00,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:00,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:56:00,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:00,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251773290] [2024-11-20 14:56:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251773290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:00,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444904455] [2024-11-20 14:56:00,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:00,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:00,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:00,756 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-20 14:56:00,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 14:56:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:00,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-20 14:56:00,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:00,896 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-20 14:56:00,907 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-20 14:56:01,065 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-20 14:56:01,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:01,100 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-20 14:56:01,106 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:56:01,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 14:56:01,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-20 14:56:01,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:56:01,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444904455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:01,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:56:01,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-20 14:56:01,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823529322] [2024-11-20 14:56:01,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:56:01,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 14:56:01,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:01,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 14:56:01,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-11-20 14:56:01,257 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 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-20 14:56:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:01,754 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2024-11-20 14:56:01,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:56:01,754 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 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 29 [2024-11-20 14:56:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:01,756 INFO L225 Difference]: With dead ends: 152 [2024-11-20 14:56:01,756 INFO L226 Difference]: Without dead ends: 152 [2024-11-20 14:56:01,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-11-20 14:56:01,757 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 16 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:01,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1001 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 645 Invalid, 0 Unknown, 160 Unchecked, 0.4s Time] [2024-11-20 14:56:01,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-20 14:56:01,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 145. [2024-11-20 14:56:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 84 states have (on average 1.7976190476190477) internal successors, (151), 138 states have internal predecessors, (151), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-20 14:56:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2024-11-20 14:56:01,762 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 29 [2024-11-20 14:56:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:01,762 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2024-11-20 14:56:01,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 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-20 14:56:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2024-11-20 14:56:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 14:56:01,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:01,763 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:01,771 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-20 14:56:01,964 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-20 14:56:01,964 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:01,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:01,965 INFO L85 PathProgramCache]: Analyzing trace with hash -531689197, now seen corresponding path program 1 times [2024-11-20 14:56:01,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:01,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898732854] [2024-11-20 14:56:01,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:01,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:02,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:02,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:56:02,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:02,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898732854] [2024-11-20 14:56:02,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898732854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:02,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:02,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:56:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852566028] [2024-11-20 14:56:02,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:02,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:56:02,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:02,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:56:02,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:56:02,106 INFO L87 Difference]: Start difference. First operand 145 states and 161 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:56:02,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:02,382 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2024-11-20 14:56:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:56:02,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-20 14:56:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:02,383 INFO L225 Difference]: With dead ends: 144 [2024-11-20 14:56:02,383 INFO L226 Difference]: Without dead ends: 144 [2024-11-20 14:56:02,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:56:02,384 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 7 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:02,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 505 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:56:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-20 14:56:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-20 14:56:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 84 states have (on average 1.7857142857142858) internal successors, (150), 137 states have internal predecessors, (150), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-20 14:56:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 160 transitions. [2024-11-20 14:56:02,389 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 160 transitions. Word has length 30 [2024-11-20 14:56:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:02,389 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 160 transitions. [2024-11-20 14:56:02,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:56:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 160 transitions. [2024-11-20 14:56:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 14:56:02,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:02,390 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:02,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 14:56:02,390 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:02,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:02,391 INFO L85 PathProgramCache]: Analyzing trace with hash -531689196, now seen corresponding path program 1 times [2024-11-20 14:56:02,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:02,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535563526] [2024-11-20 14:56:02,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:02,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:02,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:02,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:56:02,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:02,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535563526] [2024-11-20 14:56:02,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535563526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:02,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:02,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:56:02,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363283583] [2024-11-20 14:56:02,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:02,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:56:02,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:02,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:56:02,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:56:02,637 INFO L87 Difference]: Start difference. First operand 144 states and 160 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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-20 14:56:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:02,901 INFO L93 Difference]: Finished difference Result 143 states and 159 transitions. [2024-11-20 14:56:02,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:56:02,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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 30 [2024-11-20 14:56:02,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:02,902 INFO L225 Difference]: With dead ends: 143 [2024-11-20 14:56:02,903 INFO L226 Difference]: Without dead ends: 143 [2024-11-20 14:56:02,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:56:02,904 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 6 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:02,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 530 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:56:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-20 14:56:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-20 14:56:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 136 states have internal predecessors, (149), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-20 14:56:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2024-11-20 14:56:02,909 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 30 [2024-11-20 14:56:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:02,909 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2024-11-20 14:56:02,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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-20 14:56:02,909 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2024-11-20 14:56:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-20 14:56:02,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:02,912 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:02,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 14:56:02,913 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:02,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:02,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1880683964, now seen corresponding path program 1 times [2024-11-20 14:56:02,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:02,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282069942] [2024-11-20 14:56:02,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:02,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:03,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:03,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:03,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 14:56:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-20 14:56:03,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:03,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282069942] [2024-11-20 14:56:03,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282069942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973283550] [2024-11-20 14:56:03,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:03,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:03,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:03,049 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-20 14:56:03,050 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-20 14:56:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:03,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:56:03,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 14:56:03,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:56:03,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973283550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:03,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:56:03,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-20 14:56:03,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139220746] [2024-11-20 14:56:03,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:03,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:56:03,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:03,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:56:03,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:56:03,272 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-20 14:56:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:03,283 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2024-11-20 14:56:03,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:56:03,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-20 14:56:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:03,284 INFO L225 Difference]: With dead ends: 125 [2024-11-20 14:56:03,284 INFO L226 Difference]: Without dead ends: 125 [2024-11-20 14:56:03,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 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-20 14:56:03,285 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:03,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:56:03,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-20 14:56:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-20 14:56:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 120 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-20 14:56:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2024-11-20 14:56:03,290 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 41 [2024-11-20 14:56:03,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:03,290 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2024-11-20 14:56:03,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-20 14:56:03,290 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2024-11-20 14:56:03,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-20 14:56:03,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:03,294 INFO L215 NwaCegarLoop]: trace histogram [3, 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-20 14:56:03,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-20 14:56:03,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:03,495 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:03,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:03,496 INFO L85 PathProgramCache]: Analyzing trace with hash -837194340, now seen corresponding path program 1 times [2024-11-20 14:56:03,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:03,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753170009] [2024-11-20 14:56:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:03,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:03,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:03,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:03,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-20 14:56:03,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:03,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753170009] [2024-11-20 14:56:03,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753170009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:03,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133121711] [2024-11-20 14:56:03,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:03,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:03,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:03,990 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-20 14:56:03,991 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-20 14:56:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:04,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-20 14:56:04,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:04,196 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-20 14:56:04,203 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-20 14:56:04,221 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-20 14:56:04,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:04,299 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-20 14:56:04,368 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 14:56:04,369 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-20 14:56:04,439 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-20 14:56:04,466 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-20 14:56:04,466 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-20 14:56:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2024-11-20 14:56:04,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:56:04,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133121711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:04,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:56:04,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2024-11-20 14:56:04,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47747397] [2024-11-20 14:56:04,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:56:04,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 14:56:04,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:04,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 14:56:04,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=336, Unknown=2, NotChecked=78, Total=506 [2024-11-20 14:56:04,870 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand has 17 states, 16 states have (on average 3.4375) internal successors, (55), 14 states have internal predecessors, (55), 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-20 14:56:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:05,257 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2024-11-20 14:56:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:56:05,258 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 14 states have internal predecessors, (55), 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 43 [2024-11-20 14:56:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:05,259 INFO L225 Difference]: With dead ends: 135 [2024-11-20 14:56:05,259 INFO L226 Difference]: Without dead ends: 135 [2024-11-20 14:56:05,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=440, Unknown=2, NotChecked=90, Total=650 [2024-11-20 14:56:05,260 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 201 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:05,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 353 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 453 Invalid, 0 Unknown, 272 Unchecked, 0.3s Time] [2024-11-20 14:56:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-20 14:56:05,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 117. [2024-11-20 14:56:05,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 112 states have internal predecessors, (118), 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-20 14:56:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2024-11-20 14:56:05,263 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 43 [2024-11-20 14:56:05,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:05,264 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2024-11-20 14:56:05,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 14 states have internal predecessors, (55), 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-20 14:56:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2024-11-20 14:56:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-20 14:56:05,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:05,264 INFO L215 NwaCegarLoop]: trace histogram [3, 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-20 14:56:05,274 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-20 14:56:05,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:05,465 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:05,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:05,466 INFO L85 PathProgramCache]: Analyzing trace with hash -837194339, now seen corresponding path program 1 times [2024-11-20 14:56:05,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:05,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179106178] [2024-11-20 14:56:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:05,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:05,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:05,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:05,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-20 14:56:06,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:06,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179106178] [2024-11-20 14:56:06,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179106178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:06,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859212704] [2024-11-20 14:56:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:06,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:06,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:06,048 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-20 14:56:06,049 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-20 14:56:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:06,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-20 14:56:06,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:06,258 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-20 14:56:06,272 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-20 14:56:06,288 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-20 14:56:06,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:06,324 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-20 14:56:06,346 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-20 14:56:06,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:06,385 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-20 14:56:06,482 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-20 14:56:06,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:06,521 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-20 14:56:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 14:56:06,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:56:06,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859212704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:06,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:56:06,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-20 14:56:06,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423629982] [2024-11-20 14:56:06,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:06,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:56:06,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:06,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:56:06,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2024-11-20 14:56:06,529 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-20 14:56:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:06,662 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2024-11-20 14:56:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:56:06,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 43 [2024-11-20 14:56:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:06,663 INFO L225 Difference]: With dead ends: 112 [2024-11-20 14:56:06,663 INFO L226 Difference]: Without dead ends: 112 [2024-11-20 14:56:06,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-11-20 14:56:06,664 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 11 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:06,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 273 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 151 Unchecked, 0.1s Time] [2024-11-20 14:56:06,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-20 14:56:06,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-20 14:56:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.591549295774648) internal successors, (113), 107 states have internal predecessors, (113), 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-20 14:56:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2024-11-20 14:56:06,667 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 43 [2024-11-20 14:56:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:06,668 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2024-11-20 14:56:06,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-20 14:56:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2024-11-20 14:56:06,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-20 14:56:06,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:06,669 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-20 14:56:06,678 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-20 14:56:06,872 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,SelfDestructingSolverStorable14 [2024-11-20 14:56:06,873 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:06,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:06,873 INFO L85 PathProgramCache]: Analyzing trace with hash 18522841, now seen corresponding path program 1 times [2024-11-20 14:56:06,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:06,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184483808] [2024-11-20 14:56:06,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:06,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:06,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:06,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:06,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-20 14:56:07,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:07,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184483808] [2024-11-20 14:56:07,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184483808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:07,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:07,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:56:07,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121821252] [2024-11-20 14:56:07,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:07,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:56:07,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:07,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:56:07,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:56:07,020 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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-20 14:56:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:07,216 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2024-11-20 14:56:07,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:56:07,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 46 [2024-11-20 14:56:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:07,217 INFO L225 Difference]: With dead ends: 108 [2024-11-20 14:56:07,217 INFO L226 Difference]: Without dead ends: 108 [2024-11-20 14:56:07,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:56:07,218 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 18 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:07,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 357 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:56:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-20 14:56:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-20 14:56:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 103 states have internal predecessors, (109), 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-20 14:56:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2024-11-20 14:56:07,222 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 46 [2024-11-20 14:56:07,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:07,223 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2024-11-20 14:56:07,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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-20 14:56:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2024-11-20 14:56:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-20 14:56:07,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:07,224 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-20 14:56:07,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 14:56:07,225 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:07,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:07,225 INFO L85 PathProgramCache]: Analyzing trace with hash 18522842, now seen corresponding path program 1 times [2024-11-20 14:56:07,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:07,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444852832] [2024-11-20 14:56:07,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:07,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:07,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:07,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:07,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-20 14:56:07,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:07,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444852832] [2024-11-20 14:56:07,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444852832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:07,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023035840] [2024-11-20 14:56:07,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:07,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:07,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:07,526 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-20 14:56:07,527 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-20 14:56:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:07,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 14:56:07,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:07,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 8 treesize of output 1 [2024-11-20 14:56:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-20 14:56:07,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:56:07,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023035840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:07,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:56:07,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-20 14:56:07,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558853648] [2024-11-20 14:56:07,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:07,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:56:07,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:07,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:56:07,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-20 14:56:07,863 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-20 14:56:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:07,994 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2024-11-20 14:56:07,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:56:07,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 46 [2024-11-20 14:56:07,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:07,995 INFO L225 Difference]: With dead ends: 104 [2024-11-20 14:56:07,995 INFO L226 Difference]: Without dead ends: 104 [2024-11-20 14:56:07,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 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-20 14:56:07,996 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 17 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:07,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 326 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:56:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-20 14:56:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-20 14:56:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 99 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-20 14:56:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2024-11-20 14:56:07,999 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 46 [2024-11-20 14:56:07,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:07,999 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2024-11-20 14:56:07,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-20 14:56:07,999 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2024-11-20 14:56:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-20 14:56:08,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:08,000 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-20 14:56:08,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-20 14:56:08,204 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,SelfDestructingSolverStorable16 [2024-11-20 14:56:08,205 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:08,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:08,205 INFO L85 PathProgramCache]: Analyzing trace with hash 18533764, now seen corresponding path program 1 times [2024-11-20 14:56:08,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:08,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725128620] [2024-11-20 14:56:08,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:08,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:08,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:08,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:08,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 14:56:08,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:08,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725128620] [2024-11-20 14:56:08,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725128620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:08,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331326598] [2024-11-20 14:56:08,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:08,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:08,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:08,612 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-20 14:56:08,615 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-20 14:56:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:08,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-20 14:56:08,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:09,056 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-20 14:56:09,072 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-20 14:56:09,095 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-20 14:56:09,095 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-20 14:56:09,130 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-20 14:56:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 14:56:09,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:56:09,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331326598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:09,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:56:09,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2024-11-20 14:56:09,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74384432] [2024-11-20 14:56:09,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:09,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:56:09,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:09,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:56:09,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=297, Unknown=1, NotChecked=34, Total=380 [2024-11-20 14:56:09,133 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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-20 14:56:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:09,254 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2024-11-20 14:56:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:56:09,255 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 46 [2024-11-20 14:56:09,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:09,255 INFO L225 Difference]: With dead ends: 103 [2024-11-20 14:56:09,255 INFO L226 Difference]: Without dead ends: 103 [2024-11-20 14:56:09,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=365, Unknown=1, NotChecked=38, Total=462 [2024-11-20 14:56:09,256 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 8 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:09,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 327 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 167 Unchecked, 0.1s Time] [2024-11-20 14:56:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-20 14:56:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-20 14:56:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 98 states have internal predecessors, (104), 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-20 14:56:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2024-11-20 14:56:09,259 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 46 [2024-11-20 14:56:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:09,260 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2024-11-20 14:56:09,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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-20 14:56:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2024-11-20 14:56:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-20 14:56:09,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:09,261 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-20 14:56:09,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-20 14:56:09,461 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,SelfDestructingSolverStorable17 [2024-11-20 14:56:09,461 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:09,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:09,462 INFO L85 PathProgramCache]: Analyzing trace with hash 18533765, now seen corresponding path program 1 times [2024-11-20 14:56:09,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:09,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642196421] [2024-11-20 14:56:09,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:09,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:09,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:09,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:09,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:56:09,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:09,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642196421] [2024-11-20 14:56:09,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642196421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:09,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12622443] [2024-11-20 14:56:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:09,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:09,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:09,971 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-20 14:56:09,973 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-20 14:56:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:10,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-20 14:56:10,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:10,586 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-20 14:56:10,848 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-20 14:56:10,851 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-20 14:56:10,890 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_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-20 14:56:10,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:10,935 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-20 14:56:10,947 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-20 14:56:10,947 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-20 14:56:11,009 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-20 14:56:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-20 14:56:11,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:56:11,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12622443] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:11,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:56:11,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2024-11-20 14:56:11,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094867242] [2024-11-20 14:56:11,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:56:11,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 14:56:11,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:11,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 14:56:11,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=685, Unknown=1, NotChecked=52, Total=812 [2024-11-20 14:56:11,183 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 26 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 22 states have internal predecessors, (73), 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-20 14:56:12,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:12,035 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2024-11-20 14:56:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 14:56:12,036 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 22 states have internal predecessors, (73), 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 46 [2024-11-20 14:56:12,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:12,036 INFO L225 Difference]: With dead ends: 110 [2024-11-20 14:56:12,037 INFO L226 Difference]: Without dead ends: 110 [2024-11-20 14:56:12,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=1488, Unknown=1, NotChecked=78, Total=1722 [2024-11-20 14:56:12,038 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 64 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:12,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1055 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1078 Invalid, 0 Unknown, 109 Unchecked, 0.6s Time] [2024-11-20 14:56:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-20 14:56:12,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-20 14:56:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 104 states have internal predecessors, (110), 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-20 14:56:12,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2024-11-20 14:56:12,041 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 46 [2024-11-20 14:56:12,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:12,041 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2024-11-20 14:56:12,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 22 states have internal predecessors, (73), 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-20 14:56:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2024-11-20 14:56:12,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-20 14:56:12,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:12,042 INFO L215 NwaCegarLoop]: trace histogram [3, 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-20 14:56:12,054 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-20 14:56:12,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:12,243 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:12,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:12,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2058168226, now seen corresponding path program 1 times [2024-11-20 14:56:12,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:12,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703010724] [2024-11-20 14:56:12,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:12,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:12,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:12,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:12,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-20 14:56:12,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:12,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703010724] [2024-11-20 14:56:12,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703010724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:12,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560250064] [2024-11-20 14:56:12,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:12,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:12,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:12,544 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-20 14:56:12,545 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-20 14:56:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:12,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-20 14:56:12,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:12,795 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-20 14:56:12,801 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-20 14:56:12,835 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-20 14:56:12,841 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-20 14:56:12,932 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 14:56:12,933 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-20 14:56:12,967 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 14:56:12,967 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 17 treesize of output 21 [2024-11-20 14:56:13,065 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 11 treesize of output 7 [2024-11-20 14:56:13,069 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-20 14:56:13,076 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-20 14:56:13,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:13,109 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 14 treesize of output 9 [2024-11-20 14:56:13,125 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-20 14:56:13,125 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 16 treesize of output 18 [2024-11-20 14:56:13,184 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-20 14:56:13,199 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-20 14:56:13,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:13,232 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-20 14:56:13,270 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 21 not checked. [2024-11-20 14:56:13,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:56:13,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560250064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:13,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:56:13,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2024-11-20 14:56:13,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382978987] [2024-11-20 14:56:13,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:56:13,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-20 14:56:13,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:13,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-20 14:56:13,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=400, Unknown=2, NotChecked=82, Total=552 [2024-11-20 14:56:13,367 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 17 states have internal predecessors, (78), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-20 14:56:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:13,834 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2024-11-20 14:56:13,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 14:56:13,834 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 17 states have internal predecessors, (78), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2024-11-20 14:56:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:13,835 INFO L225 Difference]: With dead ends: 104 [2024-11-20 14:56:13,835 INFO L226 Difference]: Without dead ends: 104 [2024-11-20 14:56:13,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=744, Unknown=2, NotChecked=114, Total=992 [2024-11-20 14:56:13,836 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 168 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:13,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 662 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 664 Invalid, 0 Unknown, 190 Unchecked, 0.3s Time] [2024-11-20 14:56:13,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-20 14:56:13,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-20 14:56:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 98 states have internal predecessors, (103), 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-20 14:56:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2024-11-20 14:56:13,840 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 49 [2024-11-20 14:56:13,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:13,840 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2024-11-20 14:56:13,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 17 states have internal predecessors, (78), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-20 14:56:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2024-11-20 14:56:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-20 14:56:13,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:13,841 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-20 14:56:13,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-20 14:56:14,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:14,042 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:14,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:14,043 INFO L85 PathProgramCache]: Analyzing trace with hash 692995273, now seen corresponding path program 1 times [2024-11-20 14:56:14,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:14,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375009414] [2024-11-20 14:56:14,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:14,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:14,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:14,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:14,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 14:56:14,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:14,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375009414] [2024-11-20 14:56:14,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375009414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:14,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:14,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:56:14,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131184244] [2024-11-20 14:56:14,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:14,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:56:14,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:14,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:56:14,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:56:14,185 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-20 14:56:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:14,330 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2024-11-20 14:56:14,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:56:14,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-20 14:56:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:14,331 INFO L225 Difference]: With dead ends: 103 [2024-11-20 14:56:14,331 INFO L226 Difference]: Without dead ends: 103 [2024-11-20 14:56:14,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:56:14,332 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 2 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:14,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 392 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:56:14,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-20 14:56:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-20 14:56:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.36) internal successors, (102), 97 states have internal predecessors, (102), 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-20 14:56:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2024-11-20 14:56:14,335 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 52 [2024-11-20 14:56:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:14,335 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2024-11-20 14:56:14,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-20 14:56:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2024-11-20 14:56:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-20 14:56:14,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:14,336 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-20 14:56:14,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 14:56:14,337 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:14,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:14,337 INFO L85 PathProgramCache]: Analyzing trace with hash 692995274, now seen corresponding path program 1 times [2024-11-20 14:56:14,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:14,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229013994] [2024-11-20 14:56:14,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:14,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:14,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:14,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:14,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-20 14:56:14,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:14,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229013994] [2024-11-20 14:56:14,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229013994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:14,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586819607] [2024-11-20 14:56:14,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:14,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:14,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:14,755 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-20 14:56:14,757 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-20 14:56:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:15,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 14:56:15,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:15,094 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 23 treesize of output 15 [2024-11-20 14:56:15,096 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 28 treesize of output 16 [2024-11-20 14:56:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 14:56:15,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:56:15,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586819607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:15,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:56:15,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-11-20 14:56:15,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456521663] [2024-11-20 14:56:15,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:15,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:56:15,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:15,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:56:15,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-20 14:56:15,146 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-20 14:56:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:15,252 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2024-11-20 14:56:15,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:56:15,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-20 14:56:15,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:15,253 INFO L225 Difference]: With dead ends: 102 [2024-11-20 14:56:15,253 INFO L226 Difference]: Without dead ends: 102 [2024-11-20 14:56:15,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2024-11-20 14:56:15,254 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:15,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 364 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:56:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-20 14:56:15,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-20 14:56:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 96 states have internal predecessors, (101), 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-20 14:56:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2024-11-20 14:56:15,257 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 52 [2024-11-20 14:56:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:15,257 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2024-11-20 14:56:15,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-20 14:56:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2024-11-20 14:56:15,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-20 14:56:15,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:15,258 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-20 14:56:15,268 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-20 14:56:15,458 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,SelfDestructingSolverStorable21 [2024-11-20 14:56:15,459 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:15,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:15,459 INFO L85 PathProgramCache]: Analyzing trace with hash 8017033, now seen corresponding path program 1 times [2024-11-20 14:56:15,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:15,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696198350] [2024-11-20 14:56:15,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:15,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:16,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:16,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:16,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:56:16,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:16,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696198350] [2024-11-20 14:56:16,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696198350] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:16,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399564663] [2024-11-20 14:56:16,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:16,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:16,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:16,481 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-20 14:56:16,484 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-20 14:56:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:16,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-20 14:56:16,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:16,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 14:56:16,885 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 5 [2024-11-20 14:56:16,888 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-20 14:56:16,888 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 7 [2024-11-20 14:56:16,980 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |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-20 14:56:16,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:16,998 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 28 treesize of output 23 [2024-11-20 14:56:17,025 INFO L349 Elim1Store]: treesize reduction 116, result has 32.2 percent of original size [2024-11-20 14:56:17,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 69 [2024-11-20 14:56:17,119 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 33 [2024-11-20 14:56:17,176 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 43 treesize of output 13 [2024-11-20 14:56:17,266 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-20 14:56:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 14:56:17,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:56:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399564663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:17,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:56:17,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [20] total 34 [2024-11-20 14:56:17,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102506323] [2024-11-20 14:56:17,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:17,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 14:56:17,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:17,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 14:56:17,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1030, Unknown=1, NotChecked=64, Total=1190 [2024-11-20 14:56:17,400 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 states have internal predecessors, (40), 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-20 14:56:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:18,017 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-11-20 14:56:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 14:56:18,018 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 states have internal predecessors, (40), 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 53 [2024-11-20 14:56:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:18,018 INFO L225 Difference]: With dead ends: 101 [2024-11-20 14:56:18,018 INFO L226 Difference]: Without dead ends: 101 [2024-11-20 14:56:18,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=1287, Unknown=1, NotChecked=72, Total=1482 [2024-11-20 14:56:18,019 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 13 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:18,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 530 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 498 Invalid, 0 Unknown, 147 Unchecked, 0.4s Time] [2024-11-20 14:56:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-20 14:56:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-20 14:56:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 95 states have internal predecessors, (100), 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-20 14:56:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2024-11-20 14:56:18,023 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 53 [2024-11-20 14:56:18,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:18,023 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2024-11-20 14:56:18,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 states have internal predecessors, (40), 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-20 14:56:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2024-11-20 14:56:18,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-20 14:56:18,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:18,024 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-20 14:56:18,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-20 14:56:18,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:18,225 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:18,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:18,225 INFO L85 PathProgramCache]: Analyzing trace with hash 8017034, now seen corresponding path program 1 times [2024-11-20 14:56:18,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:18,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965066314] [2024-11-20 14:56:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:18,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:19,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:19,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:19,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:56:20,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:20,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965066314] [2024-11-20 14:56:20,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965066314] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:20,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742607408] [2024-11-20 14:56:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:20,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:20,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:20,187 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-20 14:56:20,188 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-20 14:56:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:20,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-20 14:56:20,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:20,485 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-20 14:56:20,491 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-20 14:56:20,760 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 14:56:20,760 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-20 14:56:20,773 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:56:20,774 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-20 14:56:20,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 19 treesize of output 1 [2024-11-20 14:56:20,983 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 13 treesize of output 9 [2024-11-20 14:56:21,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 19 [2024-11-20 14:56:21,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-20 14:56:21,179 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-20 14:56:21,183 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-20 14:56:21,335 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-20 14:56:21,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:21,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 52 [2024-11-20 14:56:21,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:21,370 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 28 treesize of output 23 [2024-11-20 14:56:21,388 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-20 14:56:21,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-20 14:56:21,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-20 14:56:21,451 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 50 [2024-11-20 14:56:21,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 17 [2024-11-20 14:56:21,513 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 13 treesize of output 3 [2024-11-20 14:56:21,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-20 14:56:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-20 14:56:21,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:56:22,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742607408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:22,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:56:22,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2024-11-20 14:56:22,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259026546] [2024-11-20 14:56:22,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:56:22,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-20 14:56:22,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:22,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-20 14:56:22,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2609, Unknown=1, NotChecked=102, Total=2862 [2024-11-20 14:56:22,076 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 49 states, 46 states have (on average 2.0) internal successors, (92), 42 states have internal predecessors, (92), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-20 14:56:24,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:24,059 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2024-11-20 14:56:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-20 14:56:24,059 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 2.0) internal successors, (92), 42 states have internal predecessors, (92), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2024-11-20 14:56:24,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:24,060 INFO L225 Difference]: With dead ends: 100 [2024-11-20 14:56:24,060 INFO L226 Difference]: Without dead ends: 100 [2024-11-20 14:56:24,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=272, Invalid=4423, Unknown=1, NotChecked=134, Total=4830 [2024-11-20 14:56:24,062 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 21 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:24,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1491 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1844 Invalid, 0 Unknown, 95 Unchecked, 1.1s Time] [2024-11-20 14:56:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-20 14:56:24,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-20 14:56:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.32) internal successors, (99), 94 states have internal predecessors, (99), 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-20 14:56:24,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2024-11-20 14:56:24,065 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 53 [2024-11-20 14:56:24,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:24,065 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2024-11-20 14:56:24,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 2.0) internal successors, (92), 42 states have internal predecessors, (92), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-20 14:56:24,065 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2024-11-20 14:56:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-20 14:56:24,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:24,066 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-20 14:56:24,075 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-20 14:56:24,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:24,267 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:24,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:24,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1967278510, now seen corresponding path program 1 times [2024-11-20 14:56:24,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:24,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422157227] [2024-11-20 14:56:24,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:24,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:24,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:24,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:24,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:24,555 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-20 14:56:24,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:24,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422157227] [2024-11-20 14:56:24,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422157227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:24,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:24,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 14:56:24,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309044085] [2024-11-20 14:56:24,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:24,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:56:24,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:24,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:56:24,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:56:24,558 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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-20 14:56:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:24,732 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2024-11-20 14:56:24,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:56:24,733 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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 59 [2024-11-20 14:56:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:24,733 INFO L225 Difference]: With dead ends: 101 [2024-11-20 14:56:24,733 INFO L226 Difference]: Without dead ends: 101 [2024-11-20 14:56:24,734 INFO L431 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-20 14:56:24,734 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 37 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:24,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 427 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:56:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-20 14:56:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-20 14:56:24,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.28) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 14:56:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-11-20 14:56:24,737 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 59 [2024-11-20 14:56:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:24,737 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-11-20 14:56:24,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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-20 14:56:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-11-20 14:56:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-20 14:56:24,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:24,738 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-20 14:56:24,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 14:56:24,738 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:24,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:24,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1967278511, now seen corresponding path program 1 times [2024-11-20 14:56:24,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:24,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341368228] [2024-11-20 14:56:24,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:24,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:25,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:25,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-20 14:56:25,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:25,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341368228] [2024-11-20 14:56:25,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341368228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:25,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:25,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 14:56:25,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238506936] [2024-11-20 14:56:25,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:25,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:56:25,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:25,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:56:25,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:56:25,206 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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-20 14:56:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:25,435 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2024-11-20 14:56:25,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:56:25,436 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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 59 [2024-11-20 14:56:25,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:25,437 INFO L225 Difference]: With dead ends: 99 [2024-11-20 14:56:25,437 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 14:56:25,437 INFO L431 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-20 14:56:25,437 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 32 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:25,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 463 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:56:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 14:56:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-11-20 14:56:25,443 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-20 14:56:25,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2024-11-20 14:56:25,443 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 59 [2024-11-20 14:56:25,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:25,447 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2024-11-20 14:56:25,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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-20 14:56:25,448 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2024-11-20 14:56:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-20 14:56:25,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:25,448 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2024-11-20 14:56:25,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 14:56:25,448 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:25,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash 313194049, now seen corresponding path program 1 times [2024-11-20 14:56:25,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:25,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840625389] [2024-11-20 14:56:25,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:25,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:27,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:27,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:27,360 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:56:27,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:27,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840625389] [2024-11-20 14:56:27,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840625389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:27,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734123109] [2024-11-20 14:56:27,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:27,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:27,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:27,363 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-20 14:56:27,364 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-20 14:56:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:27,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-20 14:56:27,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:27,933 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 15 treesize of output 1 [2024-11-20 14:56:28,091 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 13 treesize of output 5 [2024-11-20 14:56:28,095 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-20 14:56:28,096 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 7 [2024-11-20 14:56:28,286 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 13 treesize of output 9 [2024-11-20 14:56:28,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:28,492 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 22 treesize of output 17 [2024-11-20 14:56:28,512 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-11-20 14:56:28,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2024-11-20 14:56:28,955 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:56:28,956 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:56:28,956 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 8 [2024-11-20 14:56:29,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:56:29,372 INFO L349 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2024-11-20 14:56:29,372 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 29 [2024-11-20 14:56:29,382 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:56:29,383 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-20 14:56:29,543 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 25 treesize of output 13 [2024-11-20 14:56:29,565 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 18 treesize of output 13 [2024-11-20 14:56:29,664 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 18 treesize of output 13 [2024-11-20 14:56:29,773 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 57 treesize of output 21 [2024-11-20 14:56:29,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:56:29,894 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 25 treesize of output 17 [2024-11-20 14:56:29,897 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:56:29,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:56:29,900 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 21 treesize of output 16 [2024-11-20 14:56:29,983 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 7 [2024-11-20 14:56:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:56:29,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:56:30,135 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4621 (Array Int Int)) (v_ArrVal_4622 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4621))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4622) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 (select v_ArrVal_4622 .cse1))) v_ArrVal_4622))))) is different from false [2024-11-20 14:56:30,149 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4620 (Array Int Int)) (v_ArrVal_4621 (Array Int Int)) (v_ArrVal_4622 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4620) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4621))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4622) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 (select v_ArrVal_4622 .cse1))) v_ArrVal_4622))))) is different from false [2024-11-20 14:56:30,162 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4619 (Array Int Int)) (v_ArrVal_4620 (Array Int Int)) (v_ArrVal_4621 (Array Int Int)) (v_ArrVal_4622 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4620) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4621) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4622) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_4619 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_4619 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (not (= v_ArrVal_4622 (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4619) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4620) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4621) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse0 (select v_ArrVal_4622 .cse0))))))) is different from false [2024-11-20 14:56:30,175 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4619 (Array Int Int)) (v_ArrVal_4620 (Array Int Int)) (v_ArrVal_4621 (Array Int Int)) (v_ArrVal_4622 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4620) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4621) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4622) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_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$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_4619 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_4619 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (not (= v_ArrVal_4622 (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4619) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4620) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4621) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse0 (select v_ArrVal_4622 .cse0))))))) is different from false [2024-11-20 14:56:30,189 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4619 (Array Int Int)) (v_ArrVal_4620 (Array Int Int)) (v_ArrVal_4621 (Array Int Int)) (v_ArrVal_4622 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_4620) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4621) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4622) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_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$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_4619 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_4619 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (not (= v_ArrVal_4622 (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4619) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_4620) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4621) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse0 (select v_ArrVal_4622 .cse0))))))) is different from false [2024-11-20 14:56:30,210 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4619 (Array Int Int)) (v_ArrVal_4620 (Array Int Int)) (v_ArrVal_4621 (Array Int Int)) (v_ArrVal_4622 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (not (= v_ArrVal_4619 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_4619 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (not (= v_ArrVal_4622 (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4619) .cse0 v_ArrVal_4620) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4621) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 (select v_ArrVal_4622 .cse1))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_4620) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4621) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4622) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_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$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2024-11-20 14:56:30,232 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4619 (Array Int Int)) (v_ArrVal_4620 (Array Int Int)) (v_ArrVal_4621 (Array Int Int)) (v_ArrVal_4622 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (= (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_4620) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_4621) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4622) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_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$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_4619 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_4619 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (not (= v_ArrVal_4622 (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4619) .cse0 v_ArrVal_4620) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_4621) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 (select v_ArrVal_4622 .cse2))))))))) is different from false [2024-11-20 14:56:30,254 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4619 (Array Int Int)) (v_ArrVal_4620 (Array Int Int)) (v_ArrVal_4621 (Array Int Int)) (v_ArrVal_4622 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| 4)))) (or (not (= (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4619) .cse0 v_ArrVal_4620) .cse1 v_ArrVal_4621) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 (select v_ArrVal_4622 .cse2))) v_ArrVal_4622)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_4620) .cse1 v_ArrVal_4621) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4622) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_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$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_4619 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_4619 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))))))) is different from false [2024-11-20 14:56:30,281 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4619 (Array Int Int)) (v_ArrVal_4620 (Array Int Int)) (v_ArrVal_4621 (Array Int Int)) (v_ArrVal_4622 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_4620) .cse1 v_ArrVal_4621) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4622) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_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$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4619) .cse0 v_ArrVal_4620) .cse1 v_ArrVal_4621) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse4 (select v_ArrVal_4622 .cse4))) v_ArrVal_4622)) (not (= v_ArrVal_4619 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_4619 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))))))) is different from false [2024-11-20 14:56:30,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:56:30,658 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 1454 treesize of output 1444 [2024-11-20 14:56:30,707 INFO L349 Elim1Store]: treesize reduction 42, result has 55.3 percent of original size [2024-11-20 14:56:30,707 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 404 treesize of output 405 [2024-11-20 14:56:30,759 INFO L349 Elim1Store]: treesize reduction 42, result has 55.3 percent of original size [2024-11-20 14:56:30,760 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 354 treesize of output 380 [2024-11-20 14:56:30,980 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 11 treesize of output 3 [2024-11-20 14:56:31,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:56:31,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 8 [2024-11-20 14:56:31,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:56:31,116 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 184 treesize of output 186 [2024-11-20 14:56:31,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:56:31,203 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 184 treesize of output 186 [2024-11-20 14:56:31,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:56:31,359 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 120 treesize of output 114 [2024-11-20 14:56:31,413 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 12 treesize of output 8 [2024-11-20 14:56:31,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:56:31,425 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 309 treesize of output 261 [2024-11-20 14:56:31,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734123109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:31,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:56:31,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 59 [2024-11-20 14:56:31,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060556466] [2024-11-20 14:56:31,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:56:31,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-20 14:56:31,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:31,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-20 14:56:31,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3827, Unknown=22, NotChecked=1188, Total=5256 [2024-11-20 14:56:31,692 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 59 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 53 states have internal predecessors, (102), 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-20 14:56:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:34,299 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2024-11-20 14:56:34,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-20 14:56:34,300 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 53 states have internal predecessors, (102), 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 63 [2024-11-20 14:56:34,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:34,301 INFO L225 Difference]: With dead ends: 95 [2024-11-20 14:56:34,301 INFO L226 Difference]: Without dead ends: 95 [2024-11-20 14:56:34,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=450, Invalid=7936, Unknown=22, NotChecked=1692, Total=10100 [2024-11-20 14:56:34,303 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 38 mSDsluCounter, 1994 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:34,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2052 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 14:56:34,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-20 14:56:34,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-20 14:56:34,306 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-20 14:56:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-20 14:56:34,307 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 63 [2024-11-20 14:56:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:34,307 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-20 14:56:34,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 53 states have internal predecessors, (102), 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-20 14:56:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-20 14:56:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-20 14:56:34,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:34,308 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2024-11-20 14:56:34,316 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-20 14:56:34,509 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,SelfDestructingSolverStorable26 [2024-11-20 14:56:34,509 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:34,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:34,510 INFO L85 PathProgramCache]: Analyzing trace with hash 313174131, now seen corresponding path program 1 times [2024-11-20 14:56:34,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:34,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317869390] [2024-11-20 14:56:34,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:34,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:35,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:35,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:35,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 14:56:35,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:35,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317869390] [2024-11-20 14:56:35,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317869390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:35,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:35,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-11-20 14:56:35,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877773181] [2024-11-20 14:56:35,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:35,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-20 14:56:35,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:35,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-20 14:56:35,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=747, Unknown=0, NotChecked=0, Total=812 [2024-11-20 14:56:35,959 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 29 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 14:56:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:36,718 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2024-11-20 14:56:36,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-20 14:56:36,719 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2024-11-20 14:56:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:36,720 INFO L225 Difference]: With dead ends: 100 [2024-11-20 14:56:36,720 INFO L226 Difference]: Without dead ends: 100 [2024-11-20 14:56:36,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=1291, Unknown=0, NotChecked=0, Total=1406 [2024-11-20 14:56:36,721 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 39 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:36,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 918 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 14:56:36,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-20 14:56:36,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2024-11-20 14:56:36,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.25) internal successors, (95), 90 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-20 14:56:36,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2024-11-20 14:56:36,724 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 63 [2024-11-20 14:56:36,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:36,724 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2024-11-20 14:56:36,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 14:56:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2024-11-20 14:56:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-20 14:56:36,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:36,725 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2024-11-20 14:56:36,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-20 14:56:36,725 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:36,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:36,725 INFO L85 PathProgramCache]: Analyzing trace with hash 313174132, now seen corresponding path program 1 times [2024-11-20 14:56:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:36,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251148993] [2024-11-20 14:56:36,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:38,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:38,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:39,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:56:39,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:39,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251148993] [2024-11-20 14:56:39,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251148993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:39,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598974101] [2024-11-20 14:56:39,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:39,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:39,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:39,188 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-20 14:56:39,189 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-20 14:56:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:39,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 123 conjuncts are in the unsatisfiable core [2024-11-20 14:56:39,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:39,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-20 14:56:39,807 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 15 treesize of output 1 [2024-11-20 14:56:39,956 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 13 treesize of output 5 [2024-11-20 14:56:39,963 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-20 14:56:39,963 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 7 [2024-11-20 14:56:39,969 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-20 14:56:40,259 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-20 14:56:40,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-20 14:56:40,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:40,267 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 22 treesize of output 17 [2024-11-20 14:56:40,284 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-11-20 14:56:40,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2024-11-20 14:56:41,121 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:56:41,121 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2024-11-20 14:56:41,130 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:56:41,145 INFO L349 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2024-11-20 14:56:41,145 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 41 [2024-11-20 14:56:41,229 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-20 14:56:41,241 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 11 treesize of output 7 [2024-11-20 14:56:41,334 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-20 14:56:41,334 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 56 [2024-11-20 14:56:41,338 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 12 treesize of output 8 [2024-11-20 14:56:41,344 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 11 [2024-11-20 14:56:41,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-20 14:56:41,461 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 26 treesize of output 19 [2024-11-20 14:56:41,478 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 55 treesize of output 19 [2024-11-20 14:56:41,485 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 77 treesize of output 29 [2024-11-20 14:56:41,599 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 82 treesize of output 54 [2024-11-20 14:56:41,603 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 58 treesize of output 38 [2024-11-20 14:56:41,730 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 35 treesize of output 17 [2024-11-20 14:56:41,735 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-20 14:56:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:56:41,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:56:42,221 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_5112 (Array Int Int)) (v_ArrVal_5111 (Array Int Int)) (v_ArrVal_5113 Int)) (<= (+ 12 (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5111))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 v_ArrVal_5113))) .cse2) .cse3)) (select |c_#length| (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5112))) (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse2) .cse3)))) (forall ((v_ArrVal_5111 (Array Int Int)) (v_ArrVal_5113 Int)) (<= 0 (+ 8 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5111))) (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 v_ArrVal_5113))) .cse2) .cse3)))))) is different from false [2024-11-20 14:56:42,233 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_5110 (Array Int Int)) (v_ArrVal_5112 (Array Int Int)) (v_ArrVal_5111 (Array Int Int)) (v_ArrVal_5109 (Array Int Int)) (v_ArrVal_5113 Int)) (<= (+ 12 (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5109) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5111))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 v_ArrVal_5113))) .cse2) .cse3)) (select |c_#length| (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5110) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5112))) (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse2) .cse3)))) (forall ((v_ArrVal_5111 (Array Int Int)) (v_ArrVal_5109 (Array Int Int)) (v_ArrVal_5113 Int)) (<= 0 (+ 8 (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5109) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5111))) (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 v_ArrVal_5113))) .cse2) .cse3)))))) is different from false [2024-11-20 14:56:42,268 INFO L349 Elim1Store]: treesize reduction 31, result has 58.1 percent of original size [2024-11-20 14:56:42,269 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 2 case distinctions, treesize of input 626 treesize of output 580 [2024-11-20 14:56:42,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:56:42,287 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 913 treesize of output 901 [2024-11-20 14:56:42,303 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 628 treesize of output 598 [2024-11-20 14:56:42,315 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 774 treesize of output 714 [2024-11-20 14:56:42,331 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 10 treesize of output 4 [2024-11-20 14:56:42,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:56:42,421 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 725 treesize of output 711 [2024-11-20 14:56:43,441 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:56:43,442 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:56:43,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:43,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:56:43,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 77 [2024-11-20 14:56:43,450 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:56:43,451 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:56:43,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2024-11-20 14:56:43,456 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:56:43,458 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2024-11-20 14:56:45,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598974101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:45,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:56:45,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31] total 57 [2024-11-20 14:56:45,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482428662] [2024-11-20 14:56:45,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:56:45,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-20 14:56:45,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:45,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-20 14:56:45,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=5168, Unknown=2, NotChecked=290, Total=5700 [2024-11-20 14:56:45,514 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 58 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 52 states have internal predecessors, (107), 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-20 14:56:48,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:48,723 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2024-11-20 14:56:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-20 14:56:48,724 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 52 states have internal predecessors, (107), 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 63 [2024-11-20 14:56:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:48,724 INFO L225 Difference]: With dead ends: 102 [2024-11-20 14:56:48,724 INFO L226 Difference]: Without dead ends: 102 [2024-11-20 14:56:48,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1837 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=499, Invalid=10013, Unknown=2, NotChecked=406, Total=10920 [2024-11-20 14:56:48,727 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 103 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:48,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1886 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 14:56:48,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-20 14:56:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-11-20 14:56:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 92 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-20 14:56:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2024-11-20 14:56:48,729 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 63 [2024-11-20 14:56:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:48,730 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2024-11-20 14:56:48,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 52 states have internal predecessors, (107), 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-20 14:56:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2024-11-20 14:56:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 14:56:48,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:48,731 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:48,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-20 14:56:48,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-20 14:56:48,931 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-20 14:56:48,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash -208454633, now seen corresponding path program 1 times [2024-11-20 14:56:48,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:48,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893231380] [2024-11-20 14:56:48,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:48,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:51,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:56:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:51,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 14:56:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:52,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 14:56:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:56:52,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:52,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893231380] [2024-11-20 14:56:52,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893231380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:52,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799460733] [2024-11-20 14:56:52,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:52,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:52,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:52,915 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:56:52,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-20 14:56:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:53,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 155 conjuncts are in the unsatisfiable core [2024-11-20 14:56:53,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:53,346 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-20 14:56:53,632 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 13 treesize of output 9 [2024-11-20 14:56:53,740 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:56:53,740 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-20 14:56:53,866 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 25 treesize of output 13 [2024-11-20 14:56:53,951 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 18 treesize of output 13 [2024-11-20 14:56:54,113 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 18 treesize of output 13 [2024-11-20 14:56:54,207 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 19 treesize of output 1 [2024-11-20 14:56:54,215 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 13 [2024-11-20 14:56:54,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 14 [2024-11-20 14:56:54,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-20 14:56:54,450 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-20 14:56:54,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:54,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-11-20 14:56:54,736 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-20 14:56:54,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-20 14:56:54,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-20 14:56:55,673 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:56:55,674 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 69 [2024-11-20 14:56:55,678 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:56:55,678 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2024-11-20 14:56:55,792 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-20 14:56:55,802 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 41 treesize of output 28 [2024-11-20 14:56:55,817 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 18 treesize of output 13 [2024-11-20 14:56:55,958 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-20 14:56:55,958 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 122 treesize of output 103 [2024-11-20 14:56:55,962 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 84 treesize of output 65 [2024-11-20 14:56:55,966 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 11 treesize of output 3 [2024-11-20 14:56:55,969 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 57 treesize of output 21 [2024-11-20 14:56:56,073 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 42 treesize of output 33 [2024-11-20 14:56:56,080 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 26 treesize of output 21 [2024-11-20 14:56:56,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-20 14:56:56,113 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 123 treesize of output 63 [2024-11-20 14:56:56,120 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 50 treesize of output 37 [2024-11-20 14:56:56,124 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 73 treesize of output 37 [2024-11-20 14:56:56,271 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 113 treesize of output 77 [2024-11-20 14:56:56,273 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 81 treesize of output 53 [2024-11-20 14:56:56,479 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 57 treesize of output 29 [2024-11-20 14:56:56,482 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 21 treesize of output 13 [2024-11-20 14:56:56,683 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-20 14:56:56,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:56:56,965 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5444 (Array Int Int)) (v_ArrVal_5446 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5444) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)) .cse1) .cse2)) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse0 v_ArrVal_5446)) .cse1) .cse2)))))) is different from false [2024-11-20 14:56:56,973 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5442 (Array Int Int)) (v_ArrVal_5441 (Array Int Int)) (v_ArrVal_5444 (Array Int Int)) (v_ArrVal_5443 (Array Int Int)) (v_ArrVal_5446 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5442) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5444) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5441))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse2) .cse3)) (+ 8 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5443))) (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 v_ArrVal_5446))) .cse2) .cse3)))))) is different from false [2024-11-20 14:56:56,986 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5440 (Array Int Int)) (v_ArrVal_5442 (Array Int Int)) (v_ArrVal_5441 (Array Int Int)) (v_ArrVal_5444 (Array Int Int)) (v_ArrVal_5443 (Array Int Int)) (v_ArrVal_5446 Int) (v_ArrVal_5439 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|) .cse0 (select v_ArrVal_5439 .cse0))) v_ArrVal_5439)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5439) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5442) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5444) (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5440) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5441))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse3) .cse4)) (+ (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5438) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5443))) (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 v_ArrVal_5446))) .cse3) .cse4) 8)))))) is different from false [2024-11-20 14:56:57,018 INFO L349 Elim1Store]: treesize reduction 31, result has 58.1 percent of original size [2024-11-20 14:56:57,019 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 2 case distinctions, treesize of input 744 treesize of output 742 [2024-11-20 14:56:57,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:56:57,032 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 2994 treesize of output 2982 [2024-11-20 14:56:57,050 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 1948 treesize of output 1918 [2024-11-20 14:56:57,072 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 2534 treesize of output 2474 [2024-11-20 14:56:57,116 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 10 treesize of output 4 [2024-11-20 14:56:57,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:56:57,146 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 2814 treesize of output 2794