./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.10-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_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme --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 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:57:21,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:57:21,777 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-26 11:57:21,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:57:21,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:57:21,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:57:21,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:57:21,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:57:21,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:57:21,815 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:57:21,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:57:21,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:57:21,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:57:21,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:57:21,818 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:57:21,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:57:21,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:57:21,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:57:21,829 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:57:21,829 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:57:21,830 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:57:21,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:57:21,832 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:57:21,833 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:57:21,833 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:57:21,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:57:21,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:57:21,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:57:21,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:57:21,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:57:21,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:57:21,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:57:21,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:57:21,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:57:21,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:57:21,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:57:21,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:57:21,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:57:21,841 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_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/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_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme 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 -> 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b [2023-11-26 11:57:22,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:57:22,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:57:22,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:57:22,198 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:57:22,200 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:57:22,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2023-11-26 11:57:25,415 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:57:25,657 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:57:25,658 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2023-11-26 11:57:25,681 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/data/e9839df65/56121e3340784e1484b833444e8ec32f/FLAGf32927abd [2023-11-26 11:57:25,697 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/data/e9839df65/56121e3340784e1484b833444e8ec32f [2023-11-26 11:57:25,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:57:25,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:57:25,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:57:25,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:57:25,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:57:25,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:57:25" (1/1) ... [2023-11-26 11:57:25,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43bcc263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:25, skipping insertion in model container [2023-11-26 11:57:25,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:57:25" (1/1) ... [2023-11-26 11:57:25,771 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:57:26,116 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:57:26,130 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:57:26,206 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:57:26,242 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:57:26,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:26 WrapperNode [2023-11-26 11:57:26,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:57:26,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:57:26,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:57:26,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:57:26,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:26" (1/1) ... [2023-11-26 11:57:26,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:26" (1/1) ... [2023-11-26 11:57:26,286 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 104 [2023-11-26 11:57:26,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:57:26,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:57:26,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:57:26,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:57:26,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:26" (1/1) ... [2023-11-26 11:57:26,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:26" (1/1) ... [2023-11-26 11:57:26,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:26" (1/1) ... [2023-11-26 11:57:26,318 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 7, 9]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [1, 2, 2]. [2023-11-26 11:57:26,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:26" (1/1) ... [2023-11-26 11:57:26,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:26" (1/1) ... [2023-11-26 11:57:26,325 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:26" (1/1) ... [2023-11-26 11:57:26,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:26" (1/1) ... [2023-11-26 11:57:26,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:26" (1/1) ... [2023-11-26 11:57:26,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:26" (1/1) ... [2023-11-26 11:57:26,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:57:26,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:57:26,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:57:26,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:57:26,338 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:26" (1/1) ... [2023-11-26 11:57:26,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:57:26,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:57:26,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:57:26,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:57:26,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:57:26,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 11:57:26,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 11:57:26,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:57:26,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:57:26,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:57:26,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:57:26,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:57:26,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:57:26,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:57:26,551 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:57:26,554 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:57:26,877 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:57:26,942 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:57:26,942 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:57:26,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:57:26 BoogieIcfgContainer [2023-11-26 11:57:26,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:57:26,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:57:26,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:57:26,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:57:26,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:57:25" (1/3) ... [2023-11-26 11:57:26,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683818a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:57:26, skipping insertion in model container [2023-11-26 11:57:26,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:26" (2/3) ... [2023-11-26 11:57:26,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683818a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:57:26, skipping insertion in model container [2023-11-26 11:57:26,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:57:26" (3/3) ... [2023-11-26 11:57:26,953 INFO L112 eAbstractionObserver]: Analyzing ICFG b.10-alloca.i [2023-11-26 11:57:26,974 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:57:26,974 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2023-11-26 11:57:27,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:57:27,046 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;@4466ad1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:57:27,046 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2023-11-26 11:57:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 30 states have (on average 2.5) internal successors, (75), 67 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:57:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-26 11:57:27,059 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:27,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-26 11:57:27,063 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-26 11:57:27,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:27,071 INFO L85 PathProgramCache]: Analyzing trace with hash 4964, now seen corresponding path program 1 times [2023-11-26 11:57:27,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:27,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146125501] [2023-11-26 11:57:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:27,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:27,514 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-26 11:57:27,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:27,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146125501] [2023-11-26 11:57:27,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146125501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:27,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:27,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:57:27,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780797757] [2023-11-26 11:57:27,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:27,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:27,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:27,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:27,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:27,558 INFO L87 Difference]: Start difference. First operand has 68 states, 30 states have (on average 2.5) internal successors, (75), 67 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-26 11:57:27,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:27,653 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2023-11-26 11:57:27,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:27,656 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-26 11:57:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:27,665 INFO L225 Difference]: With dead ends: 59 [2023-11-26 11:57:27,666 INFO L226 Difference]: Without dead ends: 58 [2023-11-26 11:57:27,667 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-26 11:57:27,671 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:27,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 27 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:57:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-26 11:57:27,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-26 11:57:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 57 states have internal predecessors, (64), 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-26 11:57:27,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2023-11-26 11:57:27,708 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 2 [2023-11-26 11:57:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:27,708 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2023-11-26 11:57:27,709 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-26 11:57:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2023-11-26 11:57:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-26 11:57:27,709 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:27,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-26 11:57:27,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:57:27,710 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-26 11:57:27,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:27,711 INFO L85 PathProgramCache]: Analyzing trace with hash 4965, now seen corresponding path program 1 times [2023-11-26 11:57:27,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:27,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210340229] [2023-11-26 11:57:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:27,938 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-26 11:57:27,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:27,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210340229] [2023-11-26 11:57:27,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210340229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:27,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:27,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:57:27,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231381106] [2023-11-26 11:57:27,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:27,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:27,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:27,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:27,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:27,945 INFO L87 Difference]: Start difference. First operand 58 states and 64 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-26 11:57:28,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:28,035 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2023-11-26 11:57:28,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:28,036 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-26 11:57:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:28,038 INFO L225 Difference]: With dead ends: 49 [2023-11-26 11:57:28,038 INFO L226 Difference]: Without dead ends: 49 [2023-11-26 11:57:28,042 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-26 11:57:28,044 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 52 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:28,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 28 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:57:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-26 11:57:28,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-26 11:57:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 48 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-26 11:57:28,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2023-11-26 11:57:28,055 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 2 [2023-11-26 11:57:28,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:28,055 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-11-26 11:57:28,055 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-26 11:57:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2023-11-26 11:57:28,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-26 11:57:28,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:28,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-26 11:57:28,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:57:28,057 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-26 11:57:28,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:28,059 INFO L85 PathProgramCache]: Analyzing trace with hash 153860, now seen corresponding path program 1 times [2023-11-26 11:57:28,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:28,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740180159] [2023-11-26 11:57:28,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:28,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,180 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-26 11:57:28,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:28,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740180159] [2023-11-26 11:57:28,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740180159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:28,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:28,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:57:28,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358568239] [2023-11-26 11:57:28,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:28,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:28,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:28,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:28,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:28,185 INFO L87 Difference]: Start difference. First operand 49 states and 55 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-26 11:57:28,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:28,255 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2023-11-26 11:57:28,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:28,255 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-26 11:57:28,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:28,259 INFO L225 Difference]: With dead ends: 42 [2023-11-26 11:57:28,260 INFO L226 Difference]: Without dead ends: 42 [2023-11-26 11:57:28,264 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-26 11:57:28,266 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:28,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 20 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:57:28,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-26 11:57:28,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-26 11:57:28,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.6) internal successors, (48), 41 states have internal predecessors, (48), 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-26 11:57:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2023-11-26 11:57:28,272 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 3 [2023-11-26 11:57:28,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:28,272 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2023-11-26 11:57:28,272 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-26 11:57:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2023-11-26 11:57:28,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-26 11:57:28,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:28,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-26 11:57:28,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:57:28,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-26 11:57:28,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:28,274 INFO L85 PathProgramCache]: Analyzing trace with hash 153861, now seen corresponding path program 1 times [2023-11-26 11:57:28,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:28,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617444892] [2023-11-26 11:57:28,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:28,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,421 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-26 11:57:28,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:28,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617444892] [2023-11-26 11:57:28,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617444892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:28,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:28,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:57:28,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077013060] [2023-11-26 11:57:28,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:28,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:28,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:28,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:28,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:28,426 INFO L87 Difference]: Start difference. First operand 42 states and 48 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-26 11:57:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:28,477 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2023-11-26 11:57:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:28,478 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-26 11:57:28,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:28,479 INFO L225 Difference]: With dead ends: 35 [2023-11-26 11:57:28,479 INFO L226 Difference]: Without dead ends: 35 [2023-11-26 11:57:28,482 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-26 11:57:28,489 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 37 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:28,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 21 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:57:28,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-26 11:57:28,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-26 11:57:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 34 states have internal predecessors, (41), 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-26 11:57:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-11-26 11:57:28,503 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 3 [2023-11-26 11:57:28,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:28,503 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-11-26 11:57:28,504 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-26 11:57:28,504 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-11-26 11:57:28,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-26 11:57:28,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:28,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-26 11:57:28,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:57:28,505 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-26 11:57:28,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash 4769639, now seen corresponding path program 1 times [2023-11-26 11:57:28,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:28,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763890851] [2023-11-26 11:57:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:28,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,562 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-26 11:57:28,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:28,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763890851] [2023-11-26 11:57:28,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763890851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:28,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:28,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:57:28,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099056455] [2023-11-26 11:57:28,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:28,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:28,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:28,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:28,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:28,565 INFO L87 Difference]: Start difference. First operand 35 states and 41 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-26 11:57:28,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:28,607 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-11-26 11:57:28,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:28,608 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-26 11:57:28,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:28,609 INFO L225 Difference]: With dead ends: 33 [2023-11-26 11:57:28,609 INFO L226 Difference]: Without dead ends: 33 [2023-11-26 11:57:28,609 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-26 11:57:28,610 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:28,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 18 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:57:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-26 11:57:28,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-26 11:57:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:57:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-11-26 11:57:28,618 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 4 [2023-11-26 11:57:28,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:28,618 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-26 11:57:28,619 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-26 11:57:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-11-26 11:57:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-26 11:57:28,619 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:28,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-26 11:57:28,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:57:28,620 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-26 11:57:28,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:28,622 INFO L85 PathProgramCache]: Analyzing trace with hash 4769640, now seen corresponding path program 1 times [2023-11-26 11:57:28,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:28,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911265866] [2023-11-26 11:57:28,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:28,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,717 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-26 11:57:28,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:28,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911265866] [2023-11-26 11:57:28,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911265866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:28,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:28,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:57:28,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959051944] [2023-11-26 11:57:28,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:28,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:28,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:28,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:28,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:28,721 INFO L87 Difference]: Start difference. First operand 33 states and 39 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-26 11:57:28,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:28,757 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2023-11-26 11:57:28,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:28,758 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-26 11:57:28,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:28,760 INFO L225 Difference]: With dead ends: 31 [2023-11-26 11:57:28,764 INFO L226 Difference]: Without dead ends: 31 [2023-11-26 11:57:28,764 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-26 11:57:28,765 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:28,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 19 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:57:28,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-26 11:57:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-26 11:57:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:57:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-26 11:57:28,780 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 4 [2023-11-26 11:57:28,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:28,784 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-26 11:57:28,785 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-26 11:57:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-11-26 11:57:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-26 11:57:28,786 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:28,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:28,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:57:28,786 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-26 11:57:28,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:28,787 INFO L85 PathProgramCache]: Analyzing trace with hash 777870703, now seen corresponding path program 1 times [2023-11-26 11:57:28,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:28,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062578070] [2023-11-26 11:57:28,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:28,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,852 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-26 11:57:28,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:28,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062578070] [2023-11-26 11:57:28,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062578070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:28,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:28,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:57:28,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294271401] [2023-11-26 11:57:28,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:28,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:57:28,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:28,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:57:28,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:57:28,855 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-26 11:57:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:28,915 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2023-11-26 11:57:28,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:57:28,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2023-11-26 11:57:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:28,918 INFO L225 Difference]: With dead ends: 43 [2023-11-26 11:57:28,919 INFO L226 Difference]: Without dead ends: 43 [2023-11-26 11:57:28,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:57:28,921 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:28,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 76 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:57:28,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-26 11:57:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2023-11-26 11:57:28,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:57:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-11-26 11:57:28,938 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 13 [2023-11-26 11:57:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:28,939 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-26 11:57:28,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-26 11:57:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-11-26 11:57:28,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-26 11:57:28,940 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:28,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:28,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:57:28,940 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-26 11:57:28,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:28,941 INFO L85 PathProgramCache]: Analyzing trace with hash -766668980, now seen corresponding path program 1 times [2023-11-26 11:57:28,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:28,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653444683] [2023-11-26 11:57:28,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:28,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:29,039 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-26 11:57:29,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:29,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653444683] [2023-11-26 11:57:29,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653444683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:29,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:29,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:57:29,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45616182] [2023-11-26 11:57:29,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:29,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:57:29,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:29,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:57:29,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:57:29,043 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:57:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:29,093 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2023-11-26 11:57:29,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:57:29,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-26 11:57:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:29,095 INFO L225 Difference]: With dead ends: 38 [2023-11-26 11:57:29,095 INFO L226 Difference]: Without dead ends: 38 [2023-11-26 11:57:29,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:57:29,097 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:29,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 71 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:57:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-26 11:57:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2023-11-26 11:57:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 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-26 11:57:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-11-26 11:57:29,103 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 15 [2023-11-26 11:57:29,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:29,104 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-11-26 11:57:29,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:57:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-11-26 11:57:29,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-26 11:57:29,105 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:29,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:29,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:57:29,106 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-26 11:57:29,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:29,107 INFO L85 PathProgramCache]: Analyzing trace with hash -890048542, now seen corresponding path program 1 times [2023-11-26 11:57:29,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:29,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028285591] [2023-11-26 11:57:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:29,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:29,274 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-26 11:57:29,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:29,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028285591] [2023-11-26 11:57:29,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028285591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:29,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:29,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:57:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166200619] [2023-11-26 11:57:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:29,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:57:29,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:57:29,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:57:29,276 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:57:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:29,358 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2023-11-26 11:57:29,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:57:29,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-26 11:57:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:29,359 INFO L225 Difference]: With dead ends: 62 [2023-11-26 11:57:29,359 INFO L226 Difference]: Without dead ends: 62 [2023-11-26 11:57:29,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:57:29,360 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 54 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:29,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 93 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:57:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-26 11:57:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2023-11-26 11:57:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:57:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2023-11-26 11:57:29,364 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 16 [2023-11-26 11:57:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:29,365 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2023-11-26 11:57:29,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:57:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2023-11-26 11:57:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-26 11:57:29,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:29,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:29,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:57:29,367 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-26 11:57:29,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:29,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1696583128, now seen corresponding path program 1 times [2023-11-26 11:57:29,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:29,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678070908] [2023-11-26 11:57:29,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:29,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:29,692 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-26 11:57:29,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:29,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678070908] [2023-11-26 11:57:29,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678070908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:29,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:29,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:57:29,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774054026] [2023-11-26 11:57:29,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:29,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:57:29,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:29,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:57:29,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:57:29,694 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-26 11:57:29,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:29,744 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2023-11-26 11:57:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:57:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2023-11-26 11:57:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:29,745 INFO L225 Difference]: With dead ends: 58 [2023-11-26 11:57:29,745 INFO L226 Difference]: Without dead ends: 0 [2023-11-26 11:57:29,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:57:29,746 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:29,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 34 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:57:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-26 11:57:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-26 11:57:29,747 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-26 11:57:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-26 11:57:29,747 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2023-11-26 11:57:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:29,748 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-26 11:57:29,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-26 11:57:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-26 11:57:29,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-26 11:57:29,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 37 remaining) [2023-11-26 11:57:29,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 37 remaining) [2023-11-26 11:57:29,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 37 remaining) [2023-11-26 11:57:29,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 37 remaining) [2023-11-26 11:57:29,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 37 remaining) [2023-11-26 11:57:29,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 37 remaining) [2023-11-26 11:57:29,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 37 remaining) [2023-11-26 11:57:29,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 37 remaining) [2023-11-26 11:57:29,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 37 remaining) [2023-11-26 11:57:29,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 37 remaining) [2023-11-26 11:57:29,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 37 remaining) [2023-11-26 11:57:29,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 37 remaining) [2023-11-26 11:57:29,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 37 remaining) [2023-11-26 11:57:29,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 37 remaining) [2023-11-26 11:57:29,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 37 remaining) [2023-11-26 11:57:29,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 37 remaining) [2023-11-26 11:57:29,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 37 remaining) [2023-11-26 11:57:29,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 37 remaining) [2023-11-26 11:57:29,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 37 remaining) [2023-11-26 11:57:29,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 37 remaining) [2023-11-26 11:57:29,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 37 remaining) [2023-11-26 11:57:29,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 37 remaining) [2023-11-26 11:57:29,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 37 remaining) [2023-11-26 11:57:29,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 37 remaining) [2023-11-26 11:57:29,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 37 remaining) [2023-11-26 11:57:29,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 37 remaining) [2023-11-26 11:57:29,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 37 remaining) [2023-11-26 11:57:29,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 37 remaining) [2023-11-26 11:57:29,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 37 remaining) [2023-11-26 11:57:29,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 37 remaining) [2023-11-26 11:57:29,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 37 remaining) [2023-11-26 11:57:29,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 37 remaining) [2023-11-26 11:57:29,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 37 remaining) [2023-11-26 11:57:29,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 37 remaining) [2023-11-26 11:57:29,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 37 remaining) [2023-11-26 11:57:29,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 37 remaining) [2023-11-26 11:57:29,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (0 of 37 remaining) [2023-11-26 11:57:29,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:57:29,761 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:29,772 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:57:29,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:57:29 BoogieIcfgContainer [2023-11-26 11:57:29,776 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:57:29,777 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:57:29,777 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:57:29,777 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:57:29,778 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:57:26" (3/4) ... [2023-11-26 11:57:29,780 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-26 11:57:29,790 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-26 11:57:29,791 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-26 11:57:29,791 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-26 11:57:29,792 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-26 11:57:29,890 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:57:29,891 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/witness.yml [2023-11-26 11:57:29,891 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:57:29,891 INFO L158 Benchmark]: Toolchain (without parser) took 4191.01ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 80.2MB in the beginning and 126.8MB in the end (delta: -46.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:57:29,892 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 125.8MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:57:29,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.72ms. Allocated memory is still 125.8MB. Free memory was 80.2MB in the beginning and 63.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-26 11:57:29,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.42ms. Allocated memory is still 125.8MB. Free memory was 63.8MB in the beginning and 61.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:57:29,893 INFO L158 Benchmark]: Boogie Preprocessor took 48.35ms. Allocated memory is still 125.8MB. Free memory was 61.8MB in the beginning and 59.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:57:29,893 INFO L158 Benchmark]: RCFGBuilder took 606.04ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 59.7MB in the beginning and 126.2MB in the end (delta: -66.5MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2023-11-26 11:57:29,894 INFO L158 Benchmark]: TraceAbstraction took 2830.84ms. Allocated memory is still 161.5MB. Free memory was 125.3MB in the beginning and 132.1MB in the end (delta: -6.8MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2023-11-26 11:57:29,894 INFO L158 Benchmark]: Witness Printer took 114.05ms. Allocated memory is still 161.5MB. Free memory was 132.1MB in the beginning and 126.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:57:29,896 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.55ms. Allocated memory is still 125.8MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.72ms. Allocated memory is still 125.8MB. Free memory was 80.2MB in the beginning and 63.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.42ms. Allocated memory is still 125.8MB. Free memory was 63.8MB in the beginning and 61.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.35ms. Allocated memory is still 125.8MB. Free memory was 61.8MB in the beginning and 59.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 606.04ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 59.7MB in the beginning and 126.2MB in the end (delta: -66.5MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2830.84ms. Allocated memory is still 161.5MB. Free memory was 125.3MB in the beginning and 132.1MB in the end (delta: -6.8MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. * Witness Printer took 114.05ms. Allocated memory is still 161.5MB. Free memory was 132.1MB in the beginning and 126.8MB 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: -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: 567]: 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, 68 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 387 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 357 IncrementalHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 248 mSDtfsCounter, 357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, InterpolantAutomatonStates: 38, 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, 10 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 591 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 37 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-26 11:57:29,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64206a3-d7d2-4d58-babc-a1b987480e34/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE