./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c -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 8b17e864f5b8145df67cb2b3dc045f82af33b1bd3c9c5e4c95275bcb385f71da --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:37:39,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:37:39,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:37:39,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:37:39,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:37:39,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:37:39,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:37:39,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:37:39,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:37:39,781 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:37:39,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:37:39,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:37:39,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:37:39,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:37:39,783 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:37:39,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:37:39,783 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:37:39,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:37:39,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:37:39,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:37:39,784 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:37:39,784 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:37:39,785 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:37:39,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:37:39,785 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:37:39,785 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:37:39,785 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:37:39,786 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:37:39,786 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:37:39,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:37:39,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:37:39,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:37:39,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:37:39,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:37:39,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:37:39,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:37:39,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:37:39,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:37:39,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:37:39,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:37:39,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:37:39,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:37:39,789 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 -> 8b17e864f5b8145df67cb2b3dc045f82af33b1bd3c9c5e4c95275bcb385f71da [2024-10-13 10:37:40,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:37:40,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:37:40,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:37:40,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:37:40,037 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:37:40,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c [2024-10-13 10:37:41,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:37:41,611 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:37:41,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c [2024-10-13 10:37:41,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51b07776e/5cd494041e29410ebcff56c9f87a0d89/FLAG0dcb105f3 [2024-10-13 10:37:41,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51b07776e/5cd494041e29410ebcff56c9f87a0d89 [2024-10-13 10:37:41,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:37:41,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:37:41,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:37:41,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:37:41,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:37:41,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:37:41" (1/1) ... [2024-10-13 10:37:41,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f5fcbaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:41, skipping insertion in model container [2024-10-13 10:37:41,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:37:41" (1/1) ... [2024-10-13 10:37:41,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:37:41,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:37:41,874 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:37:41,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:37:41,913 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:37:41,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:41 WrapperNode [2024-10-13 10:37:41,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:37:41,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:37:41,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:37:41,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:37:41,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:41" (1/1) ... [2024-10-13 10:37:41,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:41" (1/1) ... [2024-10-13 10:37:41,952 INFO L138 Inliner]: procedures = 16, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2024-10-13 10:37:41,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:37:41,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:37:41,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:37:41,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:37:41,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:41" (1/1) ... [2024-10-13 10:37:41,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:41" (1/1) ... [2024-10-13 10:37:41,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:41" (1/1) ... [2024-10-13 10:37:42,005 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 4, 5, 6, 3]. 30 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 6 writes are split as follows [0, 1, 2, 2, 1]. [2024-10-13 10:37:42,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:41" (1/1) ... [2024-10-13 10:37:42,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:41" (1/1) ... [2024-10-13 10:37:42,037 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:41" (1/1) ... [2024-10-13 10:37:42,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:41" (1/1) ... [2024-10-13 10:37:42,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:41" (1/1) ... [2024-10-13 10:37:42,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:41" (1/1) ... [2024-10-13 10:37:42,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:37:42,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:37:42,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:37:42,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:37:42,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:41" (1/1) ... [2024-10-13 10:37:42,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:37:42,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:42,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:37:42,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:37:42,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:37:42,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:37:42,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 10:37:42,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 10:37:42,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-13 10:37:42,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:37:42,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:37:42,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:37:42,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 10:37:42,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 10:37:42,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 10:37:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:37:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:37:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 10:37:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 10:37:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-13 10:37:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:37:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:37:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:37:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 10:37:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 10:37:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 10:37:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:37:42,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:37:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:37:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 10:37:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 10:37:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 10:37:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 10:37:42,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:37:42,237 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:37:42,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:37:42,523 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-10-13 10:37:42,524 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:37:42,566 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:37:42,566 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 10:37:42,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:37:42 BoogieIcfgContainer [2024-10-13 10:37:42,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:37:42,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:37:42,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:37:42,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:37:42,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:37:41" (1/3) ... [2024-10-13 10:37:42,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7cc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:37:42, skipping insertion in model container [2024-10-13 10:37:42,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:41" (2/3) ... [2024-10-13 10:37:42,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7cc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:37:42, skipping insertion in model container [2024-10-13 10:37:42,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:37:42" (3/3) ... [2024-10-13 10:37:42,577 INFO L112 eAbstractionObserver]: Analyzing ICFG test27-2.c [2024-10-13 10:37:42,591 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:37:42,591 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2024-10-13 10:37:42,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:37:42,639 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;@58664c2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:37:42,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2024-10-13 10:37:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 67 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-10-13 10:37:42,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:37:42,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:42,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:37:42,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:42,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:42,657 INFO L85 PathProgramCache]: Analyzing trace with hash 146394, now seen corresponding path program 1 times [2024-10-13 10:37:42,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:42,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208134589] [2024-10-13 10:37:42,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:42,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:42,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:42,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208134589] [2024-10-13 10:37:42,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208134589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:42,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:42,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:37:42,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984599724] [2024-10-13 10:37:42,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:42,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:37:42,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:42,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:37:42,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:42,923 INFO L87 Difference]: Start difference. First operand has 68 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 67 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-10-13 10:37:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:43,038 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2024-10-13 10:37:43,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:37:43,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-13 10:37:43,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:43,047 INFO L225 Difference]: With dead ends: 65 [2024-10-13 10:37:43,047 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 10:37:43,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:43,053 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 28 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:43,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 28 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 10:37:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-13 10:37:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 29 states have (on average 2.310344827586207) internal successors, (67), 63 states have internal predecessors, (67), 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-10-13 10:37:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2024-10-13 10:37:43,089 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 3 [2024-10-13 10:37:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:43,090 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2024-10-13 10:37:43,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-10-13 10:37:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2024-10-13 10:37:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:37:43,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:43,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:37:43,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:37:43,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:43,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash 146395, now seen corresponding path program 1 times [2024-10-13 10:37:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:43,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562561669] [2024-10-13 10:37:43,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:43,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:43,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:43,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562561669] [2024-10-13 10:37:43,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562561669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:43,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:43,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:37:43,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365447565] [2024-10-13 10:37:43,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:43,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:37:43,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:43,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:37:43,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:43,264 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-10-13 10:37:43,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:43,351 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-10-13 10:37:43,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:37:43,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-13 10:37:43,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:43,353 INFO L225 Difference]: With dead ends: 68 [2024-10-13 10:37:43,354 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 10:37:43,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:43,356 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:43,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 10:37:43,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-10-13 10:37:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 31 states have (on average 2.225806451612903) internal successors, (69), 65 states have internal predecessors, (69), 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-10-13 10:37:43,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2024-10-13 10:37:43,362 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 3 [2024-10-13 10:37:43,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:43,363 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2024-10-13 10:37:43,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-10-13 10:37:43,363 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2024-10-13 10:37:43,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:37:43,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:43,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:37:43,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:37:43,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:43,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash 4541578, now seen corresponding path program 1 times [2024-10-13 10:37:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:43,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757689440] [2024-10-13 10:37:43,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:43,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:43,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:43,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757689440] [2024-10-13 10:37:43,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757689440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:43,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:43,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:37:43,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140665308] [2024-10-13 10:37:43,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:43,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:37:43,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:43,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:37:43,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:37:43,464 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-10-13 10:37:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:43,536 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2024-10-13 10:37:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:37:43,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-13 10:37:43,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:43,559 INFO L225 Difference]: With dead ends: 63 [2024-10-13 10:37:43,559 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 10:37:43,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:37:43,560 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:43,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 28 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 10:37:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 10:37:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 31 states have (on average 2.129032258064516) internal successors, (66), 62 states have internal predecessors, (66), 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-10-13 10:37:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2024-10-13 10:37:43,567 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 4 [2024-10-13 10:37:43,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:43,568 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2024-10-13 10:37:43,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-10-13 10:37:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2024-10-13 10:37:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:37:43,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:43,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:37:43,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:37:43,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:43,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:43,569 INFO L85 PathProgramCache]: Analyzing trace with hash 4541579, now seen corresponding path program 1 times [2024-10-13 10:37:43,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:43,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885364506] [2024-10-13 10:37:43,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:43,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:43,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:43,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885364506] [2024-10-13 10:37:43,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885364506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:43,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:43,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:37:43,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122395103] [2024-10-13 10:37:43,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:43,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:37:43,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:43,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:37:43,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:37:43,734 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-10-13 10:37:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:43,837 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2024-10-13 10:37:43,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:37:43,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-13 10:37:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:43,838 INFO L225 Difference]: With dead ends: 64 [2024-10-13 10:37:43,839 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 10:37:43,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:37:43,839 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:43,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 10:37:43,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-13 10:37:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 2.09375) internal successors, (67), 63 states have internal predecessors, (67), 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-10-13 10:37:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2024-10-13 10:37:43,850 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 4 [2024-10-13 10:37:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:43,851 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2024-10-13 10:37:43,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-10-13 10:37:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2024-10-13 10:37:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:37:43,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:43,851 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2024-10-13 10:37:43,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:37:43,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:43,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:43,852 INFO L85 PathProgramCache]: Analyzing trace with hash 69593273, now seen corresponding path program 1 times [2024-10-13 10:37:43,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:43,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894569964] [2024-10-13 10:37:43,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:43,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:43,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:43,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894569964] [2024-10-13 10:37:43,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894569964] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:43,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197947770] [2024-10-13 10:37:43,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:43,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:43,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:43,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:37:43,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:37:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:44,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:37:44,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:44,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-10-13 10:37:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:44,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:44,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197947770] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:37:44,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:37:44,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2024-10-13 10:37:44,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753944486] [2024-10-13 10:37:44,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:37:44,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:37:44,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:44,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:37:44,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:37:44,238 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-10-13 10:37:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:44,353 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-10-13 10:37:44,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:37:44,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 6 [2024-10-13 10:37:44,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:44,354 INFO L225 Difference]: With dead ends: 72 [2024-10-13 10:37:44,354 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 10:37:44,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:37:44,355 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:44,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 98 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:44,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 10:37:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-13 10:37:44,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 40 states have (on average 1.975) internal successors, (79), 71 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-10-13 10:37:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-10-13 10:37:44,359 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 6 [2024-10-13 10:37:44,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:44,359 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-10-13 10:37:44,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-10-13 10:37:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-10-13 10:37:44,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 10:37:44,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:44,360 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2024-10-13 10:37:44,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:37:44,560 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-10-13 10:37:44,561 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:44,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:44,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2137572499, now seen corresponding path program 1 times [2024-10-13 10:37:44,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:44,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851510581] [2024-10-13 10:37:44,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:44,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:44,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:44,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851510581] [2024-10-13 10:37:44,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851510581] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:44,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677328555] [2024-10-13 10:37:44,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:44,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:44,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:44,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:37:44,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:37:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:44,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 10:37:44,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:44,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:44,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:44,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-10-13 10:37:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:45,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:45,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677328555] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:37:45,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:37:45,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2024-10-13 10:37:45,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866312741] [2024-10-13 10:37:45,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:37:45,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:37:45,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:45,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:37:45,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:37:45,134 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-10-13 10:37:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:45,308 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2024-10-13 10:37:45,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:37:45,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 7 [2024-10-13 10:37:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:45,309 INFO L225 Difference]: With dead ends: 73 [2024-10-13 10:37:45,309 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 10:37:45,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:37:45,311 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:45,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 165 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 10:37:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-13 10:37:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 72 states have internal predecessors, (78), 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-10-13 10:37:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2024-10-13 10:37:45,318 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 7 [2024-10-13 10:37:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:45,318 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2024-10-13 10:37:45,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-10-13 10:37:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2024-10-13 10:37:45,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 10:37:45,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:45,319 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 10:37:45,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 10:37:45,521 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-10-13 10:37:45,522 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:45,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:45,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1469477782, now seen corresponding path program 1 times [2024-10-13 10:37:45,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:45,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070474446] [2024-10-13 10:37:45,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:45,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 10:37:45,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:45,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070474446] [2024-10-13 10:37:45,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070474446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:45,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:45,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:37:45,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431373622] [2024-10-13 10:37:45,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:45,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:37:45,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:45,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:37:45,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:37:45,636 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-10-13 10:37:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:45,692 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2024-10-13 10:37:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:37:45,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 11 [2024-10-13 10:37:45,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:45,693 INFO L225 Difference]: With dead ends: 72 [2024-10-13 10:37:45,693 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 10:37:45,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:37:45,694 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 36 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:45,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 57 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:45,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 10:37:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-10-13 10:37:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.853658536585366) internal successors, (76), 70 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-10-13 10:37:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2024-10-13 10:37:45,702 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 11 [2024-10-13 10:37:45,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:45,702 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2024-10-13 10:37:45,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-10-13 10:37:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2024-10-13 10:37:45,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:37:45,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:45,703 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:45,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:37:45,703 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:45,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1690907466, now seen corresponding path program 1 times [2024-10-13 10:37:45,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:45,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208488236] [2024-10-13 10:37:45,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:45,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:45,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:45,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208488236] [2024-10-13 10:37:45,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208488236] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:45,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590444162] [2024-10-13 10:37:45,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:45,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:45,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:45,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:37:45,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 10:37:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:45,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:37:45,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:45,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590444162] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:37:45,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:37:45,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-13 10:37:45,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644455048] [2024-10-13 10:37:45,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:37:45,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:37:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:45,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:37:45,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:37:45,897 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-10-13 10:37:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:45,935 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2024-10-13 10:37:45,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:37:45,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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 12 [2024-10-13 10:37:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:45,936 INFO L225 Difference]: With dead ends: 75 [2024-10-13 10:37:45,936 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 10:37:45,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:37:45,938 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:45,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 152 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 10:37:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-13 10:37:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 74 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-10-13 10:37:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2024-10-13 10:37:45,944 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 12 [2024-10-13 10:37:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:45,944 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2024-10-13 10:37:45,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-10-13 10:37:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2024-10-13 10:37:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 10:37:45,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:45,944 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1] [2024-10-13 10:37:45,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 10:37:46,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:46,149 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:46,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:46,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2013289893, now seen corresponding path program 2 times [2024-10-13 10:37:46,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:46,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685981987] [2024-10-13 10:37:46,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:46,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:46,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:46,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685981987] [2024-10-13 10:37:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685981987] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713885955] [2024-10-13 10:37:46,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:37:46,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:46,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:46,346 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:37:46,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 10:37:46,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:37:46,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:37:46,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 10:37:46,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:46,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-10-13 10:37:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:46,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:37:46,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713885955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:46,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:37:46,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2024-10-13 10:37:46,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468296410] [2024-10-13 10:37:46,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:46,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:37:46,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:46,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:37:46,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:37:46,597 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-10-13 10:37:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:46,709 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-10-13 10:37:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:37:46,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 15 [2024-10-13 10:37:46,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:46,710 INFO L225 Difference]: With dead ends: 74 [2024-10-13 10:37:46,710 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 10:37:46,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:37:46,711 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:46,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 10:37:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-13 10:37:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 73 states have internal predecessors, (78), 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-10-13 10:37:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2024-10-13 10:37:46,718 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 15 [2024-10-13 10:37:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:46,718 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2024-10-13 10:37:46,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-10-13 10:37:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2024-10-13 10:37:46,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:37:46,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:46,719 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1] [2024-10-13 10:37:46,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 10:37:46,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:46,920 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:46,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:46,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2012526091, now seen corresponding path program 2 times [2024-10-13 10:37:46,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:46,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524003620] [2024-10-13 10:37:46,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:46,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:47,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:47,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524003620] [2024-10-13 10:37:47,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524003620] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:47,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66534137] [2024-10-13 10:37:47,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:37:47,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:47,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:47,153 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:37:47,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 10:37:47,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:37:47,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:37:47,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 10:37:47,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:47,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:47,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:47,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-10-13 10:37:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-13 10:37:47,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-13 10:37:47,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66534137] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:37:47,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:37:47,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 12 [2024-10-13 10:37:47,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199540205] [2024-10-13 10:37:47,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:37:47,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:37:47,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:47,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:37:47,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:37:47,615 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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-10-13 10:37:48,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:48,039 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-10-13 10:37:48,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:37:48,040 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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-10-13 10:37:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:48,040 INFO L225 Difference]: With dead ends: 75 [2024-10-13 10:37:48,040 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 10:37:48,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2024-10-13 10:37:48,041 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 30 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:48,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 251 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:37:48,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 10:37:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-10-13 10:37:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 72 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-10-13 10:37:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-10-13 10:37:48,045 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 16 [2024-10-13 10:37:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:48,045 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-10-13 10:37:48,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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-10-13 10:37:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-10-13 10:37:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:37:48,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:48,046 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:48,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 10:37:48,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-13 10:37:48,247 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:48,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:48,247 INFO L85 PathProgramCache]: Analyzing trace with hash -248046390, now seen corresponding path program 2 times [2024-10-13 10:37:48,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:48,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145235468] [2024-10-13 10:37:48,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:48,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:48,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:48,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145235468] [2024-10-13 10:37:48,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145235468] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:48,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635127354] [2024-10-13 10:37:48,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:37:48,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:48,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:48,377 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:37:48,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 10:37:48,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:37:48,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:37:48,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:37:48,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:48,749 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#cont~0#1.base_21| Int) (|v_ULTIMATE.start_main_~#a~0#1.base_26| Int) (|v_ULTIMATE.start_main_~#dummies~0#1.base_26| Int) (|v_ULTIMATE.start_main_~#dummy~0#1.base_18| Int)) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#cont~0#1.base_21| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#dummy~0#1.base_18| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#dummies~0#1.base_26|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#dummy~0#1.base_18|) 0) (= (select (store .cse0 |v_ULTIMATE.start_main_~#dummies~0#1.base_26| 1) |v_ULTIMATE.start_main_~#a~0#1.base_26|) 0) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#cont~0#1.base_21| 0) |v_ULTIMATE.start_main_~#dummy~0#1.base_18| 0) |v_ULTIMATE.start_main_~#dummies~0#1.base_26| 0) |v_ULTIMATE.start_main_~#a~0#1.base_26| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#cont~0#1.base_21|) 0))))) is different from true [2024-10-13 10:37:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-13 10:37:48,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:37:48,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635127354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:48,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:37:48,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 10 [2024-10-13 10:37:48,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632296553] [2024-10-13 10:37:48,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:48,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:37:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:48,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:37:48,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=53, Unknown=1, NotChecked=16, Total=110 [2024-10-13 10:37:48,751 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 4 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-10-13 10:37:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:48,821 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-10-13 10:37:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:37:48,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 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 24 [2024-10-13 10:37:48,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:48,822 INFO L225 Difference]: With dead ends: 69 [2024-10-13 10:37:48,822 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 10:37:48,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=53, Unknown=1, NotChecked=16, Total=110 [2024-10-13 10:37:48,823 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:48,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 20 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2024-10-13 10:37:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 10:37:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 10:37:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 66 states have internal predecessors, (68), 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-10-13 10:37:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2024-10-13 10:37:48,825 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 24 [2024-10-13 10:37:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:48,825 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2024-10-13 10:37:48,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-10-13 10:37:48,826 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2024-10-13 10:37:48,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:37:48,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:48,826 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:48,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 10:37:49,030 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-10-13 10:37:49,031 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:49,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash -248124872, now seen corresponding path program 1 times [2024-10-13 10:37:49,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:49,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837264308] [2024-10-13 10:37:49,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:49,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:49,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:49,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837264308] [2024-10-13 10:37:49,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837264308] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:49,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393662930] [2024-10-13 10:37:49,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:49,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:49,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:49,168 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:37:49,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 10:37:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:49,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 10:37:49,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:49,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:49,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393662930] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:37:49,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:37:49,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-10-13 10:37:49,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908362164] [2024-10-13 10:37:49,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:37:49,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:37:49,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:49,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:37:49,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:37:49,389 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 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-10-13 10:37:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:49,438 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2024-10-13 10:37:49,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:37:49,438 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 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 24 [2024-10-13 10:37:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:49,439 INFO L225 Difference]: With dead ends: 79 [2024-10-13 10:37:49,439 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 10:37:49,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:37:49,440 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:49,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 170 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 10:37:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-13 10:37:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 78 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-10-13 10:37:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2024-10-13 10:37:49,442 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 24 [2024-10-13 10:37:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:49,442 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2024-10-13 10:37:49,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 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-10-13 10:37:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2024-10-13 10:37:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 10:37:49,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:49,447 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:49,460 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-10-13 10:37:49,648 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-10-13 10:37:49,648 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:49,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash -997092424, now seen corresponding path program 2 times [2024-10-13 10:37:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:49,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942794073] [2024-10-13 10:37:49,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:49,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-13 10:37:49,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:49,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942794073] [2024-10-13 10:37:49,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942794073] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:49,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651923682] [2024-10-13 10:37:49,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:37:49,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:49,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:49,983 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:37:49,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 10:37:50,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:37:50,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:37:50,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 10:37:50,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:50,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:50,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:50,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:50,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2024-10-13 10:37:50,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-10-13 10:37:50,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:50,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:50,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:50,166 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-13 10:37:50,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-10-13 10:37:50,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:37:50,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651923682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:50,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:37:50,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2024-10-13 10:37:50,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311460434] [2024-10-13 10:37:50,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:50,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:37:50,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:50,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:37:50,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:37:50,285 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-10-13 10:37:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:50,326 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2024-10-13 10:37:50,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:37:50,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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 36 [2024-10-13 10:37:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:50,327 INFO L225 Difference]: With dead ends: 78 [2024-10-13 10:37:50,327 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 10:37:50,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:37:50,328 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:50,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 10:37:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 10:37:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 77 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-10-13 10:37:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2024-10-13 10:37:50,330 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 36 [2024-10-13 10:37:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:50,330 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2024-10-13 10:37:50,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-10-13 10:37:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2024-10-13 10:37:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 10:37:50,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:50,331 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:50,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 10:37:50,535 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,SelfDestructingSolverStorable12 [2024-10-13 10:37:50,536 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:50,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:50,536 INFO L85 PathProgramCache]: Analyzing trace with hash -845094099, now seen corresponding path program 1 times [2024-10-13 10:37:50,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:50,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89402801] [2024-10-13 10:37:50,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:50,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 108 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:50,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:50,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89402801] [2024-10-13 10:37:50,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89402801] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:50,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208456206] [2024-10-13 10:37:50,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:50,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:50,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:50,888 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:37:50,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 10:37:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:51,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 10:37:51,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 135 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:51,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:51,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-13 10:37:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 135 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:51,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208456206] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:37:51,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:37:51,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2024-10-13 10:37:51,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423508913] [2024-10-13 10:37:51,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:37:51,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-13 10:37:51,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:51,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-13 10:37:51,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1035, Unknown=0, NotChecked=0, Total=1406 [2024-10-13 10:37:51,588 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 38 states, 37 states have (on average 3.0) internal successors, (111), 37 states have internal predecessors, (111), 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-10-13 10:37:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:51,945 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2024-10-13 10:37:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:37:51,945 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.0) internal successors, (111), 37 states have internal predecessors, (111), 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-10-13 10:37:51,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:51,946 INFO L225 Difference]: With dead ends: 76 [2024-10-13 10:37:51,946 INFO L226 Difference]: Without dead ends: 76 [2024-10-13 10:37:51,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=621, Invalid=1731, Unknown=0, NotChecked=0, Total=2352 [2024-10-13 10:37:51,948 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 58 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:51,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 259 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:37:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-13 10:37:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-13 10:37:51,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.4) internal successors, (77), 75 states have internal predecessors, (77), 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-10-13 10:37:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2024-10-13 10:37:51,950 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 37 [2024-10-13 10:37:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:51,950 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2024-10-13 10:37:51,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.0) internal successors, (111), 37 states have internal predecessors, (111), 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-10-13 10:37:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2024-10-13 10:37:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 10:37:51,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:51,951 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:51,966 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-10-13 10:37:52,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 10:37:52,152 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:52,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:52,152 INFO L85 PathProgramCache]: Analyzing trace with hash -428113317, now seen corresponding path program 1 times [2024-10-13 10:37:52,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:52,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351079621] [2024-10-13 10:37:52,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:52,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 118 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:52,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:52,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351079621] [2024-10-13 10:37:52,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351079621] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:52,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034816484] [2024-10-13 10:37:52,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:52,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:52,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:52,958 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:37:52,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 10:37:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:53,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 10:37:53,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:53,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:53,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:53,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:53,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:53,129 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 10:37:53,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 10:37:53,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:37:53,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-10-13 10:37:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-10-13 10:37:53,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:37:53,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034816484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:53,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:37:53,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [12] total 13 [2024-10-13 10:37:53,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985458141] [2024-10-13 10:37:53,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:53,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:37:53,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:53,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:37:53,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:37:53,294 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-10-13 10:37:53,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:53,333 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2024-10-13 10:37:53,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:37:53,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 38 [2024-10-13 10:37:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:53,334 INFO L225 Difference]: With dead ends: 74 [2024-10-13 10:37:53,334 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 10:37:53,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:37:53,335 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:53,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 29 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 10:37:53,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-13 10:37:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 73 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-10-13 10:37:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2024-10-13 10:37:53,341 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 38 [2024-10-13 10:37:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:53,342 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2024-10-13 10:37:53,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-10-13 10:37:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2024-10-13 10:37:53,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 10:37:53,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:53,342 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:53,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-13 10:37:53,543 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,SelfDestructingSolverStorable14 [2024-10-13 10:37:53,543 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:53,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash 899962109, now seen corresponding path program 1 times [2024-10-13 10:37:53,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:53,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599711071] [2024-10-13 10:37:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:53,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-13 10:37:53,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:53,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599711071] [2024-10-13 10:37:53,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599711071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:53,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:53,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:37:53,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034056378] [2024-10-13 10:37:53,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:53,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:37:53,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:53,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:37:53,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:37:53,762 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-10-13 10:37:53,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:53,831 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2024-10-13 10:37:53,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:37:53,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 40 [2024-10-13 10:37:53,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:53,832 INFO L225 Difference]: With dead ends: 73 [2024-10-13 10:37:53,833 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 10:37:53,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:37:53,834 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:53,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 41 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:53,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 10:37:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-13 10:37:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 72 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-10-13 10:37:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2024-10-13 10:37:53,838 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 40 [2024-10-13 10:37:53,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:53,838 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2024-10-13 10:37:53,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-10-13 10:37:53,838 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2024-10-13 10:37:53,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 10:37:53,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:53,840 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:53,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 10:37:53,840 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:53,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:53,841 INFO L85 PathProgramCache]: Analyzing trace with hash 899962110, now seen corresponding path program 1 times [2024-10-13 10:37:53,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:53,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382170364] [2024-10-13 10:37:53,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:53,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 108 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:54,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:54,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382170364] [2024-10-13 10:37:54,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382170364] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:54,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807572525] [2024-10-13 10:37:54,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:54,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:54,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:54,416 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:37:54,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 10:37:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:54,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 10:37:54,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:54,881 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-10-13 10:37:54,884 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-10-13 10:37:54,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-10-13 10:37:54,920 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 26 treesize of output 14 [2024-10-13 10:37:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 135 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:54,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:55,037 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 22 treesize of output 18 [2024-10-13 10:37:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 135 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:55,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807572525] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:37:55,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:37:55,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 33 [2024-10-13 10:37:55,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854688418] [2024-10-13 10:37:55,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:37:55,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-13 10:37:55,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:55,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-13 10:37:55,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 10:37:55,142 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 35 states, 34 states have (on average 2.764705882352941) internal successors, (94), 34 states have internal predecessors, (94), 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-10-13 10:37:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:55,584 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2024-10-13 10:37:55,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 10:37:55,588 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.764705882352941) internal successors, (94), 34 states have internal predecessors, (94), 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-10-13 10:37:55,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:55,588 INFO L225 Difference]: With dead ends: 72 [2024-10-13 10:37:55,588 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 10:37:55,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=474, Invalid=1878, Unknown=0, NotChecked=0, Total=2352 [2024-10-13 10:37:55,589 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 84 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:55,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 188 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:37:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 10:37:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-13 10:37:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 71 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-10-13 10:37:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2024-10-13 10:37:55,591 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 40 [2024-10-13 10:37:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:55,591 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-10-13 10:37:55,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.764705882352941) internal successors, (94), 34 states have internal predecessors, (94), 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-10-13 10:37:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2024-10-13 10:37:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-13 10:37:55,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:55,593 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:55,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-13 10:37:55,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 10:37:55,797 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-10-13 10:37:55,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2129021618, now seen corresponding path program 1 times [2024-10-13 10:37:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:55,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362525296] [2024-10-13 10:37:55,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:55,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:37:55,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 10:37:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:37:55,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 10:37:55,909 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 10:37:55,910 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 38 remaining) [2024-10-13 10:37:55,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2024-10-13 10:37:55,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2024-10-13 10:37:55,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2024-10-13 10:37:55,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2024-10-13 10:37:55,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2024-10-13 10:37:55,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2024-10-13 10:37:55,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2024-10-13 10:37:55,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2024-10-13 10:37:55,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2024-10-13 10:37:55,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2024-10-13 10:37:55,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2024-10-13 10:37:55,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2024-10-13 10:37:55,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2024-10-13 10:37:55,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2024-10-13 10:37:55,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2024-10-13 10:37:55,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2024-10-13 10:37:55,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2024-10-13 10:37:55,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2024-10-13 10:37:55,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2024-10-13 10:37:55,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2024-10-13 10:37:55,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2024-10-13 10:37:55,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2024-10-13 10:37:55,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2024-10-13 10:37:55,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2024-10-13 10:37:55,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2024-10-13 10:37:55,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2024-10-13 10:37:55,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2024-10-13 10:37:55,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2024-10-13 10:37:55,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2024-10-13 10:37:55,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2024-10-13 10:37:55,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 38 remaining) [2024-10-13 10:37:55,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 38 remaining) [2024-10-13 10:37:55,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 38 remaining) [2024-10-13 10:37:55,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 38 remaining) [2024-10-13 10:37:55,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 38 remaining) [2024-10-13 10:37:55,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (1 of 38 remaining) [2024-10-13 10:37:55,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2024-10-13 10:37:55,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:37:55,918 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:55,957 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:37:55,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:37:55 BoogieIcfgContainer [2024-10-13 10:37:55,961 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:37:55,962 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:37:55,962 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:37:55,962 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:37:55,962 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:37:42" (3/4) ... [2024-10-13 10:37:55,963 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-13 10:37:56,010 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:37:56,012 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:37:56,012 INFO L158 Benchmark]: Toolchain (without parser) took 14376.55ms. Allocated memory was 165.7MB in the beginning and 339.7MB in the end (delta: 174.1MB). Free memory was 99.8MB in the beginning and 245.7MB in the end (delta: -145.9MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-10-13 10:37:56,013 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 165.7MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:37:56,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.51ms. Allocated memory is still 165.7MB. Free memory was 99.5MB in the beginning and 86.8MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 10:37:56,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.98ms. Allocated memory is still 165.7MB. Free memory was 86.8MB in the beginning and 85.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:37:56,013 INFO L158 Benchmark]: Boogie Preprocessor took 90.62ms. Allocated memory is still 165.7MB. Free memory was 85.0MB in the beginning and 136.8MB in the end (delta: -51.8MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2024-10-13 10:37:56,013 INFO L158 Benchmark]: RCFGBuilder took 521.80ms. Allocated memory is still 165.7MB. Free memory was 136.8MB in the beginning and 110.8MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 10:37:56,013 INFO L158 Benchmark]: TraceAbstraction took 13392.56ms. Allocated memory was 165.7MB in the beginning and 339.7MB in the end (delta: 174.1MB). Free memory was 110.2MB in the beginning and 248.8MB in the end (delta: -138.6MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-10-13 10:37:56,013 INFO L158 Benchmark]: Witness Printer took 50.26ms. Allocated memory is still 339.7MB. Free memory was 248.8MB in the beginning and 245.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:37:56,015 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 165.7MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.51ms. Allocated memory is still 165.7MB. Free memory was 99.5MB in the beginning and 86.8MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.98ms. Allocated memory is still 165.7MB. Free memory was 86.8MB in the beginning and 85.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.62ms. Allocated memory is still 165.7MB. Free memory was 85.0MB in the beginning and 136.8MB in the end (delta: -51.8MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. * RCFGBuilder took 521.80ms. Allocated memory is still 165.7MB. Free memory was 136.8MB in the beginning and 110.8MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13392.56ms. Allocated memory was 165.7MB in the beginning and 339.7MB in the end (delta: 174.1MB). Free memory was 110.2MB in the beginning and 248.8MB in the end (delta: -138.6MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Witness Printer took 50.26ms. Allocated memory is still 339.7MB. Free memory was 248.8MB in the beginning and 245.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L23] struct cont cont; [L24] struct dummy dummy; [L25] struct dummy *dummies[10]; [L26] int a[10]; [L27] int i, *pa; [L28] i = __VERIFIER_nondet_int() [L29] int j = 0; VAL [a={7:0}, cont={6:0}, dummies={5:0}, dummy={9:0}, i=8, j=0] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={6:0}, dummies={5:0}, dummy={9:0}, i=8, j=1] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={6:0}, dummies={5:0}, dummy={9:0}, i=8, j=2] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={6:0}, dummies={5:0}, dummy={9:0}, i=8, j=3] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={6:0}, dummies={5:0}, dummy={9:0}, i=8, j=4] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={6:0}, dummies={5:0}, dummy={9:0}, i=8, j=5] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={6:0}, dummies={5:0}, dummy={9:0}, i=8, j=6] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={6:0}, dummies={5:0}, dummy={9:0}, i=8, j=7] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={6:0}, dummies={5:0}, dummy={9:0}, i=8, j=8] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={6:0}, dummies={5:0}, dummy={9:0}, i=8, j=9] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={6:0}, dummies={5:0}, dummy={9:0}, i=8, j=10] [L29] COND FALSE !(j < 10) VAL [a={7:0}, cont={6:0}, dummies={5:0}, dummy={9:0}, i=8] [L36] COND TRUE i >= 0 && i < 9 [L37] a[i] = i [L38] dummy.array = &a[i] [L39] dummies[i + 1] = &dummy [L40] cont.array = &dummies[0] [L41] EXPR cont.array [L41] EXPR cont.array[i] [L41] cont.array[i]->array - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 464 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 464 mSDsluCounter, 1840 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 55 IncrementalHoareTripleChecker+Unchecked, 1185 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2423 IncrementalHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 655 mSDtfsCounter, 2423 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 510 GetRequests, 306 SyntacticMatches, 4 SemanticMatches, 200 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1622 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=12, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 616 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 682 ConstructedInterpolants, 38 QuantifiedInterpolants, 8481 SizeOfPredicates, 32 NumberOfNonLiveVariables, 2663 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 35 InterpolantComputations, 10 PerfectInterpolantSequences, 1589/2027 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-13 10:37:56,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)