./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI --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 64bit --witnessprinter.graph.data.programhash 4cca1c0210c0a53cd372224714db019427e8e227743584713b4610995b14f457 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:45:12,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:45:12,776 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-24 21:45:12,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:45:12,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:45:12,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:45:12,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:45:12,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:45:12,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:45:12,830 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:45:12,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:45:12,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:45:12,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:45:12,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:45:12,835 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:45:12,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:45:12,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:45:12,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:45:12,837 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:45:12,838 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:45:12,838 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:45:12,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:45:12,839 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:45:12,839 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:45:12,840 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:45:12,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:45:12,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:45:12,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:45:12,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:45:12,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:45:12,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:45:12,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:45:12,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:45:12,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:45:12,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:45:12,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:45:12,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:45:12,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:45:12,846 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4cca1c0210c0a53cd372224714db019427e8e227743584713b4610995b14f457 [2023-11-24 21:45:13,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:45:13,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:45:13,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:45:13,178 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:45:13,179 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:45:13,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i [2023-11-24 21:45:16,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:45:16,525 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:45:16,526 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i [2023-11-24 21:45:16,545 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/data/db13afcba/f1584aca9d2a4647a58a9cedbfe85ee6/FLAGd00c32861 [2023-11-24 21:45:16,558 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/data/db13afcba/f1584aca9d2a4647a58a9cedbfe85ee6 [2023-11-24 21:45:16,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:45:16,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:45:16,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:45:16,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:45:16,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:45:16,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:45:16" (1/1) ... [2023-11-24 21:45:16,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c345f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:45:16, skipping insertion in model container [2023-11-24 21:45:16,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:45:16" (1/1) ... [2023-11-24 21:45:16,651 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:45:17,034 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:45:17,052 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:45:17,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:45:17,127 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:45:17,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:45:17 WrapperNode [2023-11-24 21:45:17,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:45:17,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:45:17,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:45:17,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:45:17,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:45:17" (1/1) ... [2023-11-24 21:45:17,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:45:17" (1/1) ... [2023-11-24 21:45:17,175 INFO L138 Inliner]: procedures = 111, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-24 21:45:17,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:45:17,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:45:17,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:45:17,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:45:17,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:45:17" (1/1) ... [2023-11-24 21:45:17,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:45:17" (1/1) ... [2023-11-24 21:45:17,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:45:17" (1/1) ... [2023-11-24 21:45:17,221 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [4, 4, 9]. 53 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 6 writes are split as follows [1, 2, 3]. [2023-11-24 21:45:17,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:45:17" (1/1) ... [2023-11-24 21:45:17,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:45:17" (1/1) ... [2023-11-24 21:45:17,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:45:17" (1/1) ... [2023-11-24 21:45:17,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:45:17" (1/1) ... [2023-11-24 21:45:17,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:45:17" (1/1) ... [2023-11-24 21:45:17,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:45:17" (1/1) ... [2023-11-24 21:45:17,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:45:17,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:45:17,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:45:17,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:45:17,260 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:45:17" (1/1) ... [2023-11-24 21:45:17,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:45:17,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:45:17,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:45:17,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:45:17,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-24 21:45:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-24 21:45:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-24 21:45:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:45:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:45:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:45:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:45:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:45:17,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:45:17,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:45:17,518 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:45:17,521 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:45:17,928 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:45:17,994 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:45:17,994 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-24 21:45:17,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:45:17 BoogieIcfgContainer [2023-11-24 21:45:17,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:45:17,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:45:17,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:45:18,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:45:18,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:45:16" (1/3) ... [2023-11-24 21:45:18,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9989f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:45:18, skipping insertion in model container [2023-11-24 21:45:18,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:45:17" (2/3) ... [2023-11-24 21:45:18,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9989f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:45:18, skipping insertion in model container [2023-11-24 21:45:18,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:45:17" (3/3) ... [2023-11-24 21:45:18,005 INFO L112 eAbstractionObserver]: Analyzing ICFG b.09_assume-alloca.i [2023-11-24 21:45:18,059 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:45:18,060 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2023-11-24 21:45:18,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:45:18,137 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7e4d9292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:45:18,137 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2023-11-24 21:45:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 25 states have (on average 2.64) internal successors, (66), 60 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) [2023-11-24 21:45:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-24 21:45:18,147 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:45:18,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-24 21:45:18,148 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:45:18,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:45:18,154 INFO L85 PathProgramCache]: Analyzing trace with hash 4127, now seen corresponding path program 1 times [2023-11-24 21:45:18,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:45:18,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231556432] [2023-11-24 21:45:18,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:45:18,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:45:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:45:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:45:18,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:45:18,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231556432] [2023-11-24 21:45:18,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231556432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:45:18,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:45:18,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:45:18,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593649278] [2023-11-24 21:45:18,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:45:18,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:45:18,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:45:18,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:45:18,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:45:18,610 INFO L87 Difference]: Start difference. First operand has 61 states, 25 states have (on average 2.64) internal successors, (66), 60 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-24 21:45:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:45:18,751 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2023-11-24 21:45:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:45:18,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-24 21:45:18,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:45:18,764 INFO L225 Difference]: With dead ends: 52 [2023-11-24 21:45:18,764 INFO L226 Difference]: Without dead ends: 51 [2023-11-24 21:45:18,766 INFO L412 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 [2023-11-24 21:45:18,770 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:45:18,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 19 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:45:18,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-24 21:45:18,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-24 21:45:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 25 states have (on average 2.2) internal successors, (55), 50 states have internal predecessors, (55), 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) [2023-11-24 21:45:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2023-11-24 21:45:18,812 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 2 [2023-11-24 21:45:18,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:45:18,813 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2023-11-24 21:45:18,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-24 21:45:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2023-11-24 21:45:18,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-24 21:45:18,815 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:45:18,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-24 21:45:18,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:45:18,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:45:18,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:45:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash 4128, now seen corresponding path program 1 times [2023-11-24 21:45:18,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:45:18,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096585690] [2023-11-24 21:45:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:45:18,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:45:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:45:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:45:19,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:45:19,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096585690] [2023-11-24 21:45:19,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096585690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:45:19,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:45:19,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:45:19,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173081974] [2023-11-24 21:45:19,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:45:19,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:45:19,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:45:19,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:45:19,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:45:19,082 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-24 21:45:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:45:19,161 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2023-11-24 21:45:19,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:45:19,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-24 21:45:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:45:19,164 INFO L225 Difference]: With dead ends: 42 [2023-11-24 21:45:19,164 INFO L226 Difference]: Without dead ends: 42 [2023-11-24 21:45:19,168 INFO L412 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 [2023-11-24 21:45:19,170 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:45:19,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 21 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:45:19,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-24 21:45:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-24 21:45:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.84) internal successors, (46), 41 states have internal predecessors, (46), 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) [2023-11-24 21:45:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2023-11-24 21:45:19,189 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 2 [2023-11-24 21:45:19,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:45:19,190 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2023-11-24 21:45:19,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-24 21:45:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2023-11-24 21:45:19,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-24 21:45:19,191 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:45:19,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-24 21:45:19,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:45:19,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:45:19,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:45:19,195 INFO L85 PathProgramCache]: Analyzing trace with hash 127913, now seen corresponding path program 1 times [2023-11-24 21:45:19,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:45:19,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928037012] [2023-11-24 21:45:19,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:45:19,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:45:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:45:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:45:19,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:45:19,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928037012] [2023-11-24 21:45:19,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928037012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:45:19,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:45:19,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:45:19,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700102414] [2023-11-24 21:45:19,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:45:19,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:45:19,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:45:19,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:45:19,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:45:19,334 INFO L87 Difference]: Start difference. First operand 42 states and 46 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) [2023-11-24 21:45:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:45:19,413 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-11-24 21:45:19,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:45:19,414 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 [2023-11-24 21:45:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:45:19,416 INFO L225 Difference]: With dead ends: 38 [2023-11-24 21:45:19,417 INFO L226 Difference]: Without dead ends: 38 [2023-11-24 21:45:19,423 INFO L412 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 [2023-11-24 21:45:19,429 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:45:19,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 15 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:45:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-24 21:45:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-24 21:45:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.68) internal successors, (42), 37 states have internal predecessors, (42), 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) [2023-11-24 21:45:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-11-24 21:45:19,437 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 3 [2023-11-24 21:45:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:45:19,437 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-11-24 21:45:19,437 INFO L496 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) [2023-11-24 21:45:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-11-24 21:45:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-24 21:45:19,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:45:19,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-24 21:45:19,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:45:19,439 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:45:19,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:45:19,439 INFO L85 PathProgramCache]: Analyzing trace with hash 127914, now seen corresponding path program 1 times [2023-11-24 21:45:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:45:19,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760141042] [2023-11-24 21:45:19,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:45:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:45:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:45:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:45:19,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:45:19,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760141042] [2023-11-24 21:45:19,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760141042] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:45:19,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:45:19,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:45:19,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978537763] [2023-11-24 21:45:19,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:45:19,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:45:19,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:45:19,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:45:19,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:45:19,543 INFO L87 Difference]: Start difference. First operand 38 states and 42 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) [2023-11-24 21:45:19,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:45:19,608 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-11-24 21:45:19,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:45:19,609 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 [2023-11-24 21:45:19,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:45:19,609 INFO L225 Difference]: With dead ends: 34 [2023-11-24 21:45:19,609 INFO L226 Difference]: Without dead ends: 34 [2023-11-24 21:45:19,610 INFO L412 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 [2023-11-24 21:45:19,611 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:45:19,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 17 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:45:19,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-24 21:45:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-24 21:45:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.52) internal successors, (38), 33 states have internal predecessors, (38), 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) [2023-11-24 21:45:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-11-24 21:45:19,616 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 3 [2023-11-24 21:45:19,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:45:19,616 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-11-24 21:45:19,617 INFO L496 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) [2023-11-24 21:45:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2023-11-24 21:45:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-24 21:45:19,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:45:19,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-24 21:45:19,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:45:19,618 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:45:19,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:45:19,619 INFO L85 PathProgramCache]: Analyzing trace with hash 3965282, now seen corresponding path program 1 times [2023-11-24 21:45:19,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:45:19,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466282419] [2023-11-24 21:45:19,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:45:19,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:45:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:45:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:45:19,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:45:19,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466282419] [2023-11-24 21:45:19,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466282419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:45:19,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:45:19,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:45:19,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933331550] [2023-11-24 21:45:19,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:45:19,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:45:19,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:45:19,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:45:19,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:45:19,662 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-11-24 21:45:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:45:19,712 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2023-11-24 21:45:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:45:19,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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 [2023-11-24 21:45:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:45:19,713 INFO L225 Difference]: With dead ends: 30 [2023-11-24 21:45:19,713 INFO L226 Difference]: Without dead ends: 30 [2023-11-24 21:45:19,714 INFO L412 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 [2023-11-24 21:45:19,715 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:45:19,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 11 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:45:19,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-24 21:45:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-24 21:45:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.36) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:45:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-24 21:45:19,720 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 4 [2023-11-24 21:45:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:45:19,720 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-24 21:45:19,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-11-24 21:45:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-11-24 21:45:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-24 21:45:19,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:45:19,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-24 21:45:19,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:45:19,721 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:45:19,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:45:19,722 INFO L85 PathProgramCache]: Analyzing trace with hash 3965283, now seen corresponding path program 1 times [2023-11-24 21:45:19,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:45:19,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333377089] [2023-11-24 21:45:19,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:45:19,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:45:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:45:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:45:19,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:45:19,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333377089] [2023-11-24 21:45:19,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333377089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:45:19,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:45:19,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:45:19,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77705006] [2023-11-24 21:45:19,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:45:19,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:45:19,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:45:19,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:45:19,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:45:19,827 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-11-24 21:45:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:45:19,873 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-11-24 21:45:19,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:45:19,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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 [2023-11-24 21:45:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:45:19,876 INFO L225 Difference]: With dead ends: 26 [2023-11-24 21:45:19,878 INFO L226 Difference]: Without dead ends: 26 [2023-11-24 21:45:19,878 INFO L412 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 [2023-11-24 21:45:19,883 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:45:19,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 13 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:45:19,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-24 21:45:19,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-24 21:45:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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) [2023-11-24 21:45:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-24 21:45:19,894 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 4 [2023-11-24 21:45:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:45:19,899 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-24 21:45:19,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-11-24 21:45:19,901 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-24 21:45:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-24 21:45:19,901 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:45:19,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:45:19,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:45:19,902 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:45:19,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:45:19,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1846754953, now seen corresponding path program 1 times [2023-11-24 21:45:19,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:45:19,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53598510] [2023-11-24 21:45:19,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:45:19,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:45:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:45:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:45:20,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:45:20,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53598510] [2023-11-24 21:45:20,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53598510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:45:20,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:45:20,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:45:20,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793973405] [2023-11-24 21:45:20,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:45:20,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:45:20,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:45:20,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:45:20,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:45:20,212 INFO L87 Difference]: Start difference. First operand 26 states and 30 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) [2023-11-24 21:45:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:45:20,280 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-11-24 21:45:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:45:20,281 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 9 [2023-11-24 21:45:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:45:20,281 INFO L225 Difference]: With dead ends: 25 [2023-11-24 21:45:20,282 INFO L226 Difference]: Without dead ends: 0 [2023-11-24 21:45:20,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:45:20,283 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:45:20,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 19 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:45:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-24 21:45:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-24 21:45:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2023-11-24 21:45:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-24 21:45:20,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2023-11-24 21:45:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:45:20,286 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-24 21:45:20,286 INFO L496 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) [2023-11-24 21:45:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-24 21:45:20,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-24 21:45:20,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 35 remaining) [2023-11-24 21:45:20,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 35 remaining) [2023-11-24 21:45:20,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 35 remaining) [2023-11-24 21:45:20,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 35 remaining) [2023-11-24 21:45:20,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 35 remaining) [2023-11-24 21:45:20,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 35 remaining) [2023-11-24 21:45:20,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 35 remaining) [2023-11-24 21:45:20,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 35 remaining) [2023-11-24 21:45:20,291 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 35 remaining) [2023-11-24 21:45:20,292 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 35 remaining) [2023-11-24 21:45:20,292 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 35 remaining) [2023-11-24 21:45:20,292 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 35 remaining) [2023-11-24 21:45:20,292 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 35 remaining) [2023-11-24 21:45:20,292 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 35 remaining) [2023-11-24 21:45:20,293 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 35 remaining) [2023-11-24 21:45:20,293 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 35 remaining) [2023-11-24 21:45:20,293 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 35 remaining) [2023-11-24 21:45:20,293 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 35 remaining) [2023-11-24 21:45:20,294 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 35 remaining) [2023-11-24 21:45:20,294 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 35 remaining) [2023-11-24 21:45:20,294 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 35 remaining) [2023-11-24 21:45:20,294 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 35 remaining) [2023-11-24 21:45:20,294 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 35 remaining) [2023-11-24 21:45:20,295 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 35 remaining) [2023-11-24 21:45:20,295 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 35 remaining) [2023-11-24 21:45:20,295 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 35 remaining) [2023-11-24 21:45:20,295 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 35 remaining) [2023-11-24 21:45:20,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 35 remaining) [2023-11-24 21:45:20,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 35 remaining) [2023-11-24 21:45:20,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 35 remaining) [2023-11-24 21:45:20,297 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 35 remaining) [2023-11-24 21:45:20,297 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 35 remaining) [2023-11-24 21:45:20,297 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 35 remaining) [2023-11-24 21:45:20,297 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 35 remaining) [2023-11-24 21:45:20,297 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (0 of 35 remaining) [2023-11-24 21:45:20,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:45:20,301 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:45:20,303 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:45:20,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:45:20 BoogieIcfgContainer [2023-11-24 21:45:20,308 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:45:20,308 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:45:20,308 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:45:20,308 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:45:20,309 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:45:17" (3/4) ... [2023-11-24 21:45:20,312 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-24 21:45:20,324 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2023-11-24 21:45:20,324 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-24 21:45:20,325 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-24 21:45:20,325 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-24 21:45:20,434 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/witness.graphml [2023-11-24 21:45:20,434 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/witness.yml [2023-11-24 21:45:20,434 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:45:20,435 INFO L158 Benchmark]: Toolchain (without parser) took 3872.89ms. Allocated memory is still 157.3MB. Free memory was 110.8MB in the beginning and 55.6MB in the end (delta: 55.2MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2023-11-24 21:45:20,435 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 121.6MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:45:20,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.12ms. Allocated memory is still 157.3MB. Free memory was 110.4MB in the beginning and 94.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-24 21:45:20,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.58ms. Allocated memory is still 157.3MB. Free memory was 94.1MB in the beginning and 92.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:45:20,436 INFO L158 Benchmark]: Boogie Preprocessor took 81.22ms. Allocated memory is still 157.3MB. Free memory was 91.9MB in the beginning and 89.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:45:20,437 INFO L158 Benchmark]: RCFGBuilder took 736.35ms. Allocated memory is still 157.3MB. Free memory was 89.9MB in the beginning and 70.6MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-24 21:45:20,437 INFO L158 Benchmark]: TraceAbstraction took 2310.09ms. Allocated memory is still 157.3MB. Free memory was 69.5MB in the beginning and 60.8MB in the end (delta: 8.6MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2023-11-24 21:45:20,438 INFO L158 Benchmark]: Witness Printer took 126.35ms. Allocated memory is still 157.3MB. Free memory was 60.8MB in the beginning and 55.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:45:20,440 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.62ms. Allocated memory is still 121.6MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 564.12ms. Allocated memory is still 157.3MB. Free memory was 110.4MB in the beginning and 94.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.58ms. Allocated memory is still 157.3MB. Free memory was 94.1MB in the beginning and 92.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.22ms. Allocated memory is still 157.3MB. Free memory was 91.9MB in the beginning and 89.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 736.35ms. Allocated memory is still 157.3MB. Free memory was 89.9MB in the beginning and 70.6MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2310.09ms. Allocated memory is still 157.3MB. Free memory was 69.5MB in the beginning and 60.8MB in the end (delta: 8.6MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Witness Printer took 126.35ms. Allocated memory is still 157.3MB. Free memory was 60.8MB in the beginning and 55.6MB in the end (delta: 5.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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 61 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 231 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 211 IncrementalHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 103 mSDtfsCounter, 211 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-24 21:45:20,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0834f105-4fee-4857-9ea2-adcdafd230c3/bin/uautomizer-verify-NlZe1sFDwI/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 Result: TRUE