./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX --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 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:04:56,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:04:56,843 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-08 19:04:56,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:04:56,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:04:56,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:04:56,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:04:56,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:04:56,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:04:56,893 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:04:56,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:04:56,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:04:56,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:04:56,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:04:56,897 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:04:56,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:04:56,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:04:56,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:04:56,899 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 19:04:56,900 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 19:04:56,900 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 19:04:56,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:04:56,905 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:04:56,906 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:04:56,906 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 19:04:56,906 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:04:56,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:04:56,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:04:56,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:04:56,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:04:56,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:04:56,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:04:56,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:04:56,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:04:56,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:04:56,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:04:56,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:04:56,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:04:56,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:04:56,912 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_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/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_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX 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 -> 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c [2024-11-08 19:04:57,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:04:57,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:04:57,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:04:57,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:04:57,255 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:04:57,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i Unable to find full path for "g++" [2024-11-08 19:04:59,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:04:59,714 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:04:59,715 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2024-11-08 19:04:59,730 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/data/60e04ece2/4e6d9f6d60ff4f34883334b06c73f415/FLAG5205c4c11 [2024-11-08 19:04:59,986 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/data/60e04ece2/4e6d9f6d60ff4f34883334b06c73f415 [2024-11-08 19:04:59,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:04:59,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:04:59,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:04:59,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:05:00,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:05:00,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:04:59" (1/1) ... [2024-11-08 19:05:00,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3839ad0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:00, skipping insertion in model container [2024-11-08 19:05:00,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:04:59" (1/1) ... [2024-11-08 19:05:00,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:05:00,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:05:00,511 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:05:00,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:05:00,614 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:05:00,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:00 WrapperNode [2024-11-08 19:05:00,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:05:00,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:05:00,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:05:00,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:05:00,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:00" (1/1) ... [2024-11-08 19:05:00,653 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:00" (1/1) ... [2024-11-08 19:05:00,680 INFO L138 Inliner]: procedures = 111, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 11 [2024-11-08 19:05:00,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:05:00,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:05:00,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:05:00,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:05:00,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:00" (1/1) ... [2024-11-08 19:05:00,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:00" (1/1) ... [2024-11-08 19:05:00,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:00" (1/1) ... [2024-11-08 19:05:00,726 INFO L175 MemorySlicer]: Split 21 memory accesses to 5 slices as follows [3, 6, 3, 5, 4]. 29 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0, 0]. The 10 writes are split as follows [1, 3, 1, 3, 2]. [2024-11-08 19:05:00,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:00" (1/1) ... [2024-11-08 19:05:00,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:00" (1/1) ... [2024-11-08 19:05:00,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:00" (1/1) ... [2024-11-08 19:05:00,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:00" (1/1) ... [2024-11-08 19:05:00,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:00" (1/1) ... [2024-11-08 19:05:00,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:00" (1/1) ... [2024-11-08 19:05:00,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:05:00,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:05:00,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:05:00,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:05:00,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:00" (1/1) ... [2024-11-08 19:05:00,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:05:00,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:05:00,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:05:00,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:05:00,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 19:05:00,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 19:05:00,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 19:05:00,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 19:05:00,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 19:05:00,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 19:05:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 19:05:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 19:05:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 19:05:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 19:05:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-08 19:05:00,881 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-08 19:05:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 19:05:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 19:05:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:05:00,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:05:01,086 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:05:01,089 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:05:01,553 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-08 19:05:01,554 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:05:01,571 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:05:01,571 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 19:05:01,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:05:01 BoogieIcfgContainer [2024-11-08 19:05:01,572 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:05:01,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:05:01,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:05:01,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:05:01,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:04:59" (1/3) ... [2024-11-08 19:05:01,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a135bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:05:01, skipping insertion in model container [2024-11-08 19:05:01,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:00" (2/3) ... [2024-11-08 19:05:01,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a135bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:05:01, skipping insertion in model container [2024-11-08 19:05:01,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:05:01" (3/3) ... [2024-11-08 19:05:01,601 INFO L112 eAbstractionObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2024-11-08 19:05:01,639 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:05:01,639 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2024-11-08 19:05:01,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:05:01,709 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;@21fdc82e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:05:01,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2024-11-08 19:05:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 85 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 19:05:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 19:05:01,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:01,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 19:05:01,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-08 19:05:01,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:01,740 INFO L85 PathProgramCache]: Analyzing trace with hash -121694098, now seen corresponding path program 1 times [2024-11-08 19:05:01,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:01,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709875628] [2024-11-08 19:05:01,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:01,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:02,577 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-08 19:05:02,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:02,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709875628] [2024-11-08 19:05:02,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709875628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:02,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:02,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:05:02,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803679625] [2024-11-08 19:05:02,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:02,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:05:02,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:02,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:05:02,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:05:02,644 INFO L87 Difference]: Start difference. First operand has 88 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 85 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:02,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:02,811 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2024-11-08 19:05:02,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:05:02,818 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 19:05:02,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:02,830 INFO L225 Difference]: With dead ends: 85 [2024-11-08 19:05:02,831 INFO L226 Difference]: Without dead ends: 83 [2024-11-08 19:05:02,833 INFO L431 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-08 19:05:02,837 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 73 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:02,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 55 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-08 19:05:02,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-08 19:05:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 40 states have (on average 2.125) internal successors, (85), 80 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 19:05:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-08 19:05:02,899 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 6 [2024-11-08 19:05:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:02,900 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-08 19:05:02,901 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-11-08 19:05:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 19:05:02,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:02,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 19:05:02,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:05:02,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-08 19:05:02,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:02,904 INFO L85 PathProgramCache]: Analyzing trace with hash -121694097, now seen corresponding path program 1 times [2024-11-08 19:05:02,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:02,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650378912] [2024-11-08 19:05:02,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:02,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:03,367 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-08 19:05:03,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:03,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650378912] [2024-11-08 19:05:03,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650378912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:03,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:03,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:05:03,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272648111] [2024-11-08 19:05:03,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:03,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:05:03,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:03,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:05:03,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:05:03,374 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:03,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:03,513 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-11-08 19:05:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:05:03,515 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 19:05:03,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:03,516 INFO L225 Difference]: With dead ends: 80 [2024-11-08 19:05:03,516 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 19:05:03,517 INFO L431 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-08 19:05:03,519 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:03,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 54 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 19:05:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-08 19:05:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 40 states have (on average 2.05) internal successors, (82), 77 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 19:05:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-08 19:05:03,540 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 6 [2024-11-08 19:05:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:03,540 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-08 19:05:03,540 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:03,541 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-08 19:05:03,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 19:05:03,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:03,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:03,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:05:03,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-08 19:05:03,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:03,546 INFO L85 PathProgramCache]: Analyzing trace with hash 522450232, now seen corresponding path program 1 times [2024-11-08 19:05:03,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:03,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960093107] [2024-11-08 19:05:03,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:03,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:03,762 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-08 19:05:03,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:03,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960093107] [2024-11-08 19:05:03,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960093107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:03,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:03,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:05:03,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966916490] [2024-11-08 19:05:03,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:03,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:05:03,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:03,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:05:03,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:05:03,768 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:03,912 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2024-11-08 19:05:03,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:05:03,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-08 19:05:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:03,914 INFO L225 Difference]: With dead ends: 76 [2024-11-08 19:05:03,914 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 19:05:03,915 INFO L431 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-08 19:05:03,916 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:03,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 19:05:03,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-08 19:05:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 40 states have (on average 1.95) internal successors, (78), 73 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 19:05:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2024-11-08 19:05:03,926 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 7 [2024-11-08 19:05:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:03,926 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2024-11-08 19:05:03,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2024-11-08 19:05:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 19:05:03,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:03,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:03,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:05:03,928 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-08 19:05:03,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:03,929 INFO L85 PathProgramCache]: Analyzing trace with hash 522450233, now seen corresponding path program 1 times [2024-11-08 19:05:03,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:03,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254986586] [2024-11-08 19:05:03,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:03,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:04,103 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-08 19:05:04,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:04,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254986586] [2024-11-08 19:05:04,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254986586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:04,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:04,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:05:04,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349897680] [2024-11-08 19:05:04,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:04,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:05:04,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:04,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:05:04,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:05:04,108 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:04,206 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-11-08 19:05:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:05:04,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-08 19:05:04,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:04,209 INFO L225 Difference]: With dead ends: 72 [2024-11-08 19:05:04,211 INFO L226 Difference]: Without dead ends: 72 [2024-11-08 19:05:04,212 INFO L431 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-08 19:05:04,213 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:04,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-08 19:05:04,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-08 19:05:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 40 states have (on average 1.85) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 19:05:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-11-08 19:05:04,233 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 7 [2024-11-08 19:05:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:04,235 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-11-08 19:05:04,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-11-08 19:05:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:05:04,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:04,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:04,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:05:04,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-08 19:05:04,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:04,240 INFO L85 PathProgramCache]: Analyzing trace with hash -983912015, now seen corresponding path program 1 times [2024-11-08 19:05:04,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:04,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661262943] [2024-11-08 19:05:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:04,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:04,392 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-08 19:05:04,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:04,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661262943] [2024-11-08 19:05:04,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661262943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:04,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:04,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:05:04,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907695276] [2024-11-08 19:05:04,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:04,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:05:04,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:04,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:05:04,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:05:04,396 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:04,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:04,492 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2024-11-08 19:05:04,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:05:04,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-08 19:05:04,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:04,494 INFO L225 Difference]: With dead ends: 67 [2024-11-08 19:05:04,495 INFO L226 Difference]: Without dead ends: 67 [2024-11-08 19:05:04,495 INFO L431 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-08 19:05:04,496 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 53 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:04,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 43 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:04,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-08 19:05:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-08 19:05:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.725) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 19:05:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2024-11-08 19:05:04,504 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 8 [2024-11-08 19:05:04,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:04,504 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2024-11-08 19:05:04,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2024-11-08 19:05:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:05:04,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:04,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:04,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:05:04,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-08 19:05:04,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash -983912014, now seen corresponding path program 1 times [2024-11-08 19:05:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:04,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509287922] [2024-11-08 19:05:04,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:04,714 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-08 19:05:04,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:04,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509287922] [2024-11-08 19:05:04,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509287922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:04,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:04,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:05:04,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877062573] [2024-11-08 19:05:04,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:04,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:05:04,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:04,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:05:04,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:05:04,719 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:04,821 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2024-11-08 19:05:04,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:05:04,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-08 19:05:04,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:04,824 INFO L225 Difference]: With dead ends: 62 [2024-11-08 19:05:04,824 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 19:05:04,825 INFO L431 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-08 19:05:04,830 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 56 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:04,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 45 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 19:05:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-08 19:05:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.6) internal successors, (64), 59 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 19:05:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-11-08 19:05:04,844 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 8 [2024-11-08 19:05:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:04,844 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-11-08 19:05:04,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-11-08 19:05:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 19:05:04,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:04,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:04,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:05:04,846 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-08 19:05:04,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:04,847 INFO L85 PathProgramCache]: Analyzing trace with hash -436501413, now seen corresponding path program 1 times [2024-11-08 19:05:04,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:04,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165313824] [2024-11-08 19:05:04,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:04,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:04,961 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-08 19:05:04,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:04,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165313824] [2024-11-08 19:05:04,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165313824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:04,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:04,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:05:04,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212786809] [2024-11-08 19:05:04,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:04,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:05:04,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:04,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:05:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:05:04,965 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:05,044 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2024-11-08 19:05:05,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:05:05,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-08 19:05:05,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:05,046 INFO L225 Difference]: With dead ends: 59 [2024-11-08 19:05:05,046 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 19:05:05,047 INFO L431 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-08 19:05:05,047 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:05,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 40 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 19:05:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 19:05:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.525) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 19:05:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-11-08 19:05:05,060 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 9 [2024-11-08 19:05:05,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:05,060 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-08 19:05:05,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-11-08 19:05:05,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 19:05:05,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:05,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:05,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:05:05,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-08 19:05:05,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:05,062 INFO L85 PathProgramCache]: Analyzing trace with hash -436501412, now seen corresponding path program 1 times [2024-11-08 19:05:05,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:05,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513230280] [2024-11-08 19:05:05,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:05,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:05,219 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-08 19:05:05,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:05,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513230280] [2024-11-08 19:05:05,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513230280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:05,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:05,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:05:05,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406351483] [2024-11-08 19:05:05,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:05,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:05:05,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:05,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:05:05,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:05:05,224 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:05,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:05,296 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-11-08 19:05:05,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:05:05,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-08 19:05:05,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:05,298 INFO L225 Difference]: With dead ends: 56 [2024-11-08 19:05:05,298 INFO L226 Difference]: Without dead ends: 56 [2024-11-08 19:05:05,298 INFO L431 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-08 19:05:05,299 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 49 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:05,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 42 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-08 19:05:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-08 19:05:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 19:05:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-08 19:05:05,315 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 9 [2024-11-08 19:05:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:05,315 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-08 19:05:05,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-08 19:05:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 19:05:05,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:05,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:05,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:05:05,317 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-08 19:05:05,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:05,318 INFO L85 PathProgramCache]: Analyzing trace with hash -646641932, now seen corresponding path program 1 times [2024-11-08 19:05:05,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:05,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923526694] [2024-11-08 19:05:05,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:05,439 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-08 19:05:05,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:05,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923526694] [2024-11-08 19:05:05,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923526694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:05,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:05,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:05:05,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24268258] [2024-11-08 19:05:05,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:05,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:05:05,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:05,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:05:05,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:05:05,446 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:05,539 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2024-11-08 19:05:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:05:05,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-08 19:05:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:05,540 INFO L225 Difference]: With dead ends: 50 [2024-11-08 19:05:05,541 INFO L226 Difference]: Without dead ends: 50 [2024-11-08 19:05:05,541 INFO L431 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-08 19:05:05,542 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:05,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 34 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:05,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-08 19:05:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-08 19:05:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 19:05:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-08 19:05:05,555 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 10 [2024-11-08 19:05:05,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:05,555 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-08 19:05:05,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:05,557 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-08 19:05:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 19:05:05,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:05,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:05,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 19:05:05,558 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-08 19:05:05,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:05,559 INFO L85 PathProgramCache]: Analyzing trace with hash -646641931, now seen corresponding path program 1 times [2024-11-08 19:05:05,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:05,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272054861] [2024-11-08 19:05:05,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:05,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:05,667 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-08 19:05:05,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:05,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272054861] [2024-11-08 19:05:05,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272054861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:05,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:05,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:05:05,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521976552] [2024-11-08 19:05:05,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:05,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:05:05,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:05,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:05:05,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:05:05,673 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:05,740 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-11-08 19:05:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:05:05,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-08 19:05:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:05,741 INFO L225 Difference]: With dead ends: 44 [2024-11-08 19:05:05,742 INFO L226 Difference]: Without dead ends: 44 [2024-11-08 19:05:05,742 INFO L431 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-08 19:05:05,743 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 36 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:05,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 36 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:05,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-08 19:05:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-08 19:05:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 19:05:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-08 19:05:05,749 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 10 [2024-11-08 19:05:05,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:05,750 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-08 19:05:05,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-08 19:05:05,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 19:05:05,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:05,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:05,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 19:05:05,752 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-08 19:05:05,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:05,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1537930894, now seen corresponding path program 1 times [2024-11-08 19:05:05,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:05,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975974885] [2024-11-08 19:05:05,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:05,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:05,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:05:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:05,971 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-08 19:05:05,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:05,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975974885] [2024-11-08 19:05:05,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975974885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:05,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:05,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:05:05,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433595572] [2024-11-08 19:05:05,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:05,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:05:05,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:05,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:05:05,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:05:05,977 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 19:05:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:06,101 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-11-08 19:05:06,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:05:06,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-08 19:05:06,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:06,102 INFO L225 Difference]: With dead ends: 44 [2024-11-08 19:05:06,103 INFO L226 Difference]: Without dead ends: 44 [2024-11-08 19:05:06,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:05:06,104 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 34 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:06,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 118 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:06,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-08 19:05:06,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-08 19:05:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 19:05:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-11-08 19:05:06,113 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 15 [2024-11-08 19:05:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:06,113 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-11-08 19:05:06,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 19:05:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-11-08 19:05:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:05:06,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:06,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:06,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 19:05:06,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-08 19:05:06,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:06,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1614881014, now seen corresponding path program 1 times [2024-11-08 19:05:06,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:06,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541140503] [2024-11-08 19:05:06,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:06,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:06,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:05:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:06,502 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-08 19:05:06,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:06,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541140503] [2024-11-08 19:05:06,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541140503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:06,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:06,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:05:06,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888503730] [2024-11-08 19:05:06,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:06,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:05:06,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:06,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:05:06,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:05:06,506 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 19:05:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:06,644 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2024-11-08 19:05:06,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:05:06,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-08 19:05:06,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:06,647 INFO L225 Difference]: With dead ends: 61 [2024-11-08 19:05:06,647 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 19:05:06,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:05:06,648 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:06,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 170 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 19:05:06,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-11-08 19:05:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 19:05:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2024-11-08 19:05:06,657 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 23 [2024-11-08 19:05:06,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:06,658 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-11-08 19:05:06,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 19:05:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-11-08 19:05:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 19:05:06,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:06,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:06,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 19:05:06,660 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-08 19:05:06,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:06,661 INFO L85 PathProgramCache]: Analyzing trace with hash 139450797, now seen corresponding path program 1 times [2024-11-08 19:05:06,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:06,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727407502] [2024-11-08 19:05:06,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:06,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:06,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:05:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:06,964 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-08 19:05:06,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:06,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727407502] [2024-11-08 19:05:06,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727407502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:06,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:06,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:05:06,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375934786] [2024-11-08 19:05:06,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:06,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:05:06,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:06,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:05:06,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:05:06,967 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 19:05:07,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:07,092 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-11-08 19:05:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:05:07,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-08 19:05:07,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:07,094 INFO L225 Difference]: With dead ends: 70 [2024-11-08 19:05:07,094 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 19:05:07,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:05:07,095 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:07,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 172 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 19:05:07,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2024-11-08 19:05:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 19:05:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-11-08 19:05:07,100 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 25 [2024-11-08 19:05:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:07,101 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-11-08 19:05:07,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 19:05:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-11-08 19:05:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 19:05:07,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:07,103 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:07,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 19:05:07,104 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-08 19:05:07,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash -50447335, now seen corresponding path program 1 times [2024-11-08 19:05:07,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:07,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440322515] [2024-11-08 19:05:07,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:07,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:07,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:05:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 19:05:08,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:08,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440322515] [2024-11-08 19:05:08,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440322515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:08,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:08,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:05:08,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927712159] [2024-11-08 19:05:08,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:08,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:05:08,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:08,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:05:08,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:05:08,545 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 19:05:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:08,712 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2024-11-08 19:05:08,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:05:08,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-08 19:05:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:08,714 INFO L225 Difference]: With dead ends: 60 [2024-11-08 19:05:08,714 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 19:05:08,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:05:08,715 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:08,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 80 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:05:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 19:05:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 19:05:08,716 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-08 19:05:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 19:05:08,719 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2024-11-08 19:05:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:08,720 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 19:05:08,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 19:05:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 19:05:08,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 19:05:08,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 43 remaining) [2024-11-08 19:05:08,724 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 43 remaining) [2024-11-08 19:05:08,725 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 43 remaining) [2024-11-08 19:05:08,725 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 43 remaining) [2024-11-08 19:05:08,725 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 43 remaining) [2024-11-08 19:05:08,726 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 43 remaining) [2024-11-08 19:05:08,726 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 43 remaining) [2024-11-08 19:05:08,726 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 43 remaining) [2024-11-08 19:05:08,726 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 43 remaining) [2024-11-08 19:05:08,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 43 remaining) [2024-11-08 19:05:08,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 43 remaining) [2024-11-08 19:05:08,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 43 remaining) [2024-11-08 19:05:08,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 43 remaining) [2024-11-08 19:05:08,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 43 remaining) [2024-11-08 19:05:08,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 43 remaining) [2024-11-08 19:05:08,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 43 remaining) [2024-11-08 19:05:08,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 43 remaining) [2024-11-08 19:05:08,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 43 remaining) [2024-11-08 19:05:08,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 43 remaining) [2024-11-08 19:05:08,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 43 remaining) [2024-11-08 19:05:08,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 43 remaining) [2024-11-08 19:05:08,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 43 remaining) [2024-11-08 19:05:08,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 43 remaining) [2024-11-08 19:05:08,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 43 remaining) [2024-11-08 19:05:08,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 43 remaining) [2024-11-08 19:05:08,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 43 remaining) [2024-11-08 19:05:08,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 43 remaining) [2024-11-08 19:05:08,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 43 remaining) [2024-11-08 19:05:08,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 43 remaining) [2024-11-08 19:05:08,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 43 remaining) [2024-11-08 19:05:08,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 43 remaining) [2024-11-08 19:05:08,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 43 remaining) [2024-11-08 19:05:08,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 43 remaining) [2024-11-08 19:05:08,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 43 remaining) [2024-11-08 19:05:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 43 remaining) [2024-11-08 19:05:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 43 remaining) [2024-11-08 19:05:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 43 remaining) [2024-11-08 19:05:08,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 43 remaining) [2024-11-08 19:05:08,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 43 remaining) [2024-11-08 19:05:08,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 43 remaining) [2024-11-08 19:05:08,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 43 remaining) [2024-11-08 19:05:08,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 43 remaining) [2024-11-08 19:05:08,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 43 remaining) [2024-11-08 19:05:08,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 19:05:08,743 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:08,748 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:05:08,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:05:08 BoogieIcfgContainer [2024-11-08 19:05:08,754 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:05:08,755 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:05:08,755 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:05:08,755 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:05:08,756 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:05:01" (3/4) ... [2024-11-08 19:05:08,759 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 19:05:08,765 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2024-11-08 19:05:08,775 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-11-08 19:05:08,775 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-08 19:05:08,776 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 19:05:08,776 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 19:05:08,922 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 19:05:08,923 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/witness.yml [2024-11-08 19:05:08,923 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:05:08,924 INFO L158 Benchmark]: Toolchain (without parser) took 8932.98ms. Allocated memory was 144.7MB in the beginning and 234.9MB in the end (delta: 90.2MB). Free memory was 111.0MB in the beginning and 203.2MB in the end (delta: -92.2MB). Peak memory consumption was 137.8MB. Max. memory is 16.1GB. [2024-11-08 19:05:08,924 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:05:08,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.34ms. Allocated memory is still 144.7MB. Free memory was 110.7MB in the beginning and 92.2MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 19:05:08,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.40ms. Allocated memory is still 144.7MB. Free memory was 92.2MB in the beginning and 90.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:05:08,925 INFO L158 Benchmark]: Boogie Preprocessor took 82.04ms. Allocated memory is still 144.7MB. Free memory was 90.5MB in the beginning and 88.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:05:08,925 INFO L158 Benchmark]: RCFGBuilder took 807.51ms. Allocated memory is still 144.7MB. Free memory was 88.0MB in the beginning and 112.2MB in the end (delta: -24.2MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-11-08 19:05:08,926 INFO L158 Benchmark]: TraceAbstraction took 7163.22ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 164.5MB in the beginning and 71.2MB in the end (delta: 93.4MB). Peak memory consumption was 132.0MB. Max. memory is 16.1GB. [2024-11-08 19:05:08,926 INFO L158 Benchmark]: Witness Printer took 168.70ms. Allocated memory is still 234.9MB. Free memory was 71.2MB in the beginning and 203.2MB in the end (delta: -132.0MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-11-08 19:05:08,928 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.30ms. Allocated memory is still 109.1MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.34ms. Allocated memory is still 144.7MB. Free memory was 110.7MB in the beginning and 92.2MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.40ms. Allocated memory is still 144.7MB. Free memory was 92.2MB in the beginning and 90.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 82.04ms. Allocated memory is still 144.7MB. Free memory was 90.5MB in the beginning and 88.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 807.51ms. Allocated memory is still 144.7MB. Free memory was 88.0MB in the beginning and 112.2MB in the end (delta: -24.2MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7163.22ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 164.5MB in the beginning and 71.2MB in the end (delta: 93.4MB). Peak memory consumption was 132.0MB. Max. memory is 16.1GB. * Witness Printer took 168.70ms. Allocated memory is still 234.9MB. Free memory was 71.2MB in the beginning and 203.2MB in the end (delta: -132.0MB). Peak memory consumption was 7.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: -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: 577]: 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 2 procedures, 88 locations, 43 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 639 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 639 mSDsluCounter, 987 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 458 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 661 IncrementalHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 529 mSDtfsCounter, 661 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 2201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 6/6 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 43 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-08 19:05:08,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71c2560-652a-4104-b273-f0793bce469e/bin/uautomizer-verify-jihMAELWvX/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