./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.02-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.02-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB --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 854590cc4413a89873a976feacf89528edce1772c9b07a52d61540a880295e5a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:49:19,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:49:20,067 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-27 19:49:20,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:49:20,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:49:20,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:49:20,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:49:20,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:49:20,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:49:20,108 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:49:20,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:49:20,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:49:20,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:49:20,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:49:20,109 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:49:20,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:49:20,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 19:49:20,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:49:20,110 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 19:49:20,110 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 19:49:20,110 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 19:49:20,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:49:20,110 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 19:49:20,110 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 19:49:20,110 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:49:20,110 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:49:20,110 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:49:20,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:49:20,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:49:20,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:49:20,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:49:20,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:49:20,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:49:20,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:49:20,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:49:20,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:49:20,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:49:20,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:49:20,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 19:49:20,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 19:49:20,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:49:20,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:49:20,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:49:20,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:49:20,112 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 854590cc4413a89873a976feacf89528edce1772c9b07a52d61540a880295e5a [2024-11-27 19:49:20,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:49:20,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:49:20,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:49:20,446 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:49:20,446 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:49:20,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/termination-memory-alloca/b.02-alloca.i [2024-11-27 19:49:23,514 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/data/24fce4c2c/accd5782607e4782bf27917e800157d9/FLAGac9fae827 [2024-11-27 19:49:23,898 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:49:23,899 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/sv-benchmarks/c/termination-memory-alloca/b.02-alloca.i [2024-11-27 19:49:23,923 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/data/24fce4c2c/accd5782607e4782bf27917e800157d9/FLAGac9fae827 [2024-11-27 19:49:24,090 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/data/24fce4c2c/accd5782607e4782bf27917e800157d9 [2024-11-27 19:49:24,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:49:24,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:49:24,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:49:24,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:49:24,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:49:24,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b2b91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24, skipping insertion in model container [2024-11-27 19:49:24,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:49:24,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:49:24,473 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:49:24,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:49:24,551 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:49:24,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24 WrapperNode [2024-11-27 19:49:24,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:49:24,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:49:24,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:49:24,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:49:24,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,643 INFO L138 Inliner]: procedures = 111, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-27 19:49:24,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:49:24,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:49:24,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:49:24,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:49:24,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,687 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [4, 4, 2]. 40 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 [2, 2, 1]. [2024-11-27 19:49:24,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,694 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:49:24,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:49:24,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:49:24,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:49:24,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:49:24,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:49:24,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:49:24,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:49:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 19:49:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 19:49:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 19:49:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 19:49:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 19:49:24,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 19:49:24,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 19:49:24,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 19:49:24,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:49:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:49:24,931 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:49:24,933 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:49:25,227 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-27 19:49:25,227 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:49:25,241 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:49:25,241 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 19:49:25,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:49:25 BoogieIcfgContainer [2024-11-27 19:49:25,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:49:25,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:49:25,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:49:25,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:49:25,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:49:24" (1/3) ... [2024-11-27 19:49:25,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d46ddc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:49:25, skipping insertion in model container [2024-11-27 19:49:25,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (2/3) ... [2024-11-27 19:49:25,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d46ddc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:49:25, skipping insertion in model container [2024-11-27 19:49:25,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:49:25" (3/3) ... [2024-11-27 19:49:25,256 INFO L128 eAbstractionObserver]: Analyzing ICFG b.02-alloca.i [2024-11-27 19:49:25,274 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:49:25,276 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG b.02-alloca.i that has 1 procedures, 41 locations, 1 initial locations, 1 loop locations, and 21 error locations. [2024-11-27 19:49:25,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:49:25,343 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1a98bdd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:49:25,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-27 19:49:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 19 states have (on average 2.210526315789474) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-27 19:49:25,355 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:25,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-27 19:49:25,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-27 19:49:25,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:25,363 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-27 19:49:25,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:25,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408423799] [2024-11-27 19:49:25,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:25,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:49:25,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:25,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408423799] [2024-11-27 19:49:25,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408423799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:25,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:25,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:25,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350886705] [2024-11-27 19:49:25,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:25,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:25,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:25,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:25,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:25,877 INFO L87 Difference]: Start difference. First operand has 41 states, 19 states have (on average 2.210526315789474) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:25,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:25,974 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2024-11-27 19:49:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:25,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-27 19:49:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:25,985 INFO L225 Difference]: With dead ends: 37 [2024-11-27 19:49:25,985 INFO L226 Difference]: Without dead ends: 35 [2024-11-27 19:49:25,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:25,992 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:25,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 17 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:49:26,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-27 19:49:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-27 19:49:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 34 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-11-27 19:49:26,030 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 3 [2024-11-27 19:49:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:26,030 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2024-11-27 19:49:26,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:26,031 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-11-27 19:49:26,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-27 19:49:26,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:26,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-27 19:49:26,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 19:49:26,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-27 19:49:26,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:26,032 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-27 19:49:26,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:26,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63548617] [2024-11-27 19:49:26,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:26,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:49:26,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:26,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63548617] [2024-11-27 19:49:26,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63548617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:26,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:26,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:26,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954985238] [2024-11-27 19:49:26,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:26,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:26,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:26,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:26,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:26,286 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:26,337 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2024-11-27 19:49:26,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:26,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-27 19:49:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:26,339 INFO L225 Difference]: With dead ends: 31 [2024-11-27 19:49:26,339 INFO L226 Difference]: Without dead ends: 31 [2024-11-27 19:49:26,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:26,340 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:26,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 17 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:49:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-27 19:49:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-27 19:49:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2024-11-27 19:49:26,347 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 3 [2024-11-27 19:49:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:26,347 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2024-11-27 19:49:26,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2024-11-27 19:49:26,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-27 19:49:26,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:26,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-27 19:49:26,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 19:49:26,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-27 19:49:26,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:26,350 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2024-11-27 19:49:26,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:26,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910872798] [2024-11-27 19:49:26,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:26,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:49:26,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:26,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910872798] [2024-11-27 19:49:26,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910872798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:26,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:26,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:26,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336920775] [2024-11-27 19:49:26,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:26,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:26,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:26,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:26,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:26,464 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:26,542 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-11-27 19:49:26,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:26,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-27 19:49:26,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:26,545 INFO L225 Difference]: With dead ends: 27 [2024-11-27 19:49:26,545 INFO L226 Difference]: Without dead ends: 27 [2024-11-27 19:49:26,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:26,546 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:26,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 10 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:49:26,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-27 19:49:26,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-27 19:49:26,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.5) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-27 19:49:26,552 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 4 [2024-11-27 19:49:26,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:26,552 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-27 19:49:26,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:26,553 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-27 19:49:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-27 19:49:26,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:26,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-27 19:49:26,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 19:49:26,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-27 19:49:26,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:26,554 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2024-11-27 19:49:26,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:26,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455674043] [2024-11-27 19:49:26,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:26,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:49:26,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:26,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455674043] [2024-11-27 19:49:26,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455674043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:26,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:26,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:26,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970573690] [2024-11-27 19:49:26,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:26,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:26,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:26,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:26,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:26,666 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:26,700 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2024-11-27 19:49:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:26,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-27 19:49:26,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:26,701 INFO L225 Difference]: With dead ends: 23 [2024-11-27 19:49:26,701 INFO L226 Difference]: Without dead ends: 23 [2024-11-27 19:49:26,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:26,702 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:26,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 13 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:49:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-27 19:49:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-27 19:49:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-11-27 19:49:26,705 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 4 [2024-11-27 19:49:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:26,706 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-11-27 19:49:26,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-11-27 19:49:26,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-27 19:49:26,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:26,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-27 19:49:26,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 19:49:26,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-27 19:49:26,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:26,707 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2024-11-27 19:49:26,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:26,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998494435] [2024-11-27 19:49:26,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:26,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:49:26,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:26,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998494435] [2024-11-27 19:49:26,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998494435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:26,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:26,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:26,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587648056] [2024-11-27 19:49:26,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:26,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:26,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:26,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:26,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:26,797 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:26,846 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-11-27 19:49:26,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:26,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-27 19:49:26,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:26,847 INFO L225 Difference]: With dead ends: 21 [2024-11-27 19:49:26,847 INFO L226 Difference]: Without dead ends: 21 [2024-11-27 19:49:26,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:26,848 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:26,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 9 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:49:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-27 19:49:26,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-27 19:49:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-27 19:49:26,854 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 5 [2024-11-27 19:49:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:26,854 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-27 19:49:26,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-27 19:49:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-27 19:49:26,854 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:26,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-27 19:49:26,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 19:49:26,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-27 19:49:26,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:26,855 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2024-11-27 19:49:26,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:26,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193563911] [2024-11-27 19:49:26,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:26,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:49:26,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:26,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193563911] [2024-11-27 19:49:26,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193563911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:26,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:26,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:26,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962372910] [2024-11-27 19:49:26,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:26,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:26,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:26,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:26,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:26,969 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:27,001 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2024-11-27 19:49:27,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:27,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-27 19:49:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:27,003 INFO L225 Difference]: With dead ends: 19 [2024-11-27 19:49:27,003 INFO L226 Difference]: Without dead ends: 19 [2024-11-27 19:49:27,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:27,008 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:27,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:49:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-27 19:49:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-27 19:49:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2024-11-27 19:49:27,010 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 5 [2024-11-27 19:49:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:27,010 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2024-11-27 19:49:27,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2024-11-27 19:49:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-27 19:49:27,011 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:27,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:27,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 19:49:27,011 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-27 19:49:27,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:27,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1331143608, now seen corresponding path program 1 times [2024-11-27 19:49:27,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:27,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048593603] [2024-11-27 19:49:27,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:27,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:49:27,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:27,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048593603] [2024-11-27 19:49:27,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048593603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:27,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:27,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:49:27,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200824834] [2024-11-27 19:49:27,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:27,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:49:27,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:27,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:49:27,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:49:27,381 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:27,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:27,435 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-11-27 19:49:27,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:49:27,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-27 19:49:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:27,436 INFO L225 Difference]: With dead ends: 18 [2024-11-27 19:49:27,437 INFO L226 Difference]: Without dead ends: 0 [2024-11-27 19:49:27,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:49:27,438 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:27,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 11 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:49:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-27 19:49:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-27 19:49:27,442 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) [2024-11-27 19:49:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-27 19:49:27,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2024-11-27 19:49:27,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:27,443 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-27 19:49:27,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:49:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-27 19:49:27,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-27 19:49:27,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2024-11-27 19:49:27,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-27 19:49:27,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-27 19:49:27,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2024-11-27 19:49:27,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2024-11-27 19:49:27,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-27 19:49:27,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-27 19:49:27,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-27 19:49:27,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-27 19:49:27,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-27 19:49:27,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-27 19:49:27,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-27 19:49:27,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-27 19:49:27,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-27 19:49:27,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-27 19:49:27,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-27 19:49:27,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2024-11-27 19:49:27,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2024-11-27 19:49:27,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2024-11-27 19:49:27,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2024-11-27 19:49:27,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2024-11-27 19:49:27,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 19:49:27,456 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:27,459 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 19:49:27,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 07:49:27 BoogieIcfgContainer [2024-11-27 19:49:27,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 19:49:27,464 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 19:49:27,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 19:49:27,465 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 19:49:27,468 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:49:25" (3/4) ... [2024-11-27 19:49:27,471 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-27 19:49:27,482 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-27 19:49:27,482 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-27 19:49:27,482 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-27 19:49:27,483 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-27 19:49:27,581 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 19:49:27,581 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 19:49:27,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 19:49:27,583 INFO L158 Benchmark]: Toolchain (without parser) took 3488.52ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 87.0MB in the end (delta: 4.4MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2024-11-27 19:49:27,584 INFO L158 Benchmark]: CDTParser took 1.50ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 72.6MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:49:27,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.21ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 75.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 19:49:27,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.75ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 73.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:49:27,586 INFO L158 Benchmark]: Boogie Preprocessor took 65.86ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 71.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:49:27,586 INFO L158 Benchmark]: RCFGBuilder took 527.83ms. Allocated memory is still 117.4MB. Free memory was 71.9MB in the beginning and 58.1MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 19:49:27,586 INFO L158 Benchmark]: TraceAbstraction took 2218.42ms. Allocated memory is still 117.4MB. Free memory was 57.7MB in the beginning and 32.6MB in the end (delta: 25.1MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-11-27 19:49:27,587 INFO L158 Benchmark]: Witness Printer took 117.09ms. Allocated memory is still 117.4MB. Free memory was 32.6MB in the beginning and 87.0MB in the end (delta: -54.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 19:49:27,588 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.50ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 72.6MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.21ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 75.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.75ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 73.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.86ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 71.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 527.83ms. Allocated memory is still 117.4MB. Free memory was 71.9MB in the beginning and 58.1MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2218.42ms. Allocated memory is still 117.4MB. Free memory was 57.7MB in the beginning and 32.6MB in the end (delta: 25.1MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Witness Printer took 117.09ms. Allocated memory is still 117.4MB. Free memory was 32.6MB in the beginning and 87.0MB in the end (delta: -54.4MB). Peak memory consumption was 8.4MB. 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: 561]: 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, 41 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 142 IncrementalHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 77 mSDtfsCounter, 142 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 297 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-27 19:49:27,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b840b99d-a2b6-444a-9dba-b0a71969d351/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE