./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_prepend_equal.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 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:40:39,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:40:39,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:40:39,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:40:39,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:40:39,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:40:39,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:40:39,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:40:39,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:40:39,993 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:40:39,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:40:39,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:40:39,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:40:39,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:40:39,995 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:40:39,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:40:39,995 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:40:39,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:40:39,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:40:39,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:40:39,996 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:40:40,000 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:40:40,001 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:40:40,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:40:40,001 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:40:40,002 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:40:40,002 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:40:40,004 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:40:40,005 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:40:40,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:40:40,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:40:40,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:40:40,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:40:40,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:40:40,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:40:40,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:40:40,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:40:40,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:40:40,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:40:40,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:40:40,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:40:40,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:40:40,008 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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2024-11-12 13:40:40,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:40:40,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:40:40,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:40:40,290 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:40:40,291 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:40:40,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2024-11-12 13:40:41,704 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:40:41,938 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:40:41,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2024-11-12 13:40:41,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd62284b5/30006c56aab0416f80651b9cd449f52e/FLAGd3167a663 [2024-11-12 13:40:41,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd62284b5/30006c56aab0416f80651b9cd449f52e [2024-11-12 13:40:41,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:40:41,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:40:41,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:40:41,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:40:41,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:40:41,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:40:41" (1/1) ... [2024-11-12 13:40:41,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43555b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:41, skipping insertion in model container [2024-11-12 13:40:41,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:40:41" (1/1) ... [2024-11-12 13:40:42,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:40:42,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:40:42,405 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:40:42,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:40:42,485 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:40:42,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:42 WrapperNode [2024-11-12 13:40:42,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:40:42,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:40:42,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:40:42,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:40:42,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:42" (1/1) ... [2024-11-12 13:40:42,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:42" (1/1) ... [2024-11-12 13:40:42,543 INFO L138 Inliner]: procedures = 127, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 121 [2024-11-12 13:40:42,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:40:42,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:40:42,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:40:42,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:40:42,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:42" (1/1) ... [2024-11-12 13:40:42,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:42" (1/1) ... [2024-11-12 13:40:42,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:42" (1/1) ... [2024-11-12 13:40:42,582 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 7, 12]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2024-11-12 13:40:42,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:42" (1/1) ... [2024-11-12 13:40:42,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:42" (1/1) ... [2024-11-12 13:40:42,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:42" (1/1) ... [2024-11-12 13:40:42,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:42" (1/1) ... [2024-11-12 13:40:42,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:42" (1/1) ... [2024-11-12 13:40:42,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:42" (1/1) ... [2024-11-12 13:40:42,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:40:42,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:40:42,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:40:42,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:40:42,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:42" (1/1) ... [2024-11-12 13:40:42,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:40:42,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:40:42,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 13:40:42,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 13:40:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-12 13:40:42,691 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-12 13:40:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 13:40:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 13:40:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 13:40:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:40:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 13:40:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 13:40:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:40:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:40:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 13:40:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:40:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:40:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 13:40:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:40:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:40:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 13:40:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:40:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 13:40:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 13:40:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-12 13:40:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:40:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 13:40:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 13:40:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:40:42,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:40:42,806 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:40:42,808 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:40:42,827 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-12 13:40:43,078 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-12 13:40:43,078 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:40:43,094 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:40:43,094 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-12 13:40:43,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:40:43 BoogieIcfgContainer [2024-11-12 13:40:43,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:40:43,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:40:43,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:40:43,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:40:43,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:40:41" (1/3) ... [2024-11-12 13:40:43,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f932af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:40:43, skipping insertion in model container [2024-11-12 13:40:43,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:42" (2/3) ... [2024-11-12 13:40:43,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f932af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:40:43, skipping insertion in model container [2024-11-12 13:40:43,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:40:43" (3/3) ... [2024-11-12 13:40:43,102 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2024-11-12 13:40:43,119 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:40:43,119 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-12 13:40:43,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:40:43,167 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;@7ff3d29a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:40:43,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-12 13:40:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 53 states have (on average 2.018867924528302) internal successors, (107), 95 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:40:43,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:40:43,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:40:43,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:40:43,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:40:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2024-11-12 13:40:43,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:40:43,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341363860] [2024-11-12 13:40:43,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:43,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:40:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:43,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:40:43,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341363860] [2024-11-12 13:40:43,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341363860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:40:43,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:40:43,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:40:43,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042745495] [2024-11-12 13:40:43,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:40:43,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:40:43,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:40:43,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:40:43,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:40:43,503 INFO L87 Difference]: Start difference. First operand has 97 states, 53 states have (on average 2.018867924528302) internal successors, (107), 95 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:40:43,622 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-11-12 13:40:43,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:40:43,624 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 13:40:43,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:40:43,631 INFO L225 Difference]: With dead ends: 93 [2024-11-12 13:40:43,631 INFO L226 Difference]: Without dead ends: 87 [2024-11-12 13:40:43,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:40:43,637 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:40:43,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 137 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:40:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-12 13:40:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-12 13:40:43,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 86 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:43,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-12 13:40:43,669 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 5 [2024-11-12 13:40:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:40:43,669 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-12 13:40:43,670 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-12 13:40:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:40:43,670 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:40:43,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:40:43,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:40:43,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:40:43,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:40:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2024-11-12 13:40:43,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:40:43,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555480156] [2024-11-12 13:40:43,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:43,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:40:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:43,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:40:43,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555480156] [2024-11-12 13:40:43,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555480156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:40:43,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:40:43,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:40:43,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112151070] [2024-11-12 13:40:43,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:40:43,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:40:43,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:40:43,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:40:43,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:40:43,819 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:43,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:40:43,903 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-11-12 13:40:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:40:43,904 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 13:40:43,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:40:43,905 INFO L225 Difference]: With dead ends: 84 [2024-11-12 13:40:43,905 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 13:40:43,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:40:43,907 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:40:43,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:40:43,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 13:40:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-12 13:40:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.816326530612245) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-12 13:40:43,921 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 5 [2024-11-12 13:40:43,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:40:43,921 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-12 13:40:43,921 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-12 13:40:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:40:43,922 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:40:43,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:40:43,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:40:43,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:40:43,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:40:43,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113040, now seen corresponding path program 1 times [2024-11-12 13:40:43,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:40:43,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088579435] [2024-11-12 13:40:43,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:43,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:40:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:44,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:40:44,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088579435] [2024-11-12 13:40:44,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088579435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:40:44,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:40:44,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:40:44,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614126562] [2024-11-12 13:40:44,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:40:44,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:40:44,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:40:44,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:40:44,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:40:44,050 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:40:44,068 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2024-11-12 13:40:44,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:40:44,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-12 13:40:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:40:44,070 INFO L225 Difference]: With dead ends: 94 [2024-11-12 13:40:44,072 INFO L226 Difference]: Without dead ends: 94 [2024-11-12 13:40:44,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:40:44,073 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:40:44,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:40:44,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-12 13:40:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2024-11-12 13:40:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.8) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-12 13:40:44,086 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 7 [2024-11-12 13:40:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:40:44,086 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-12 13:40:44,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-12 13:40:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 13:40:44,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:40:44,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:40:44,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:40:44,087 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:40:44,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:40:44,087 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2024-11-12 13:40:44,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:40:44,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97047510] [2024-11-12 13:40:44,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:44,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:40:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:44,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:40:44,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97047510] [2024-11-12 13:40:44,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97047510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:40:44,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:40:44,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:40:44,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828560951] [2024-11-12 13:40:44,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:40:44,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:40:44,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:40:44,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:40:44,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:40:44,163 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:40:44,187 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-12 13:40:44,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:40:44,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-12 13:40:44,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:40:44,192 INFO L225 Difference]: With dead ends: 90 [2024-11-12 13:40:44,192 INFO L226 Difference]: Without dead ends: 90 [2024-11-12 13:40:44,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:40:44,193 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:40:44,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:40:44,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-12 13:40:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-12 13:40:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-11-12 13:40:44,200 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 9 [2024-11-12 13:40:44,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:40:44,200 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-11-12 13:40:44,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-11-12 13:40:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 13:40:44,201 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:40:44,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:40:44,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:40:44,201 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:40:44,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:40:44,202 INFO L85 PathProgramCache]: Analyzing trace with hash -763066913, now seen corresponding path program 1 times [2024-11-12 13:40:44,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:40:44,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4748103] [2024-11-12 13:40:44,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:44,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:40:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:44,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:40:44,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4748103] [2024-11-12 13:40:44,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4748103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:40:44,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837825206] [2024-11-12 13:40:44,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:44,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:40:44,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:40:44,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:40:44,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 13:40:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:44,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 13:40:44,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:40:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:44,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:40:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:44,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837825206] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:40:44,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:40:44,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-12 13:40:44,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962293474] [2024-11-12 13:40:44,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:40:44,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:40:44,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:40:44,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:40:44,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:40:44,529 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:40:44,552 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-12 13:40:44,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:40:44,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-12 13:40:44,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:40:44,554 INFO L225 Difference]: With dead ends: 92 [2024-11-12 13:40:44,556 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 13:40:44,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:40:44,557 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 10 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:40:44,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 246 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:40:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 13:40:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-12 13:40:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 91 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-12 13:40:44,570 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 14 [2024-11-12 13:40:44,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:40:44,570 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-12 13:40:44,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:44,570 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-12 13:40:44,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 13:40:44,571 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:40:44,571 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-12 13:40:44,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 13:40:44,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:40:44,772 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:40:44,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:40:44,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2024-11-12 13:40:44,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:40:44,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86483121] [2024-11-12 13:40:44,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:44,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:40:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:44,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:40:44,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86483121] [2024-11-12 13:40:44,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86483121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:40:44,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015777496] [2024-11-12 13:40:44,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:44,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:40:44,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:40:44,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:40:44,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 13:40:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:45,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 13:40:45,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:40:45,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:40:45,166 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:40:45,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-12 13:40:45,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:45,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:40:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:45,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015777496] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:40:45,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:40:45,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-12 13:40:45,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888734336] [2024-11-12 13:40:45,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:40:45,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:40:45,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:40:45,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:40:45,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:40:45,241 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:45,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:40:45,361 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-11-12 13:40:45,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:40:45,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-12 13:40:45,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:40:45,363 INFO L225 Difference]: With dead ends: 91 [2024-11-12 13:40:45,364 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 13:40:45,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:40:45,365 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:40:45,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 162 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:40:45,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 13:40:45,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-12 13:40:45,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 90 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2024-11-12 13:40:45,373 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 16 [2024-11-12 13:40:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:40:45,373 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2024-11-12 13:40:45,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2024-11-12 13:40:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 13:40:45,374 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:40:45,374 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-12 13:40:45,392 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-12 13:40:45,575 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,SelfDestructingSolverStorable5 [2024-11-12 13:40:45,575 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:40:45,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:40:45,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2024-11-12 13:40:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:40:45,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123905933] [2024-11-12 13:40:45,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:45,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:40:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:45,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:40:45,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123905933] [2024-11-12 13:40:45,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123905933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:40:45,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239514891] [2024-11-12 13:40:45,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:45,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:40:45,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:40:45,781 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:40:45,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 13:40:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:45,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 13:40:45,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:40:45,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:40:45,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:40:46,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:40:46,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:40:46,021 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:40:46,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 13:40:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:46,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:40:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:46,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239514891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:40:46,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:40:46,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-12 13:40:46,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913846359] [2024-11-12 13:40:46,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:40:46,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:40:46,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:40:46,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:40:46,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:40:46,369 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:40:46,593 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-12 13:40:46,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:40:46,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-12 13:40:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:40:46,594 INFO L225 Difference]: With dead ends: 90 [2024-11-12 13:40:46,595 INFO L226 Difference]: Without dead ends: 90 [2024-11-12 13:40:46,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:40:46,596 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 18 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:40:46,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 299 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:40:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-12 13:40:46,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-12 13:40:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:46,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-11-12 13:40:46,601 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 16 [2024-11-12 13:40:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:40:46,601 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-11-12 13:40:46,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:46,602 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-11-12 13:40:46,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:40:46,603 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:40:46,604 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:40:46,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 13:40:46,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:40:46,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:40:46,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:40:46,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957328, now seen corresponding path program 2 times [2024-11-12 13:40:46,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:40:46,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266896276] [2024-11-12 13:40:46,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:46,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:40:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:46,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:40:46,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266896276] [2024-11-12 13:40:46,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266896276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:40:46,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318530837] [2024-11-12 13:40:46,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:40:46,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:40:46,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:40:46,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:40:46,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 13:40:46,959 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 13:40:46,959 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:40:46,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:40:46,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:40:46,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:40:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:40:46,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:40:46,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318530837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:40:46,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:40:46,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-12 13:40:46,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14169551] [2024-11-12 13:40:46,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:40:46,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:40:46,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:40:46,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:40:46,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:40:46,975 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:47,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:40:47,027 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-11-12 13:40:47,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:40:47,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-12 13:40:47,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:40:47,028 INFO L225 Difference]: With dead ends: 87 [2024-11-12 13:40:47,028 INFO L226 Difference]: Without dead ends: 87 [2024-11-12 13:40:47,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:40:47,029 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:40:47,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:40:47,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-12 13:40:47,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-12 13:40:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 86 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-12 13:40:47,033 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 21 [2024-11-12 13:40:47,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:40:47,033 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-12 13:40:47,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-12 13:40:47,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:40:47,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:40:47,034 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:40:47,050 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-12 13:40:47,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:40:47,235 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:40:47,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:40:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957327, now seen corresponding path program 1 times [2024-11-12 13:40:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:40:47,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472461799] [2024-11-12 13:40:47,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:47,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:40:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:47,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:40:47,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472461799] [2024-11-12 13:40:47,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472461799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:40:47,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595824722] [2024-11-12 13:40:47,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:47,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:40:47,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:40:47,314 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:40:47,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 13:40:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:47,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 13:40:47,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:40:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:47,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:40:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:47,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595824722] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:40:47,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:40:47,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-12 13:40:47,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294873187] [2024-11-12 13:40:47,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:40:47,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:40:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:40:47,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:40:47,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:40:47,489 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:40:47,518 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2024-11-12 13:40:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:40:47,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-12 13:40:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:40:47,519 INFO L225 Difference]: With dead ends: 87 [2024-11-12 13:40:47,520 INFO L226 Difference]: Without dead ends: 87 [2024-11-12 13:40:47,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:40:47,520 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:40:47,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 221 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:40:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-12 13:40:47,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-12 13:40:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2024-11-12 13:40:47,532 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 21 [2024-11-12 13:40:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:40:47,532 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2024-11-12 13:40:47,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2024-11-12 13:40:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:40:47,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:40:47,533 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:40:47,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-12 13:40:47,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:40:47,734 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:40:47,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:40:47,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822092, now seen corresponding path program 1 times [2024-11-12 13:40:47,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:40:47,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610323575] [2024-11-12 13:40:47,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:47,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:40:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:40:47,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:40:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610323575] [2024-11-12 13:40:47,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610323575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:40:47,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:40:47,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:40:47,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870898393] [2024-11-12 13:40:47,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:40:47,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:40:47,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:40:47,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:40:47,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:40:47,845 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:40:47,896 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-11-12 13:40:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:40:47,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-12 13:40:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:40:47,897 INFO L225 Difference]: With dead ends: 84 [2024-11-12 13:40:47,897 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 13:40:47,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:40:47,898 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:40:47,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 121 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:40:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 13:40:47,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-12 13:40:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.543859649122807) internal successors, (88), 83 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2024-11-12 13:40:47,901 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 22 [2024-11-12 13:40:47,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:40:47,902 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2024-11-12 13:40:47,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:40:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2024-11-12 13:40:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:40:47,903 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:40:47,903 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:40:47,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:40:47,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:40:47,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:40:47,904 INFO L85 PathProgramCache]: Analyzing trace with hash 157247510, now seen corresponding path program 1 times [2024-11-12 13:40:47,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:40:47,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605929310] [2024-11-12 13:40:47,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:47,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:40:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:48,194 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-12 13:40:48,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:40:48,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605929310] [2024-11-12 13:40:48,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605929310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:40:48,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491581414] [2024-11-12 13:40:48,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:40:48,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:40:48,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:40:48,197 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:40:48,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 13:40:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:40:48,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 13:40:48,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:40:48,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:40:48,387 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:40:48,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-12 13:40:48,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:40:48,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2024-11-12 13:40:48,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:40:48,609 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-12 13:40:48,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2024-11-12 13:40:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:40:48,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:41:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:41:37,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491581414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:41:37,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:41:37,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-12 13:41:37,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661227639] [2024-11-12 13:41:37,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:41:37,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 13:41:37,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:37,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 13:41:37,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=189, Unknown=13, NotChecked=0, Total=272 [2024-11-12 13:41:37,171 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 17 states, 16 states have (on average 4.4375) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:37,399 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-12 13:41:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:41:37,400 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.4375) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-12 13:41:37,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:37,403 INFO L225 Difference]: With dead ends: 90 [2024-11-12 13:41:37,403 INFO L226 Difference]: Without dead ends: 90 [2024-11-12 13:41:37,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 48.5s TimeCoverageRelationStatistics Valid=113, Invalid=254, Unknown=13, NotChecked=0, Total=380 [2024-11-12 13:41:37,403 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 163 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:37,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 165 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:41:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-12 13:41:37,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2024-11-12 13:41:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-12 13:41:37,410 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 27 [2024-11-12 13:41:37,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:37,411 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-12 13:41:37,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.4375) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-12 13:41:37,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:41:37,411 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:37,411 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:37,430 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-12 13:41:37,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:37,612 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:41:37,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:37,613 INFO L85 PathProgramCache]: Analyzing trace with hash 157247511, now seen corresponding path program 1 times [2024-11-12 13:41:37,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:37,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008981735] [2024-11-12 13:41:37,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:37,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 13:41:38,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:38,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008981735] [2024-11-12 13:41:38,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008981735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:41:38,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431095224] [2024-11-12 13:41:38,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:38,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:38,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:41:38,063 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:41:38,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 13:41:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:38,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 13:41:38,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:41:38,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:41:38,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:41:38,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:41:38,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:41:38,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:41:38,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:41:38,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:41:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:41:38,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:41:38,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431095224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:38,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:41:38,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-12 13:41:38,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759316853] [2024-11-12 13:41:38,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:38,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:41:38,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:38,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:41:38,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:41:38,392 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:38,474 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-11-12 13:41:38,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:41:38,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-12 13:41:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:38,475 INFO L225 Difference]: With dead ends: 72 [2024-11-12 13:41:38,475 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 13:41:38,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:41:38,476 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 52 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:38,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 88 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:41:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 13:41:38,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-12 13:41:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-12 13:41:38,478 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 27 [2024-11-12 13:41:38,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:38,479 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-12 13:41:38,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-12 13:41:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:41:38,479 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:38,479 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:38,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-12 13:41:38,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:38,680 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:41:38,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:38,681 INFO L85 PathProgramCache]: Analyzing trace with hash 579705555, now seen corresponding path program 1 times [2024-11-12 13:41:38,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:38,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867601798] [2024-11-12 13:41:38,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:38,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:41:38,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867601798] [2024-11-12 13:41:38,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867601798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:38,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:41:38,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:41:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445567942] [2024-11-12 13:41:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:38,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:41:38,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:38,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:41:38,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:41:38,771 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:38,844 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-12 13:41:38,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:41:38,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-12 13:41:38,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:38,845 INFO L225 Difference]: With dead ends: 71 [2024-11-12 13:41:38,845 INFO L226 Difference]: Without dead ends: 71 [2024-11-12 13:41:38,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:41:38,846 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 11 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:38,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 150 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:41:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-12 13:41:38,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-12 13:41:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-12 13:41:38,849 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 28 [2024-11-12 13:41:38,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:38,849 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-12 13:41:38,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:38,849 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-12 13:41:38,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:41:38,850 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:38,850 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:38,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:41:38,850 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:41:38,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:38,851 INFO L85 PathProgramCache]: Analyzing trace with hash 579705556, now seen corresponding path program 1 times [2024-11-12 13:41:38,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:38,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268063710] [2024-11-12 13:41:38,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:38,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:41:38,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:38,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268063710] [2024-11-12 13:41:38,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268063710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:38,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:41:38,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:41:38,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950692286] [2024-11-12 13:41:39,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:39,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:41:39,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:39,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:41:39,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:41:39,001 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:39,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:39,077 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2024-11-12 13:41:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:41:39,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-12 13:41:39,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:39,078 INFO L225 Difference]: With dead ends: 70 [2024-11-12 13:41:39,078 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 13:41:39,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:41:39,079 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 10 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:39,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 162 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:41:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 13:41:39,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-12 13:41:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2024-11-12 13:41:39,081 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 28 [2024-11-12 13:41:39,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:39,082 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2024-11-12 13:41:39,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2024-11-12 13:41:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:41:39,084 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:39,084 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:39,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:41:39,085 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:41:39,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:39,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1569558015, now seen corresponding path program 1 times [2024-11-12 13:41:39,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:39,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657558754] [2024-11-12 13:41:39,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:39,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:39,311 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-12 13:41:39,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:39,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657558754] [2024-11-12 13:41:39,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657558754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:39,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:41:39,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:41:39,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146431285] [2024-11-12 13:41:39,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:39,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:41:39,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:39,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:41:39,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:41:39,313 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:39,431 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-11-12 13:41:39,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:41:39,432 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-12 13:41:39,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:39,432 INFO L225 Difference]: With dead ends: 69 [2024-11-12 13:41:39,432 INFO L226 Difference]: Without dead ends: 69 [2024-11-12 13:41:39,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:41:39,433 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 18 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:39,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 194 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:41:39,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-12 13:41:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-12 13:41:39,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.280701754385965) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-11-12 13:41:39,435 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 33 [2024-11-12 13:41:39,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:39,435 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-11-12 13:41:39,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:39,435 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-11-12 13:41:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:41:39,436 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:39,436 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:39,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:41:39,436 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:41:39,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:39,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1569558014, now seen corresponding path program 1 times [2024-11-12 13:41:39,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:39,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647624259] [2024-11-12 13:41:39,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:39,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:39,779 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-12 13:41:39,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:39,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647624259] [2024-11-12 13:41:39,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647624259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:39,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:41:39,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:41:39,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634878229] [2024-11-12 13:41:39,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:39,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:41:39,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:39,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:41:39,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:41:39,783 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:39,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:39,942 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-11-12 13:41:39,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:41:39,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-12 13:41:39,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:39,943 INFO L225 Difference]: With dead ends: 68 [2024-11-12 13:41:39,943 INFO L226 Difference]: Without dead ends: 68 [2024-11-12 13:41:39,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-12 13:41:39,944 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:39,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 214 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:41:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-12 13:41:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-12 13:41:39,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.263157894736842) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-11-12 13:41:39,946 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 33 [2024-11-12 13:41:39,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:39,947 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-11-12 13:41:39,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-11-12 13:41:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:41:39,949 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:39,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:39,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 13:41:39,949 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:41:39,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:39,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1306141903, now seen corresponding path program 1 times [2024-11-12 13:41:39,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:39,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108997762] [2024-11-12 13:41:39,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:39,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:40,151 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-12 13:41:40,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:40,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108997762] [2024-11-12 13:41:40,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108997762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:40,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:41:40,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:41:40,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480497465] [2024-11-12 13:41:40,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:40,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:41:40,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:40,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:41:40,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:41:40,154 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:40,244 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2024-11-12 13:41:40,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:41:40,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-12 13:41:40,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:40,245 INFO L225 Difference]: With dead ends: 68 [2024-11-12 13:41:40,245 INFO L226 Difference]: Without dead ends: 68 [2024-11-12 13:41:40,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-12 13:41:40,246 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 12 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:40,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 277 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:41:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-12 13:41:40,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-12 13:41:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2024-11-12 13:41:40,248 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 37 [2024-11-12 13:41:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:40,248 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2024-11-12 13:41:40,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2024-11-12 13:41:40,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:41:40,249 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:40,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:40,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 13:41:40,250 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:41:40,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:40,250 INFO L85 PathProgramCache]: Analyzing trace with hash -96972992, now seen corresponding path program 1 times [2024-11-12 13:41:40,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:40,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112262603] [2024-11-12 13:41:40,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:40,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:41:40,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:40,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112262603] [2024-11-12 13:41:40,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112262603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:40,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:41:40,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:41:40,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942839323] [2024-11-12 13:41:40,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:40,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:41:40,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:40,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:41:40,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:41:40,521 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:40,688 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2024-11-12 13:41:40,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:41:40,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-12 13:41:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:40,689 INFO L225 Difference]: With dead ends: 69 [2024-11-12 13:41:40,689 INFO L226 Difference]: Without dead ends: 69 [2024-11-12 13:41:40,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:41:40,690 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:40,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 220 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:41:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-12 13:41:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-12 13:41:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2024-11-12 13:41:40,692 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 40 [2024-11-12 13:41:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:40,692 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2024-11-12 13:41:40,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2024-11-12 13:41:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:41:40,694 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:40,694 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:40,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 13:41:40,695 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:41:40,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:40,695 INFO L85 PathProgramCache]: Analyzing trace with hash -96972991, now seen corresponding path program 1 times [2024-11-12 13:41:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:40,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546373225] [2024-11-12 13:41:40,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:40,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:41:41,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:41,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546373225] [2024-11-12 13:41:41,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546373225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:41,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:41:41,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:41:41,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197026862] [2024-11-12 13:41:41,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:41,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:41:41,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:41,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:41:41,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:41:41,085 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:41,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:41,257 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-12 13:41:41,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:41:41,257 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-12 13:41:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:41,258 INFO L225 Difference]: With dead ends: 71 [2024-11-12 13:41:41,258 INFO L226 Difference]: Without dead ends: 71 [2024-11-12 13:41:41,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:41:41,259 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:41,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 212 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:41:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-12 13:41:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-12 13:41:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-12 13:41:41,261 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 40 [2024-11-12 13:41:41,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:41,261 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-12 13:41:41,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:41,261 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-12 13:41:41,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-12 13:41:41,262 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:41,262 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:41,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 13:41:41,262 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:41:41,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:41,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1589371212, now seen corresponding path program 1 times [2024-11-12 13:41:41,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:41,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898040589] [2024-11-12 13:41:41,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:41,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:41:41,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:41,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898040589] [2024-11-12 13:41:41,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898040589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:41,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:41:41,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:41:41,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90734374] [2024-11-12 13:41:41,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:41,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:41:41,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:41,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:41:41,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:41:41,499 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:41,606 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-11-12 13:41:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:41:41,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-12 13:41:41,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:41,607 INFO L225 Difference]: With dead ends: 71 [2024-11-12 13:41:41,607 INFO L226 Difference]: Without dead ends: 71 [2024-11-12 13:41:41,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:41:41,607 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 24 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:41,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 277 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:41:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-12 13:41:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-12 13:41:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-12 13:41:41,609 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 43 [2024-11-12 13:41:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:41,609 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-12 13:41:41,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-12 13:41:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-12 13:41:41,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:41,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:41,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 13:41:41,612 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:41:41,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash -377366918, now seen corresponding path program 1 times [2024-11-12 13:41:41,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:41,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55752096] [2024-11-12 13:41:41,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:41:42,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:42,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55752096] [2024-11-12 13:41:42,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55752096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:41:42,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071983956] [2024-11-12 13:41:42,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:42,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:42,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:41:42,545 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:41:42,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 13:41:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:42,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-12 13:41:42,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:41:42,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:41:42,914 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-12 13:41:42,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-12 13:41:43,129 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 17 treesize of output 13 [2024-11-12 13:41:43,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:41:43,293 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 30 treesize of output 17 [2024-11-12 13:41:43,376 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:41:43,377 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 58 treesize of output 42 [2024-11-12 13:41:43,382 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-12 13:41:43,461 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:41:43,462 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 49 treesize of output 33 [2024-11-12 13:41:43,467 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:41:43,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:43,470 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 37 treesize of output 28 [2024-11-12 13:41:43,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-12 13:41:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:41:43,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:41:43,714 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 68 treesize of output 64 [2024-11-12 13:41:43,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:43,870 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 56 treesize of output 96 [2024-11-12 13:41:44,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_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|)) (.cse5 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse6 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1560))) (or (= (select (select .cse0 .cse1) (+ 4 v_arrayElimCell_20)) |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (= |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| (select (select .cse0 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse2))))) (or (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1560))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| .cse3) (= (select (select .cse4 .cse1) (+ 4 v_arrayElimCell_20)) .cse3))))) (not .cse5) (not .cse6)) (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1560))) (let ((.cse7 (select (select .cse9 .cse1) (+ 4 v_arrayElimCell_20))) (.cse8 (select (select .cse9 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse2))) (or (= .cse7 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (= |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| .cse8) (= .cse7 .cse8))))) (or (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1560))) (let ((.cse10 (select (select .cse11 .cse1) (+ 4 v_arrayElimCell_20)))) (or (= .cse10 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (= .cse10 (select (select .cse11 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse2)))))) (and .cse5 .cse6)))) is different from false [2024-11-12 13:41:44,068 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse9 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse10 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1560))) (let ((.cse1 (select (select .cse3 .cse5) (+ 4 v_arrayElimCell_20))) (.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse4))) (or (= .cse0 .cse1) (= .cse1 .cse2) (= .cse0 .cse2))))) (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1560))) (or (= .cse0 (select (select .cse6 .cse5) (+ 4 v_arrayElimCell_20))) (= .cse0 (select (select .cse6 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse4))))) (or (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1560))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse4))) (or (= (select (select .cse7 .cse5) (+ 4 v_arrayElimCell_20)) .cse8) (= .cse0 .cse8))))) (not .cse9) (not .cse10)) (or (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1560))) (let ((.cse11 (select (select .cse12 .cse5) (+ 4 v_arrayElimCell_20)))) (or (= .cse0 .cse11) (= .cse11 (select (select .cse12 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse4)))))) (and .cse9 .cse10)))) is different from false [2024-11-12 13:41:44,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:44,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 88 [2024-11-12 13:41:44,236 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2024-11-12 13:41:44,236 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 234 treesize of output 191 [2024-11-12 13:41:44,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:44,250 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 140 treesize of output 124 [2024-11-12 13:41:44,323 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-12 13:41:44,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 1 [2024-11-12 13:41:44,333 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-12 13:41:44,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 1 [2024-11-12 13:41:44,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:44,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 68 [2024-11-12 13:41:44,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:41:44,365 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2024-11-12 13:41:44,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 94 [2024-11-12 13:41:44,373 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 43 treesize of output 35 [2024-11-12 13:41:44,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:44,610 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 21 [2024-11-12 13:41:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:41:44,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071983956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:41:44,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:41:44,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2024-11-12 13:41:44,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638188913] [2024-11-12 13:41:44,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:41:44,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-12 13:41:44,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:44,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-12 13:41:44,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1845, Unknown=2, NotChecked=174, Total=2162 [2024-11-12 13:41:44,902 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 47 states, 46 states have (on average 2.5) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:46,534 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-12 13:41:46,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 13:41:46,534 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.5) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-12 13:41:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:46,535 INFO L225 Difference]: With dead ends: 78 [2024-11-12 13:41:46,535 INFO L226 Difference]: Without dead ends: 78 [2024-11-12 13:41:46,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=285, Invalid=3261, Unknown=2, NotChecked=234, Total=3782 [2024-11-12 13:41:46,538 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 88 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:46,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 660 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1196 Invalid, 0 Unknown, 129 Unchecked, 0.8s Time] [2024-11-12 13:41:46,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-12 13:41:46,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-12 13:41:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.25) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2024-11-12 13:41:46,541 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 45 [2024-11-12 13:41:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:46,541 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2024-11-12 13:41:46,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.5) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2024-11-12 13:41:46,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-12 13:41:46,542 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:46,542 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:46,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 13:41:46,746 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,SelfDestructingSolverStorable20 [2024-11-12 13:41:46,747 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:41:46,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:46,748 INFO L85 PathProgramCache]: Analyzing trace with hash -377366917, now seen corresponding path program 1 times [2024-11-12 13:41:46,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:46,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403123580] [2024-11-12 13:41:46,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:46,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:41:48,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:48,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403123580] [2024-11-12 13:41:48,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403123580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:41:48,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905241716] [2024-11-12 13:41:48,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:48,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:48,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:41:48,392 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:41:48,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 13:41:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:48,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-12 13:41:48,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:41:48,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:41:48,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:41:48,827 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-12 13:41:48,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-12 13:41:48,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-12 13:41:49,135 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 17 treesize of output 13 [2024-11-12 13:41:49,145 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 17 treesize of output 13 [2024-11-12 13:41:49,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:41:49,387 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 30 treesize of output 17 [2024-11-12 13:41:49,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:41:49,402 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 30 treesize of output 17 [2024-11-12 13:41:49,449 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:41:49,450 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 58 treesize of output 31 [2024-11-12 13:41:49,455 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:41:49,456 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 44 treesize of output 21 [2024-11-12 13:41:49,546 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:41:49,547 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 66 treesize of output 46 [2024-11-12 13:41:49,551 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:41:49,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:49,554 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 50 treesize of output 37 [2024-11-12 13:41:49,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-12 13:41:49,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-12 13:41:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:41:49,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:41:50,080 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_1743 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1743) .cse0) .cse1)))) (forall ((v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1743 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1743) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1744) .cse0) .cse1)))))) is different from false [2024-11-12 13:41:50,101 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1743 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1743) .cse1) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1744) .cse1) .cse2)))) (forall ((v_ArrVal_1743 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1743) .cse1) .cse2) 4)))))) is different from false [2024-11-12 13:41:50,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:50,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 53 [2024-11-12 13:41:50,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:50,183 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 108 treesize of output 107 [2024-11-12 13:41:50,190 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 41 treesize of output 25 [2024-11-12 13:41:50,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:50,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 102 [2024-11-12 13:41:50,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:50,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 92 [2024-11-12 13:41:50,240 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:41:50,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:50,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 69 [2024-11-12 13:41:50,256 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:41:50,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:50,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 32 [2024-11-12 13:41:50,827 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 72 treesize of output 62 [2024-11-12 13:41:50,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:50,840 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 80 treesize of output 76 [2024-11-12 13:41:50,849 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 67 treesize of output 59 [2024-11-12 13:41:50,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:50,864 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 65 treesize of output 65 [2024-11-12 13:41:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:41:51,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905241716] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:41:51,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:41:51,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 51 [2024-11-12 13:41:51,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002294935] [2024-11-12 13:41:51,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:41:51,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-12 13:41:51,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:51,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-12 13:41:51,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2306, Unknown=2, NotChecked=194, Total=2652 [2024-11-12 13:41:51,460 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 52 states, 51 states have (on average 2.450980392156863) internal successors, (125), 52 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:53,525 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-12 13:41:53,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 13:41:53,525 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.450980392156863) internal successors, (125), 52 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-12 13:41:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:53,527 INFO L225 Difference]: With dead ends: 80 [2024-11-12 13:41:53,527 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 13:41:53,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=322, Invalid=4240, Unknown=2, NotChecked=266, Total=4830 [2024-11-12 13:41:53,529 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 146 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:53,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 801 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1419 Invalid, 0 Unknown, 135 Unchecked, 0.9s Time] [2024-11-12 13:41:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 13:41:53,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-12 13:41:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2024-11-12 13:41:53,532 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 45 [2024-11-12 13:41:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:53,532 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2024-11-12 13:41:53,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.450980392156863) internal successors, (125), 52 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2024-11-12 13:41:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-12 13:41:53,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:53,533 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:53,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-12 13:41:53,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:53,734 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:41:53,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:53,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1186516712, now seen corresponding path program 1 times [2024-11-12 13:41:53,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:53,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044867229] [2024-11-12 13:41:53,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:53,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:54,465 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-12 13:41:54,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:54,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044867229] [2024-11-12 13:41:54,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044867229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:54,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:41:54,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 13:41:54,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644971497] [2024-11-12 13:41:54,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:54,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 13:41:54,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:54,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 13:41:54,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:41:54,467 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:54,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:54,728 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-11-12 13:41:54,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:41:54,728 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-12 13:41:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:54,729 INFO L225 Difference]: With dead ends: 80 [2024-11-12 13:41:54,729 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 13:41:54,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-12 13:41:54,730 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 30 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:54,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 373 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:41:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 13:41:54,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-12 13:41:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-11-12 13:41:54,732 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 46 [2024-11-12 13:41:54,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:54,732 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-11-12 13:41:54,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:54,733 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-11-12 13:41:54,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 13:41:54,733 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:54,733 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:54,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 13:41:54,733 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:41:54,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2085312466, now seen corresponding path program 1 times [2024-11-12 13:41:54,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:54,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342297715] [2024-11-12 13:41:54,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:54,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:41:55,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:55,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342297715] [2024-11-12 13:41:55,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342297715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:41:55,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477949598] [2024-11-12 13:41:55,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:55,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:55,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:41:55,617 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:41:55,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-12 13:41:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:55,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-12 13:41:55,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:41:55,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:41:56,029 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-12 13:41:56,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-12 13:41:56,231 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 17 treesize of output 13 [2024-11-12 13:41:56,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:41:56,515 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 30 treesize of output 17 [2024-11-12 13:41:56,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:41:56,543 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 57 treesize of output 30 [2024-11-12 13:41:56,548 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:41:56,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-12 13:41:56,630 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:41:56,631 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 48 treesize of output 32 [2024-11-12 13:41:56,636 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:41:56,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:56,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2024-11-12 13:41:56,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-12 13:41:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:41:56,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:41:56,911 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2009 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_2009) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_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_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2024-11-12 13:41:57,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:57,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2024-11-12 13:41:57,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:57,143 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 107 treesize of output 106 [2024-11-12 13:41:57,148 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 66 treesize of output 50 [2024-11-12 13:41:57,776 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 68 treesize of output 56 [2024-11-12 13:41:57,782 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 52 [2024-11-12 13:41:57,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:57,795 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 70 treesize of output 64 [2024-11-12 13:41:57,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:41:57,810 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 59 treesize of output 61 [2024-11-12 13:41:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:41:58,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477949598] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:41:58,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:41:58,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 51 [2024-11-12 13:41:58,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337293735] [2024-11-12 13:41:58,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:41:58,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-12 13:41:58,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:58,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-12 13:41:58,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2274, Unknown=14, NotChecked=96, Total=2550 [2024-11-12 13:41:58,236 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:59,968 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2024-11-12 13:41:59,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 13:41:59,968 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-12 13:41:59,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:59,969 INFO L225 Difference]: With dead ends: 76 [2024-11-12 13:41:59,969 INFO L226 Difference]: Without dead ends: 76 [2024-11-12 13:41:59,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=381, Invalid=4579, Unknown=14, NotChecked=138, Total=5112 [2024-11-12 13:41:59,971 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 93 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:59,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 849 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1256 Invalid, 0 Unknown, 62 Unchecked, 0.8s Time] [2024-11-12 13:41:59,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-12 13:41:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-12 13:41:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.196969696969697) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2024-11-12 13:41:59,973 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 48 [2024-11-12 13:41:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:59,973 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2024-11-12 13:41:59,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:41:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2024-11-12 13:41:59,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 13:41:59,973 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:59,974 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:59,989 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-12 13:42:00,174 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,SelfDestructingSolverStorable23 [2024-11-12 13:42:00,174 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-12 13:42:00,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:00,175 INFO L85 PathProgramCache]: Analyzing trace with hash -519191680, now seen corresponding path program 2 times [2024-11-12 13:42:00,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:00,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995517240] [2024-11-12 13:42:00,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:00,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:42:02,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:02,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995517240] [2024-11-12 13:42:02,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995517240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:02,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073298146] [2024-11-12 13:42:02,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:42:02,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:02,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:02,313 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:42:02,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-12 13:42:02,578 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:42:02,579 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:42:02,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-12 13:42:02,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:02,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:42:02,687 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-12 13:42:02,687 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-12 13:42:02,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:42:02,797 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 23 treesize of output 11 [2024-11-12 13:42:02,823 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:42:02,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-12 13:42:02,986 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-12 13:42:02,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-11-12 13:42:03,089 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 33 [2024-11-12 13:42:03,109 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 33 [2024-11-12 13:42:03,142 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 33 [2024-11-12 13:42:03,482 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 17 treesize of output 13 [2024-11-12 13:42:03,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2024-11-12 13:42:03,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:03,826 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 30 treesize of output 17 [2024-11-12 13:42:03,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:03,845 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:42:03,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:03,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 62 [2024-11-12 13:42:03,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:42:03,995 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 193 treesize of output 137 [2024-11-12 13:42:03,998 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:42:04,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:42:04,001 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 1 case distinctions, treesize of input 137 treesize of output 104 [2024-11-12 13:42:04,156 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:42:04,157 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 42 treesize of output 30 [2024-11-12 13:42:04,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-12 13:42:04,422 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 13 treesize of output 3 [2024-11-12 13:42:04,741 INFO L349 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2024-11-12 13:42:04,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 38 [2024-11-12 13:42:05,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:42:05,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:42:05,384 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2199 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (+ |c_ULTIMATE.start_dll_prepend_#t~mem10#1.offset| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_2199) .cse1) .cse2) 4)))) 1)) is different from false [2024-11-12 13:42:05,392 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2199 (Array Int Int))) (= (select |c_#valid| (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| .cse3 (store (select |c_#memory_$Pointer$#2.base| .cse3) (+ (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_2199) .cse1) .cse2) 4))))) 1)) is different from false [2024-11-12 13:42:05,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:42:05,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 173 [2024-11-12 13:42:05,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:42:05,437 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 348 treesize of output 347 [2024-11-12 13:42:05,444 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 161 treesize of output 145