./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:23:56,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:23:56,912 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 14:23:56,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:23:56,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:23:56,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:23:56,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:23:56,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:23:56,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:23:56,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:23:56,946 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:23:56,947 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:23:56,947 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:23:56,948 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 14:23:56,948 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:23:56,949 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:23:56,949 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 14:23:56,950 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 14:23:56,950 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:23:56,951 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 14:23:56,951 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 14:23:56,952 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 14:23:56,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 14:23:56,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 14:23:56,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:23:56,954 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:23:56,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:23:56,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:23:56,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:23:56,956 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 14:23:56,956 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 14:23:56,956 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 14:23:56,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:23:56,957 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 14:23:56,957 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 14:23:56,958 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:23:56,958 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:23:56,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:23:56,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:23:56,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:23:56,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:23:56,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:23:56,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:23:56,960 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 14:23:56,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 14:23:56,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:23:56,960 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:23:56,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:23:56,961 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/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_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 [2023-12-02 14:23:57,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:23:57,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:23:57,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:23:57,207 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:23:57,208 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:23:57,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-12-02 14:23:59,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:24:00,157 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:24:00,158 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-12-02 14:24:00,177 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/data/b5df4e0a3/09d68232f44c46c7b77db25bcb6e1998/FLAGef39557f3 [2023-12-02 14:24:00,190 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/data/b5df4e0a3/09d68232f44c46c7b77db25bcb6e1998 [2023-12-02 14:24:00,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:24:00,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:24:00,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:24:00,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:24:00,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:24:00,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:24:00" (1/1) ... [2023-12-02 14:24:00,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f00e1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:00, skipping insertion in model container [2023-12-02 14:24:00,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:24:00" (1/1) ... [2023-12-02 14:24:00,252 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:24:00,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:24:00,580 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:24:00,638 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:24:00,673 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 14:24:00,673 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 14:24:00,681 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:24:00,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:00 WrapperNode [2023-12-02 14:24:00,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:24:00,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:24:00,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:24:00,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:24:00,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:00" (1/1) ... [2023-12-02 14:24:00,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:00" (1/1) ... [2023-12-02 14:24:00,731 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2023-12-02 14:24:00,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:24:00,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:24:00,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:24:00,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:24:00,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:00" (1/1) ... [2023-12-02 14:24:00,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:00" (1/1) ... [2023-12-02 14:24:00,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:00" (1/1) ... [2023-12-02 14:24:00,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:00" (1/1) ... [2023-12-02 14:24:00,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:00" (1/1) ... [2023-12-02 14:24:00,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:00" (1/1) ... [2023-12-02 14:24:00,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:00" (1/1) ... [2023-12-02 14:24:00,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:00" (1/1) ... [2023-12-02 14:24:00,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:24:00,769 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:24:00,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:24:00,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:24:00,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:00" (1/1) ... [2023-12-02 14:24:00,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:24:00,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:24:00,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 14:24:00,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 14:24:00,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 14:24:00,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 14:24:00,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 14:24:00,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 14:24:00,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 14:24:00,834 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-02 14:24:00,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-02 14:24:00,834 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-02 14:24:00,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-02 14:24:00,834 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-02 14:24:00,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-02 14:24:00,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 14:24:00,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 14:24:00,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:24:00,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:24:00,837 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 14:24:00,967 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:24:00,969 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:24:01,281 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:24:01,447 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:24:01,447 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 14:24:01,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:24:01 BoogieIcfgContainer [2023-12-02 14:24:01,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:24:01,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:24:01,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:24:01,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:24:01,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:24:00" (1/3) ... [2023-12-02 14:24:01,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d921f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:24:01, skipping insertion in model container [2023-12-02 14:24:01,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:00" (2/3) ... [2023-12-02 14:24:01,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d921f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:24:01, skipping insertion in model container [2023-12-02 14:24:01,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:24:01" (3/3) ... [2023-12-02 14:24:01,457 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-12-02 14:24:01,476 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:24:01,476 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-12-02 14:24:01,476 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 14:24:01,523 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 14:24:01,553 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 54 transitions, 120 flow [2023-12-02 14:24:01,951 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6805 states, 6792 states have (on average 3.6223498233215548) internal successors, (24603), 6804 states have internal predecessors, (24603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:01,976 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:24:01,983 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@40a61bbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:24:01,983 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-12-02 14:24:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 6805 states, 6792 states have (on average 3.6223498233215548) internal successors, (24603), 6804 states have internal predecessors, (24603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 14:24:02,013 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:02,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 14:24:02,014 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:02,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:02,020 INFO L85 PathProgramCache]: Analyzing trace with hash 12212, now seen corresponding path program 1 times [2023-12-02 14:24:02,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:02,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664206704] [2023-12-02 14:24:02,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:02,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:02,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:02,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664206704] [2023-12-02 14:24:02,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664206704] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:02,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:02,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 14:24:02,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536392834] [2023-12-02 14:24:02,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:02,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:24:02,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:02,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:24:02,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:02,325 INFO L87 Difference]: Start difference. First operand has 6805 states, 6792 states have (on average 3.6223498233215548) internal successors, (24603), 6804 states have internal predecessors, (24603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:02,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:02,535 INFO L93 Difference]: Finished difference Result 6356 states and 22090 transitions. [2023-12-02 14:24:02,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:24:02,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 14:24:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:02,621 INFO L225 Difference]: With dead ends: 6356 [2023-12-02 14:24:02,621 INFO L226 Difference]: Without dead ends: 6356 [2023-12-02 14:24:02,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:02,626 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:02,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 32 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:02,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6356 states. [2023-12-02 14:24:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6356 to 6356. [2023-12-02 14:24:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6356 states, 6344 states have (on average 3.48203026481715) internal successors, (22090), 6355 states have internal predecessors, (22090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6356 states to 6356 states and 22090 transitions. [2023-12-02 14:24:03,089 INFO L78 Accepts]: Start accepts. Automaton has 6356 states and 22090 transitions. Word has length 2 [2023-12-02 14:24:03,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:03,090 INFO L495 AbstractCegarLoop]: Abstraction has 6356 states and 22090 transitions. [2023-12-02 14:24:03,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 6356 states and 22090 transitions. [2023-12-02 14:24:03,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 14:24:03,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:03,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 14:24:03,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 14:24:03,092 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:03,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:03,093 INFO L85 PathProgramCache]: Analyzing trace with hash 12213, now seen corresponding path program 1 times [2023-12-02 14:24:03,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:03,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681476362] [2023-12-02 14:24:03,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:03,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:03,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:03,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681476362] [2023-12-02 14:24:03,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681476362] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:03,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:03,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 14:24:03,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32878721] [2023-12-02 14:24:03,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:03,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:24:03,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:03,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:24:03,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:03,212 INFO L87 Difference]: Start difference. First operand 6356 states and 22090 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:03,376 INFO L93 Difference]: Finished difference Result 6355 states and 22089 transitions. [2023-12-02 14:24:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:24:03,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 14:24:03,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:03,448 INFO L225 Difference]: With dead ends: 6355 [2023-12-02 14:24:03,448 INFO L226 Difference]: Without dead ends: 6355 [2023-12-02 14:24:03,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:03,450 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:03,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 33 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2023-12-02 14:24:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 6355. [2023-12-02 14:24:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6355 states, 6344 states have (on average 3.4818726355611602) internal successors, (22089), 6354 states have internal predecessors, (22089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6355 states to 6355 states and 22089 transitions. [2023-12-02 14:24:03,768 INFO L78 Accepts]: Start accepts. Automaton has 6355 states and 22089 transitions. Word has length 2 [2023-12-02 14:24:03,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:03,768 INFO L495 AbstractCegarLoop]: Abstraction has 6355 states and 22089 transitions. [2023-12-02 14:24:03,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:03,769 INFO L276 IsEmpty]: Start isEmpty. Operand 6355 states and 22089 transitions. [2023-12-02 14:24:03,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 14:24:03,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:03,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 14:24:03,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 14:24:03,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:03,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash 364175696, now seen corresponding path program 1 times [2023-12-02 14:24:03,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:03,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693307838] [2023-12-02 14:24:03,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:03,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:03,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:03,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693307838] [2023-12-02 14:24:03,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693307838] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:03,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:03,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:24:03,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132455248] [2023-12-02 14:24:03,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:03,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:24:03,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:03,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:24:03,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:03,835 INFO L87 Difference]: Start difference. First operand 6355 states and 22089 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:04,022 INFO L93 Difference]: Finished difference Result 6347 states and 22074 transitions. [2023-12-02 14:24:04,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:24:04,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 14:24:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:04,064 INFO L225 Difference]: With dead ends: 6347 [2023-12-02 14:24:04,064 INFO L226 Difference]: Without dead ends: 6347 [2023-12-02 14:24:04,064 INFO L412 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 [2023-12-02 14:24:04,066 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:04,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 37 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:04,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6347 states. [2023-12-02 14:24:04,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6347 to 6347. [2023-12-02 14:24:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6347 states, 6337 states have (on average 3.4833517437273156) internal successors, (22074), 6346 states have internal predecessors, (22074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6347 states to 6347 states and 22074 transitions. [2023-12-02 14:24:04,281 INFO L78 Accepts]: Start accepts. Automaton has 6347 states and 22074 transitions. Word has length 5 [2023-12-02 14:24:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:04,282 INFO L495 AbstractCegarLoop]: Abstraction has 6347 states and 22074 transitions. [2023-12-02 14:24:04,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 6347 states and 22074 transitions. [2023-12-02 14:24:04,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 14:24:04,282 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:04,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 14:24:04,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 14:24:04,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:04,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:04,284 INFO L85 PathProgramCache]: Analyzing trace with hash 364175697, now seen corresponding path program 1 times [2023-12-02 14:24:04,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:04,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136160869] [2023-12-02 14:24:04,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:04,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:04,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:04,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136160869] [2023-12-02 14:24:04,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136160869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:04,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:04,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:24:04,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415520479] [2023-12-02 14:24:04,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:04,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:24:04,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:04,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:24:04,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:04,363 INFO L87 Difference]: Start difference. First operand 6347 states and 22074 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:04,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:04,544 INFO L93 Difference]: Finished difference Result 6339 states and 22059 transitions. [2023-12-02 14:24:04,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:24:04,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 14:24:04,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:04,593 INFO L225 Difference]: With dead ends: 6339 [2023-12-02 14:24:04,593 INFO L226 Difference]: Without dead ends: 6339 [2023-12-02 14:24:04,594 INFO L412 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 [2023-12-02 14:24:04,595 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 36 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 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 [2023-12-02 14:24:04,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6339 states. [2023-12-02 14:24:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6339 to 6339. [2023-12-02 14:24:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6339 states, 6330 states have (on average 3.4848341232227487) internal successors, (22059), 6338 states have internal predecessors, (22059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 22059 transitions. [2023-12-02 14:24:04,953 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 22059 transitions. Word has length 5 [2023-12-02 14:24:04,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:04,954 INFO L495 AbstractCegarLoop]: Abstraction has 6339 states and 22059 transitions. [2023-12-02 14:24:04,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:04,954 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 22059 transitions. [2023-12-02 14:24:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 14:24:04,955 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:04,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:04,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 14:24:04,955 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:04,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash 71136802, now seen corresponding path program 1 times [2023-12-02 14:24:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:04,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062796562] [2023-12-02 14:24:04,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:04,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:05,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:05,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062796562] [2023-12-02 14:24:05,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062796562] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:05,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:05,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 14:24:05,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956584303] [2023-12-02 14:24:05,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:05,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:24:05,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:05,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:24:05,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:05,098 INFO L87 Difference]: Start difference. First operand 6339 states and 22059 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:05,207 INFO L93 Difference]: Finished difference Result 5515 states and 19074 transitions. [2023-12-02 14:24:05,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:24:05,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 14:24:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:05,240 INFO L225 Difference]: With dead ends: 5515 [2023-12-02 14:24:05,241 INFO L226 Difference]: Without dead ends: 5403 [2023-12-02 14:24:05,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:05,242 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:05,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 43 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2023-12-02 14:24:05,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 5403. [2023-12-02 14:24:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5403 states, 5399 states have (on average 3.465827005000926) internal successors, (18712), 5402 states have internal predecessors, (18712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 18712 transitions. [2023-12-02 14:24:05,476 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 18712 transitions. Word has length 8 [2023-12-02 14:24:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:05,476 INFO L495 AbstractCegarLoop]: Abstraction has 5403 states and 18712 transitions. [2023-12-02 14:24:05,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 18712 transitions. [2023-12-02 14:24:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 14:24:05,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:05,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:05,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 14:24:05,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:05,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:05,478 INFO L85 PathProgramCache]: Analyzing trace with hash 71134981, now seen corresponding path program 1 times [2023-12-02 14:24:05,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:05,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347688716] [2023-12-02 14:24:05,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:05,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:05,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:05,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:05,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347688716] [2023-12-02 14:24:05,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347688716] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:05,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:05,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:24:05,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088309479] [2023-12-02 14:24:05,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:05,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:24:05,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:05,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:24:05,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:05,537 INFO L87 Difference]: Start difference. First operand 5403 states and 18712 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:05,636 INFO L93 Difference]: Finished difference Result 5347 states and 18559 transitions. [2023-12-02 14:24:05,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:24:05,637 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 14:24:05,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:05,666 INFO L225 Difference]: With dead ends: 5347 [2023-12-02 14:24:05,666 INFO L226 Difference]: Without dead ends: 5347 [2023-12-02 14:24:05,667 INFO L412 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 [2023-12-02 14:24:05,668 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:05,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 40 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:05,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5347 states. [2023-12-02 14:24:05,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5347 to 5347. [2023-12-02 14:24:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5347 states, 5344 states have (on average 3.472866766467066) internal successors, (18559), 5346 states have internal predecessors, (18559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5347 states to 5347 states and 18559 transitions. [2023-12-02 14:24:05,908 INFO L78 Accepts]: Start accepts. Automaton has 5347 states and 18559 transitions. Word has length 8 [2023-12-02 14:24:05,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:05,909 INFO L495 AbstractCegarLoop]: Abstraction has 5347 states and 18559 transitions. [2023-12-02 14:24:05,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 5347 states and 18559 transitions. [2023-12-02 14:24:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 14:24:05,909 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:05,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:05,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 14:24:05,910 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:05,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash 71134982, now seen corresponding path program 1 times [2023-12-02 14:24:05,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:05,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094712224] [2023-12-02 14:24:05,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:05,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:05,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:05,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094712224] [2023-12-02 14:24:05,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094712224] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:05,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:05,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:24:05,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075258362] [2023-12-02 14:24:05,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:05,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:24:05,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:05,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:24:05,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:05,979 INFO L87 Difference]: Start difference. First operand 5347 states and 18559 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:06,070 INFO L93 Difference]: Finished difference Result 5291 states and 18406 transitions. [2023-12-02 14:24:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:24:06,071 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 14:24:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:06,092 INFO L225 Difference]: With dead ends: 5291 [2023-12-02 14:24:06,092 INFO L226 Difference]: Without dead ends: 5291 [2023-12-02 14:24:06,093 INFO L412 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 [2023-12-02 14:24:06,094 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:06,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:06,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2023-12-02 14:24:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 5291. [2023-12-02 14:24:06,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5291 states, 5289 states have (on average 3.4800529400642843) internal successors, (18406), 5290 states have internal predecessors, (18406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 18406 transitions. [2023-12-02 14:24:06,259 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 18406 transitions. Word has length 8 [2023-12-02 14:24:06,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:06,259 INFO L495 AbstractCegarLoop]: Abstraction has 5291 states and 18406 transitions. [2023-12-02 14:24:06,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:06,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 18406 transitions. [2023-12-02 14:24:06,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 14:24:06,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:06,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:06,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 14:24:06,269 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:06,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:06,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1399595540, now seen corresponding path program 1 times [2023-12-02 14:24:06,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:06,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588293890] [2023-12-02 14:24:06,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:06,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:06,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:06,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:06,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588293890] [2023-12-02 14:24:06,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588293890] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:06,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:06,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 14:24:06,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715143807] [2023-12-02 14:24:06,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:06,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 14:24:06,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:06,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 14:24:06,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 14:24:06,810 INFO L87 Difference]: Start difference. First operand 5291 states and 18406 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:07,123 INFO L93 Difference]: Finished difference Result 4899 states and 16999 transitions. [2023-12-02 14:24:07,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 14:24:07,124 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 14:24:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:07,136 INFO L225 Difference]: With dead ends: 4899 [2023-12-02 14:24:07,136 INFO L226 Difference]: Without dead ends: 4115 [2023-12-02 14:24:07,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-02 14:24:07,137 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 118 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:07,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 238 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 14:24:07,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2023-12-02 14:24:07,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 4115. [2023-12-02 14:24:07,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4115 states, 4114 states have (on average 3.4479824987846377) internal successors, (14185), 4114 states have internal predecessors, (14185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4115 states to 4115 states and 14185 transitions. [2023-12-02 14:24:07,227 INFO L78 Accepts]: Start accepts. Automaton has 4115 states and 14185 transitions. Word has length 18 [2023-12-02 14:24:07,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:07,228 INFO L495 AbstractCegarLoop]: Abstraction has 4115 states and 14185 transitions. [2023-12-02 14:24:07,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 4115 states and 14185 transitions. [2023-12-02 14:24:07,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 14:24:07,231 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:07,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:07,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 14:24:07,231 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:07,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:07,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1399595063, now seen corresponding path program 1 times [2023-12-02 14:24:07,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:07,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335211929] [2023-12-02 14:24:07,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:07,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:07,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:07,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335211929] [2023-12-02 14:24:07,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335211929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:07,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:07,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:24:07,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959211377] [2023-12-02 14:24:07,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:07,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:24:07,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:07,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:24:07,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:24:07,429 INFO L87 Difference]: Start difference. First operand 4115 states and 14185 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:07,746 INFO L93 Difference]: Finished difference Result 7577 states and 25415 transitions. [2023-12-02 14:24:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 14:24:07,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 14:24:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:07,761 INFO L225 Difference]: With dead ends: 7577 [2023-12-02 14:24:07,761 INFO L226 Difference]: Without dead ends: 5369 [2023-12-02 14:24:07,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:24:07,762 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 84 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:07,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 128 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:24:07,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5369 states. [2023-12-02 14:24:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5369 to 4079. [2023-12-02 14:24:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4079 states, 4078 states have (on average 3.3087297694948505) internal successors, (13493), 4078 states have internal predecessors, (13493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4079 states to 4079 states and 13493 transitions. [2023-12-02 14:24:07,873 INFO L78 Accepts]: Start accepts. Automaton has 4079 states and 13493 transitions. Word has length 18 [2023-12-02 14:24:07,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:07,873 INFO L495 AbstractCegarLoop]: Abstraction has 4079 states and 13493 transitions. [2023-12-02 14:24:07,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:07,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4079 states and 13493 transitions. [2023-12-02 14:24:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 14:24:07,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:07,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:07,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 14:24:07,881 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:07,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1555223498, now seen corresponding path program 1 times [2023-12-02 14:24:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:07,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213335604] [2023-12-02 14:24:07,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:07,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:08,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213335604] [2023-12-02 14:24:08,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213335604] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:08,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:08,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:24:08,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662120132] [2023-12-02 14:24:08,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:08,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:24:08,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:08,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:24:08,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:24:08,090 INFO L87 Difference]: Start difference. First operand 4079 states and 13493 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:08,376 INFO L93 Difference]: Finished difference Result 4741 states and 15230 transitions. [2023-12-02 14:24:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 14:24:08,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 14:24:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:08,384 INFO L225 Difference]: With dead ends: 4741 [2023-12-02 14:24:08,385 INFO L226 Difference]: Without dead ends: 3413 [2023-12-02 14:24:08,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 14:24:08,386 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 141 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:08,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 132 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:24:08,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2023-12-02 14:24:08,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 2759. [2023-12-02 14:24:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2759 states, 2758 states have (on average 3.3045685279187818) internal successors, (9114), 2758 states have internal predecessors, (9114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 9114 transitions. [2023-12-02 14:24:08,453 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 9114 transitions. Word has length 20 [2023-12-02 14:24:08,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:08,453 INFO L495 AbstractCegarLoop]: Abstraction has 2759 states and 9114 transitions. [2023-12-02 14:24:08,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 9114 transitions. [2023-12-02 14:24:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 14:24:08,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:08,459 INFO L195 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] [2023-12-02 14:24:08,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 14:24:08,459 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:08,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:08,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1831126278, now seen corresponding path program 1 times [2023-12-02 14:24:08,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:08,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497202354] [2023-12-02 14:24:08,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:08,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:08,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:08,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497202354] [2023-12-02 14:24:08,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497202354] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:08,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:08,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:24:08,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118532949] [2023-12-02 14:24:08,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:08,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:24:08,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:08,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:24:08,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:24:08,614 INFO L87 Difference]: Start difference. First operand 2759 states and 9114 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:08,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:08,814 INFO L93 Difference]: Finished difference Result 4015 states and 13092 transitions. [2023-12-02 14:24:08,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:24:08,815 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 14:24:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:08,820 INFO L225 Difference]: With dead ends: 4015 [2023-12-02 14:24:08,820 INFO L226 Difference]: Without dead ends: 2399 [2023-12-02 14:24:08,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-02 14:24:08,821 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 81 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:08,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 115 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:08,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2023-12-02 14:24:08,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2399. [2023-12-02 14:24:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2398 states have (on average 3.2452043369474564) internal successors, (7782), 2398 states have internal predecessors, (7782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 7782 transitions. [2023-12-02 14:24:08,871 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 7782 transitions. Word has length 23 [2023-12-02 14:24:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:08,871 INFO L495 AbstractCegarLoop]: Abstraction has 2399 states and 7782 transitions. [2023-12-02 14:24:08,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 7782 transitions. [2023-12-02 14:24:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 14:24:08,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:08,878 INFO L195 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] [2023-12-02 14:24:08,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 14:24:08,878 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:08,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:08,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1801937025, now seen corresponding path program 1 times [2023-12-02 14:24:08,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:08,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009447010] [2023-12-02 14:24:08,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:08,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:09,060 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:09,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009447010] [2023-12-02 14:24:09,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009447010] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:09,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:09,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 14:24:09,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704394112] [2023-12-02 14:24:09,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:09,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 14:24:09,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:09,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 14:24:09,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:24:09,061 INFO L87 Difference]: Start difference. First operand 2399 states and 7782 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:09,396 INFO L93 Difference]: Finished difference Result 5445 states and 17379 transitions. [2023-12-02 14:24:09,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 14:24:09,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-02 14:24:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:09,403 INFO L225 Difference]: With dead ends: 5445 [2023-12-02 14:24:09,404 INFO L226 Difference]: Without dead ends: 3559 [2023-12-02 14:24:09,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-12-02 14:24:09,404 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 159 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:09,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 174 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:24:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2023-12-02 14:24:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 2399. [2023-12-02 14:24:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2398 states have (on average 3.2110091743119265) internal successors, (7700), 2398 states have internal predecessors, (7700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 7700 transitions. [2023-12-02 14:24:09,500 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 7700 transitions. Word has length 25 [2023-12-02 14:24:09,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:09,500 INFO L495 AbstractCegarLoop]: Abstraction has 2399 states and 7700 transitions. [2023-12-02 14:24:09,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:09,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 7700 transitions. [2023-12-02 14:24:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 14:24:09,507 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:09,507 INFO L195 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] [2023-12-02 14:24:09,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 14:24:09,507 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:09,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:09,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1227225905, now seen corresponding path program 2 times [2023-12-02 14:24:09,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:09,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562195244] [2023-12-02 14:24:09,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:09,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:09,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:09,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562195244] [2023-12-02 14:24:09,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562195244] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:09,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:09,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:24:09,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235397378] [2023-12-02 14:24:09,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:09,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:24:09,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:09,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:24:09,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:24:09,675 INFO L87 Difference]: Start difference. First operand 2399 states and 7700 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:09,849 INFO L93 Difference]: Finished difference Result 3327 states and 10660 transitions. [2023-12-02 14:24:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:24:09,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-02 14:24:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:09,853 INFO L225 Difference]: With dead ends: 3327 [2023-12-02 14:24:09,853 INFO L226 Difference]: Without dead ends: 1739 [2023-12-02 14:24:09,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-02 14:24:09,854 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 71 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:09,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 108 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:09,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2023-12-02 14:24:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1739. [2023-12-02 14:24:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1738 states have (on average 3.169735327963176) internal successors, (5509), 1738 states have internal predecessors, (5509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 5509 transitions. [2023-12-02 14:24:09,890 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 5509 transitions. Word has length 25 [2023-12-02 14:24:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:09,891 INFO L495 AbstractCegarLoop]: Abstraction has 1739 states and 5509 transitions. [2023-12-02 14:24:09,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:09,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 5509 transitions. [2023-12-02 14:24:09,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 14:24:09,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:09,894 INFO L195 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, 1] [2023-12-02 14:24:09,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 14:24:09,895 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:09,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:09,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1320881017, now seen corresponding path program 1 times [2023-12-02 14:24:09,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:09,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670127029] [2023-12-02 14:24:09,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:09,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:10,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:10,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670127029] [2023-12-02 14:24:10,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670127029] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:10,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:10,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:24:10,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116621891] [2023-12-02 14:24:10,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:10,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:24:10,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:10,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:24:10,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:24:10,006 INFO L87 Difference]: Start difference. First operand 1739 states and 5509 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:10,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:10,088 INFO L93 Difference]: Finished difference Result 1651 states and 4943 transitions. [2023-12-02 14:24:10,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:24:10,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 14:24:10,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:10,091 INFO L225 Difference]: With dead ends: 1651 [2023-12-02 14:24:10,091 INFO L226 Difference]: Without dead ends: 1419 [2023-12-02 14:24:10,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:24:10,092 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 51 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:10,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 39 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2023-12-02 14:24:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1419. [2023-12-02 14:24:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1418 states have (on average 3.041607898448519) internal successors, (4313), 1418 states have internal predecessors, (4313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4313 transitions. [2023-12-02 14:24:10,119 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4313 transitions. Word has length 26 [2023-12-02 14:24:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:10,120 INFO L495 AbstractCegarLoop]: Abstraction has 1419 states and 4313 transitions. [2023-12-02 14:24:10,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4313 transitions. [2023-12-02 14:24:10,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 14:24:10,123 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:10,124 INFO L195 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, 1, 1, 1] [2023-12-02 14:24:10,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 14:24:10,124 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:10,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:10,125 INFO L85 PathProgramCache]: Analyzing trace with hash -372036264, now seen corresponding path program 1 times [2023-12-02 14:24:10,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:10,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379837109] [2023-12-02 14:24:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:10,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:10,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:10,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379837109] [2023-12-02 14:24:10,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379837109] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:10,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:10,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:24:10,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294337739] [2023-12-02 14:24:10,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:10,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:24:10,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:10,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:24:10,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:24:10,261 INFO L87 Difference]: Start difference. First operand 1419 states and 4313 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:10,371 INFO L93 Difference]: Finished difference Result 1083 states and 3069 transitions. [2023-12-02 14:24:10,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:24:10,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-02 14:24:10,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:10,373 INFO L225 Difference]: With dead ends: 1083 [2023-12-02 14:24:10,373 INFO L226 Difference]: Without dead ends: 931 [2023-12-02 14:24:10,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:24:10,374 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 85 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:10,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 40 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2023-12-02 14:24:10,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 931. [2023-12-02 14:24:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 930 states have (on average 2.8333333333333335) internal successors, (2635), 930 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 2635 transitions. [2023-12-02 14:24:10,392 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 2635 transitions. Word has length 28 [2023-12-02 14:24:10,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:10,393 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 2635 transitions. [2023-12-02 14:24:10,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:10,393 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 2635 transitions. [2023-12-02 14:24:10,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 14:24:10,395 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:10,395 INFO L195 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, 1, 1, 1, 1, 1] [2023-12-02 14:24:10,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 14:24:10,396 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:10,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:10,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1242997577, now seen corresponding path program 1 times [2023-12-02 14:24:10,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:10,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144649601] [2023-12-02 14:24:10,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:10,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:10,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:10,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144649601] [2023-12-02 14:24:10,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144649601] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:10,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:10,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:24:10,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534795602] [2023-12-02 14:24:10,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:10,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:24:10,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:10,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:24:10,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:24:10,555 INFO L87 Difference]: Start difference. First operand 931 states and 2635 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:10,667 INFO L93 Difference]: Finished difference Result 683 states and 1879 transitions. [2023-12-02 14:24:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:24:10,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-02 14:24:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:10,669 INFO L225 Difference]: With dead ends: 683 [2023-12-02 14:24:10,669 INFO L226 Difference]: Without dead ends: 627 [2023-12-02 14:24:10,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-02 14:24:10,670 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 95 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:10,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 39 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2023-12-02 14:24:10,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 563. [2023-12-02 14:24:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 2.724199288256228) internal successors, (1531), 562 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1531 transitions. [2023-12-02 14:24:10,679 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1531 transitions. Word has length 30 [2023-12-02 14:24:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:10,680 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 1531 transitions. [2023-12-02 14:24:10,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1531 transitions. [2023-12-02 14:24:10,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 14:24:10,681 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:10,682 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:10,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 14:24:10,682 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:10,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:10,682 INFO L85 PathProgramCache]: Analyzing trace with hash 272619031, now seen corresponding path program 1 times [2023-12-02 14:24:10,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:10,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325694870] [2023-12-02 14:24:10,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:10,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:11,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:24:11,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325694870] [2023-12-02 14:24:11,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325694870] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:11,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:11,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 14:24:11,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556942690] [2023-12-02 14:24:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:11,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 14:24:11,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:24:11,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 14:24:11,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-02 14:24:11,937 INFO L87 Difference]: Start difference. First operand 563 states and 1531 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:12,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:12,212 INFO L93 Difference]: Finished difference Result 699 states and 1887 transitions. [2023-12-02 14:24:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 14:24:12,212 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-02 14:24:12,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:12,214 INFO L225 Difference]: With dead ends: 699 [2023-12-02 14:24:12,214 INFO L226 Difference]: Without dead ends: 359 [2023-12-02 14:24:12,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-02 14:24:12,215 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 48 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:12,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 237 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:24:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-02 14:24:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2023-12-02 14:24:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 2.5335195530726256) internal successors, (907), 358 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 907 transitions. [2023-12-02 14:24:12,226 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 907 transitions. Word has length 34 [2023-12-02 14:24:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:12,226 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 907 transitions. [2023-12-02 14:24:12,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 907 transitions. [2023-12-02 14:24:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 14:24:12,228 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:12,228 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:12,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 14:24:12,229 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:12,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:12,229 INFO L85 PathProgramCache]: Analyzing trace with hash -588901511, now seen corresponding path program 2 times [2023-12-02 14:24:12,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:24:12,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177209675] [2023-12-02 14:24:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:12,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:24:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 14:24:12,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 14:24:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 14:24:12,375 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 14:24:12,375 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 14:24:12,376 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-12-02 14:24:12,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-12-02 14:24:12,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-12-02 14:24:12,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-12-02 14:24:12,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-12-02 14:24:12,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-12-02 14:24:12,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-12-02 14:24:12,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-12-02 14:24:12,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-12-02 14:24:12,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-12-02 14:24:12,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-12-02 14:24:12,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-12-02 14:24:12,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-12-02 14:24:12,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 14:24:12,385 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:12,392 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 14:24:12,392 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 14:24:12,449 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-12-02 14:24:12,451 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 14:24:12,454 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-12-02 14:24:12,463 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-12-02 14:24:12,464 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-12-02 14:24:12,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:24:12 BasicIcfg [2023-12-02 14:24:12,475 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 14:24:12,476 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 14:24:12,476 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 14:24:12,476 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 14:24:12,477 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:24:01" (3/4) ... [2023-12-02 14:24:12,479 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 14:24:12,480 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 14:24:12,480 INFO L158 Benchmark]: Toolchain (without parser) took 12286.23ms. Allocated memory was 211.8MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 169.6MB in the beginning and 826.6MB in the end (delta: -657.1MB). Peak memory consumption was 488.1MB. Max. memory is 16.1GB. [2023-12-02 14:24:12,481 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 119.5MB. Free memory was 83.7MB in the beginning and 83.7MB in the end (delta: 29.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 14:24:12,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.46ms. Allocated memory is still 211.8MB. Free memory was 169.0MB in the beginning and 146.0MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 14:24:12,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.94ms. Allocated memory is still 211.8MB. Free memory was 146.0MB in the beginning and 143.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 14:24:12,482 INFO L158 Benchmark]: Boogie Preprocessor took 36.28ms. Allocated memory is still 211.8MB. Free memory was 143.5MB in the beginning and 141.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 14:24:12,482 INFO L158 Benchmark]: RCFGBuilder took 678.77ms. Allocated memory is still 211.8MB. Free memory was 141.4MB in the beginning and 151.7MB in the end (delta: -10.3MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2023-12-02 14:24:12,482 INFO L158 Benchmark]: TraceAbstraction took 11024.87ms. Allocated memory was 211.8MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 151.7MB in the beginning and 826.6MB in the end (delta: -674.9MB). Peak memory consumption was 469.1MB. Max. memory is 16.1GB. [2023-12-02 14:24:12,483 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 1.4GB. Free memory is still 826.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 14:24:12,485 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.18ms. Allocated memory is still 119.5MB. Free memory was 83.7MB in the beginning and 83.7MB in the end (delta: 29.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.46ms. Allocated memory is still 211.8MB. Free memory was 169.0MB in the beginning and 146.0MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.94ms. Allocated memory is still 211.8MB. Free memory was 146.0MB in the beginning and 143.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.28ms. Allocated memory is still 211.8MB. Free memory was 143.5MB in the beginning and 141.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 678.77ms. Allocated memory is still 211.8MB. Free memory was 141.4MB in the beginning and 151.7MB in the end (delta: -10.3MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11024.87ms. Allocated memory was 211.8MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 151.7MB in the beginning and 826.6MB in the end (delta: -674.9MB). Peak memory consumption was 469.1MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 1.4GB. Free memory is still 826.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 79 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1178 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1178 mSDsluCounter, 1514 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1031 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1715 IncrementalHoareTripleChecker+Invalid, 1756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 483 mSDtfsCounter, 1715 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6805occurred in iteration=0, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 3168 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 1865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-02 14:24:12,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:24:14,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:24:14,501 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 14:24:14,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:24:14,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:24:14,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:24:14,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:24:14,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:24:14,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:24:14,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:24:14,538 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:24:14,538 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:24:14,539 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:24:14,539 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:24:14,540 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:24:14,540 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:24:14,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 14:24:14,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 14:24:14,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:24:14,543 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:24:14,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:24:14,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:24:14,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:24:14,544 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 14:24:14,544 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 14:24:14,545 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 14:24:14,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:24:14,546 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 14:24:14,546 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 14:24:14,547 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 14:24:14,547 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 14:24:14,548 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:24:14,548 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:24:14,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:24:14,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 14:24:14,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:24:14,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:24:14,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:24:14,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:24:14,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:24:14,550 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 14:24:14,550 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 14:24:14,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:24:14,550 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:24:14,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:24:14,551 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/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_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 [2023-12-02 14:24:14,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:24:14,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:24:14,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:24:14,854 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:24:14,855 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:24:14,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-12-02 14:24:17,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:24:17,885 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:24:17,886 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-12-02 14:24:17,902 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/data/f850b28c4/bf012dabdc4941d18a1b9df8213c266b/FLAG3698b80f2 [2023-12-02 14:24:17,915 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/data/f850b28c4/bf012dabdc4941d18a1b9df8213c266b [2023-12-02 14:24:17,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:24:17,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:24:17,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:24:17,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:24:17,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:24:17,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:24:17" (1/1) ... [2023-12-02 14:24:17,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3ee822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:17, skipping insertion in model container [2023-12-02 14:24:17,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:24:17" (1/1) ... [2023-12-02 14:24:17,981 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:24:18,280 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:24:18,295 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:24:18,354 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:24:18,388 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 14:24:18,388 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 14:24:18,394 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:24:18,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:18 WrapperNode [2023-12-02 14:24:18,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:24:18,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:24:18,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:24:18,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:24:18,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:18" (1/1) ... [2023-12-02 14:24:18,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:18" (1/1) ... [2023-12-02 14:24:18,447 INFO L138 Inliner]: procedures = 179, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-12-02 14:24:18,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:24:18,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:24:18,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:24:18,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:24:18,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:18" (1/1) ... [2023-12-02 14:24:18,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:18" (1/1) ... [2023-12-02 14:24:18,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:18" (1/1) ... [2023-12-02 14:24:18,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:18" (1/1) ... [2023-12-02 14:24:18,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:18" (1/1) ... [2023-12-02 14:24:18,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:18" (1/1) ... [2023-12-02 14:24:18,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:18" (1/1) ... [2023-12-02 14:24:18,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:18" (1/1) ... [2023-12-02 14:24:18,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:24:18,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:24:18,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:24:18,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:24:18,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:18" (1/1) ... [2023-12-02 14:24:18,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:24:18,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:24:18,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 14:24:18,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 14:24:18,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 14:24:18,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 14:24:18,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 14:24:18,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 14:24:18,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 14:24:18,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 14:24:18,596 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-02 14:24:18,597 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-02 14:24:18,597 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-02 14:24:18,597 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-02 14:24:18,597 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-02 14:24:18,597 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-02 14:24:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 14:24:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:24:18,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:24:18,599 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 14:24:18,743 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:24:18,745 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:24:19,052 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:24:19,256 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:24:19,256 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 14:24:19,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:24:19 BoogieIcfgContainer [2023-12-02 14:24:19,256 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:24:19,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:24:19,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:24:19,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:24:19,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:24:17" (1/3) ... [2023-12-02 14:24:19,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce04a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:24:19, skipping insertion in model container [2023-12-02 14:24:19,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:24:18" (2/3) ... [2023-12-02 14:24:19,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce04a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:24:19, skipping insertion in model container [2023-12-02 14:24:19,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:24:19" (3/3) ... [2023-12-02 14:24:19,264 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-12-02 14:24:19,279 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:24:19,279 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-12-02 14:24:19,279 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 14:24:19,329 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 14:24:19,358 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 54 transitions, 120 flow [2023-12-02 14:24:19,666 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6805 states, 6792 states have (on average 3.6223498233215548) internal successors, (24603), 6804 states have internal predecessors, (24603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:19,686 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:24:19,692 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@468d666, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:24:19,693 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-12-02 14:24:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 6805 states, 6792 states have (on average 3.6223498233215548) internal successors, (24603), 6804 states have internal predecessors, (24603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 14:24:19,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:19,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 14:24:19,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:19,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:19,733 INFO L85 PathProgramCache]: Analyzing trace with hash 12276, now seen corresponding path program 1 times [2023-12-02 14:24:19,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:19,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406253348] [2023-12-02 14:24:19,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:19,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:19,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:19,749 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:24:19,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 14:24:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:19,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:24:19,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:19,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 14:24:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:19,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:24:19,957 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:24:19,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406253348] [2023-12-02 14:24:19,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406253348] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:19,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:19,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 14:24:19,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740096627] [2023-12-02 14:24:19,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:19,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:24:19,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:24:19,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:24:19,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:19,999 INFO L87 Difference]: Start difference. First operand has 6805 states, 6792 states have (on average 3.6223498233215548) internal successors, (24603), 6804 states have internal predecessors, (24603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:20,223 INFO L93 Difference]: Finished difference Result 6356 states and 22090 transitions. [2023-12-02 14:24:20,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:24:20,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 14:24:20,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:20,314 INFO L225 Difference]: With dead ends: 6356 [2023-12-02 14:24:20,314 INFO L226 Difference]: Without dead ends: 6356 [2023-12-02 14:24:20,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:20,319 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:20,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 32 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:20,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6356 states. [2023-12-02 14:24:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6356 to 6356. [2023-12-02 14:24:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6356 states, 6344 states have (on average 3.48203026481715) internal successors, (22090), 6355 states have internal predecessors, (22090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6356 states to 6356 states and 22090 transitions. [2023-12-02 14:24:20,690 INFO L78 Accepts]: Start accepts. Automaton has 6356 states and 22090 transitions. Word has length 2 [2023-12-02 14:24:20,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:20,690 INFO L495 AbstractCegarLoop]: Abstraction has 6356 states and 22090 transitions. [2023-12-02 14:24:20,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 6356 states and 22090 transitions. [2023-12-02 14:24:20,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 14:24:20,692 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:20,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 14:24:20,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 14:24:20,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:20,894 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:20,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:20,895 INFO L85 PathProgramCache]: Analyzing trace with hash 12277, now seen corresponding path program 1 times [2023-12-02 14:24:20,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:20,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467723035] [2023-12-02 14:24:20,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:20,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:20,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:20,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:24:20,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 14:24:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:20,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:24:20,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:20,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 14:24:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:20,989 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:24:20,989 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:24:20,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467723035] [2023-12-02 14:24:20,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467723035] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:20,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:20,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 14:24:20,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236003720] [2023-12-02 14:24:20,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:20,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:24:20,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:24:20,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:24:20,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:20,993 INFO L87 Difference]: Start difference. First operand 6356 states and 22090 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:21,232 INFO L93 Difference]: Finished difference Result 6355 states and 22089 transitions. [2023-12-02 14:24:21,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:24:21,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 14:24:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:21,321 INFO L225 Difference]: With dead ends: 6355 [2023-12-02 14:24:21,321 INFO L226 Difference]: Without dead ends: 6355 [2023-12-02 14:24:21,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:21,323 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:21,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 33 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2023-12-02 14:24:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 6355. [2023-12-02 14:24:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6355 states, 6344 states have (on average 3.4818726355611602) internal successors, (22089), 6354 states have internal predecessors, (22089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6355 states to 6355 states and 22089 transitions. [2023-12-02 14:24:21,737 INFO L78 Accepts]: Start accepts. Automaton has 6355 states and 22089 transitions. Word has length 2 [2023-12-02 14:24:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:21,738 INFO L495 AbstractCegarLoop]: Abstraction has 6355 states and 22089 transitions. [2023-12-02 14:24:21,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 6355 states and 22089 transitions. [2023-12-02 14:24:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 14:24:21,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:21,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 14:24:21,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 14:24:21,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:21,945 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:21,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:21,946 INFO L85 PathProgramCache]: Analyzing trace with hash 366084306, now seen corresponding path program 1 times [2023-12-02 14:24:21,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:21,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938082755] [2023-12-02 14:24:21,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:21,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:21,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:21,948 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:24:21,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 14:24:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:22,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:24:22,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:22,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 14:24:22,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:22,075 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:24:22,076 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:24:22,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938082755] [2023-12-02 14:24:22,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938082755] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:22,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:22,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:24:22,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979012193] [2023-12-02 14:24:22,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:22,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:24:22,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:24:22,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:24:22,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:22,079 INFO L87 Difference]: Start difference. First operand 6355 states and 22089 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:22,237 INFO L93 Difference]: Finished difference Result 6347 states and 22074 transitions. [2023-12-02 14:24:22,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:24:22,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 14:24:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:22,321 INFO L225 Difference]: With dead ends: 6347 [2023-12-02 14:24:22,323 INFO L226 Difference]: Without dead ends: 6347 [2023-12-02 14:24:22,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:22,328 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:22,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 37 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:22,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6347 states. [2023-12-02 14:24:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6347 to 6347. [2023-12-02 14:24:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6347 states, 6337 states have (on average 3.4833517437273156) internal successors, (22074), 6346 states have internal predecessors, (22074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6347 states to 6347 states and 22074 transitions. [2023-12-02 14:24:22,620 INFO L78 Accepts]: Start accepts. Automaton has 6347 states and 22074 transitions. Word has length 5 [2023-12-02 14:24:22,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:22,620 INFO L495 AbstractCegarLoop]: Abstraction has 6347 states and 22074 transitions. [2023-12-02 14:24:22,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 6347 states and 22074 transitions. [2023-12-02 14:24:22,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 14:24:22,621 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:22,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 14:24:22,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 14:24:22,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:22,824 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:22,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:22,825 INFO L85 PathProgramCache]: Analyzing trace with hash 366084307, now seen corresponding path program 1 times [2023-12-02 14:24:22,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:22,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600453835] [2023-12-02 14:24:22,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:22,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:22,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:22,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:24:22,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 14:24:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:22,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:24:22,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:22,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 14:24:22,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:22,928 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:24:22,928 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:24:22,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600453835] [2023-12-02 14:24:22,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600453835] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:22,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:22,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:24:22,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243345068] [2023-12-02 14:24:22,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:22,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:24:22,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:24:22,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:24:22,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:22,931 INFO L87 Difference]: Start difference. First operand 6347 states and 22074 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:23,113 INFO L93 Difference]: Finished difference Result 6339 states and 22059 transitions. [2023-12-02 14:24:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:24:23,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 14:24:23,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:23,155 INFO L225 Difference]: With dead ends: 6339 [2023-12-02 14:24:23,156 INFO L226 Difference]: Without dead ends: 6339 [2023-12-02 14:24:23,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:23,172 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 36 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 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 [2023-12-02 14:24:23,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:23,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6339 states. [2023-12-02 14:24:23,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6339 to 6339. [2023-12-02 14:24:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6339 states, 6330 states have (on average 3.4848341232227487) internal successors, (22059), 6338 states have internal predecessors, (22059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 22059 transitions. [2023-12-02 14:24:23,442 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 22059 transitions. Word has length 5 [2023-12-02 14:24:23,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:23,442 INFO L495 AbstractCegarLoop]: Abstraction has 6339 states and 22059 transitions. [2023-12-02 14:24:23,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 22059 transitions. [2023-12-02 14:24:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 14:24:23,443 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:23,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:23,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 14:24:23,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:23,644 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:23,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:23,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1095964450, now seen corresponding path program 1 times [2023-12-02 14:24:23,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:23,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198341215] [2023-12-02 14:24:23,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:23,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:23,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:23,647 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:24:23,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-02 14:24:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:23,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:24:23,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:23,757 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:24:23,758 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:24:23,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198341215] [2023-12-02 14:24:23,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198341215] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:23,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:23,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 14:24:23,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931657785] [2023-12-02 14:24:23,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:23,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:24:23,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:24:23,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:24:23,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:23,760 INFO L87 Difference]: Start difference. First operand 6339 states and 22059 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:23,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:23,900 INFO L93 Difference]: Finished difference Result 5515 states and 19074 transitions. [2023-12-02 14:24:23,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:24:23,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 14:24:23,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:23,927 INFO L225 Difference]: With dead ends: 5515 [2023-12-02 14:24:23,927 INFO L226 Difference]: Without dead ends: 5403 [2023-12-02 14:24:23,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:23,928 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:23,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 43 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:23,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2023-12-02 14:24:24,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 5403. [2023-12-02 14:24:24,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5403 states, 5399 states have (on average 3.465827005000926) internal successors, (18712), 5402 states have internal predecessors, (18712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 18712 transitions. [2023-12-02 14:24:24,104 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 18712 transitions. Word has length 8 [2023-12-02 14:24:24,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:24,104 INFO L495 AbstractCegarLoop]: Abstraction has 5403 states and 18712 transitions. [2023-12-02 14:24:24,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:24,105 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 18712 transitions. [2023-12-02 14:24:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 14:24:24,106 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:24,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:24,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 14:24:24,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:24,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:24,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:24,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1095962630, now seen corresponding path program 1 times [2023-12-02 14:24:24,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:24,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519613869] [2023-12-02 14:24:24,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:24,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:24,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:24,309 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:24:24,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 14:24:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:24,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:24:24,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:24,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 14:24:24,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:24,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:24:24,410 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:24:24,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519613869] [2023-12-02 14:24:24,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519613869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:24,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:24,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:24:24,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718344033] [2023-12-02 14:24:24,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:24,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:24:24,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:24:24,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:24:24,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:24,411 INFO L87 Difference]: Start difference. First operand 5403 states and 18712 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:24,526 INFO L93 Difference]: Finished difference Result 5347 states and 18559 transitions. [2023-12-02 14:24:24,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:24:24,527 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 14:24:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:24,596 INFO L225 Difference]: With dead ends: 5347 [2023-12-02 14:24:24,596 INFO L226 Difference]: Without dead ends: 5347 [2023-12-02 14:24:24,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:24,597 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:24,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 41 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:24,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5347 states. [2023-12-02 14:24:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5347 to 5347. [2023-12-02 14:24:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5347 states, 5344 states have (on average 3.472866766467066) internal successors, (18559), 5346 states have internal predecessors, (18559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5347 states to 5347 states and 18559 transitions. [2023-12-02 14:24:24,699 INFO L78 Accepts]: Start accepts. Automaton has 5347 states and 18559 transitions. Word has length 8 [2023-12-02 14:24:24,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:24,700 INFO L495 AbstractCegarLoop]: Abstraction has 5347 states and 18559 transitions. [2023-12-02 14:24:24,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 5347 states and 18559 transitions. [2023-12-02 14:24:24,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 14:24:24,701 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:24,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:24,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-02 14:24:24,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:24,901 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:24,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:24,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1095962629, now seen corresponding path program 1 times [2023-12-02 14:24:24,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:24,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85710359] [2023-12-02 14:24:24,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:24,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:24,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:24,903 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:24:24,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-02 14:24:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:24,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:24:24,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:24,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 14:24:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:24,992 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:24:24,993 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:24:24,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85710359] [2023-12-02 14:24:24,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85710359] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:24,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:24,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:24:24,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593541377] [2023-12-02 14:24:24,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:24,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:24:24,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:24:24,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:24:24,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:24,994 INFO L87 Difference]: Start difference. First operand 5347 states and 18559 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:25,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:25,075 INFO L93 Difference]: Finished difference Result 5291 states and 18406 transitions. [2023-12-02 14:24:25,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:24:25,076 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 14:24:25,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:25,091 INFO L225 Difference]: With dead ends: 5291 [2023-12-02 14:24:25,091 INFO L226 Difference]: Without dead ends: 5291 [2023-12-02 14:24:25,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:24:25,092 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:25,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:25,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2023-12-02 14:24:25,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 5291. [2023-12-02 14:24:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5291 states, 5289 states have (on average 3.4800529400642843) internal successors, (18406), 5290 states have internal predecessors, (18406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 18406 transitions. [2023-12-02 14:24:25,287 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 18406 transitions. Word has length 8 [2023-12-02 14:24:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:25,287 INFO L495 AbstractCegarLoop]: Abstraction has 5291 states and 18406 transitions. [2023-12-02 14:24:25,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 18406 transitions. [2023-12-02 14:24:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 14:24:25,296 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:25,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:25,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-02 14:24:25,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:25,497 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:25,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:25,498 INFO L85 PathProgramCache]: Analyzing trace with hash 484303956, now seen corresponding path program 1 times [2023-12-02 14:24:25,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:25,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676115185] [2023-12-02 14:24:25,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:25,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:25,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:25,500 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:24:25,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-02 14:24:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:25,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:24:25,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:25,636 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:24:25,637 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:24:25,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676115185] [2023-12-02 14:24:25,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676115185] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:25,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:25,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:24:25,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837080118] [2023-12-02 14:24:25,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:25,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:24:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:24:25,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:24:25,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:24:25,639 INFO L87 Difference]: Start difference. First operand 5291 states and 18406 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:25,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:25,779 INFO L93 Difference]: Finished difference Result 4033 states and 12971 transitions. [2023-12-02 14:24:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:24:25,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 14:24:25,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:25,794 INFO L225 Difference]: With dead ends: 4033 [2023-12-02 14:24:25,794 INFO L226 Difference]: Without dead ends: 3641 [2023-12-02 14:24:25,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:24:25,795 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 65 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:25,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 50 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2023-12-02 14:24:25,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 3641. [2023-12-02 14:24:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3641 states, 3639 states have (on average 3.2442978840340753) internal successors, (11806), 3640 states have internal predecessors, (11806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 11806 transitions. [2023-12-02 14:24:25,921 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 11806 transitions. Word has length 18 [2023-12-02 14:24:25,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:25,921 INFO L495 AbstractCegarLoop]: Abstraction has 3641 states and 11806 transitions. [2023-12-02 14:24:25,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 11806 transitions. [2023-12-02 14:24:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 14:24:25,928 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:25,929 INFO L195 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] [2023-12-02 14:24:25,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-02 14:24:26,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:26,129 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:26,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:26,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2125230648, now seen corresponding path program 1 times [2023-12-02 14:24:26,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:26,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792670373] [2023-12-02 14:24:26,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:26,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:26,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:26,132 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:24:26,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-02 14:24:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:26,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:24:26,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:26,296 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:24:26,296 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:24:26,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792670373] [2023-12-02 14:24:26,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792670373] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:26,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:26,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:24:26,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363813684] [2023-12-02 14:24:26,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:26,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:24:26,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:24:26,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:24:26,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:24:26,297 INFO L87 Difference]: Start difference. First operand 3641 states and 11806 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:26,443 INFO L93 Difference]: Finished difference Result 2013 states and 5996 transitions. [2023-12-02 14:24:26,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:24:26,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 14:24:26,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:26,447 INFO L225 Difference]: With dead ends: 2013 [2023-12-02 14:24:26,447 INFO L226 Difference]: Without dead ends: 1771 [2023-12-02 14:24:26,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:24:26,448 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 107 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:26,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 78 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:24:26,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2023-12-02 14:24:26,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1771. [2023-12-02 14:24:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1769 states have (on average 2.9739966082532505) internal successors, (5261), 1770 states have internal predecessors, (5261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:26,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 5261 transitions. [2023-12-02 14:24:26,501 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 5261 transitions. Word has length 23 [2023-12-02 14:24:26,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:26,501 INFO L495 AbstractCegarLoop]: Abstraction has 1771 states and 5261 transitions. [2023-12-02 14:24:26,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 5261 transitions. [2023-12-02 14:24:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 14:24:26,505 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:26,505 INFO L195 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, 1, 1, 1] [2023-12-02 14:24:26,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-02 14:24:26,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:26,706 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:26,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:26,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1095025023, now seen corresponding path program 1 times [2023-12-02 14:24:26,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:26,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001560632] [2023-12-02 14:24:26,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:26,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:26,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:26,708 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:24:26,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-02 14:24:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:26,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:24:26,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:26,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:24:26,859 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:24:26,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001560632] [2023-12-02 14:24:26,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001560632] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:26,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:26,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:24:26,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638771650] [2023-12-02 14:24:26,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:26,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:24:26,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:24:26,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:24:26,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:24:26,861 INFO L87 Difference]: Start difference. First operand 1771 states and 5261 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:27,057 INFO L93 Difference]: Finished difference Result 1139 states and 3353 transitions. [2023-12-02 14:24:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:24:27,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-02 14:24:27,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:27,061 INFO L225 Difference]: With dead ends: 1139 [2023-12-02 14:24:27,061 INFO L226 Difference]: Without dead ends: 1067 [2023-12-02 14:24:27,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-02 14:24:27,062 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 127 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:27,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 124 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:24:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2023-12-02 14:24:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1067. [2023-12-02 14:24:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1065 states have (on average 2.956807511737089) internal successors, (3149), 1066 states have internal predecessors, (3149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 3149 transitions. [2023-12-02 14:24:27,091 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 3149 transitions. Word has length 28 [2023-12-02 14:24:27,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:27,092 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 3149 transitions. [2023-12-02 14:24:27,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 3149 transitions. [2023-12-02 14:24:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 14:24:27,097 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:27,097 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:27,101 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-02 14:24:27,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:27,298 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:27,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:27,298 INFO L85 PathProgramCache]: Analyzing trace with hash 591532704, now seen corresponding path program 1 times [2023-12-02 14:24:27,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:27,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053388963] [2023-12-02 14:24:27,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:27,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:27,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:27,300 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:24:27,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-02 14:24:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:27,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 14:24:27,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:28,014 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1897~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1899~0#1.base_45| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1898~0#1.base_53| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1897~0#1.base_57| (_ bv1 1)))) (and (= (select (store .cse0 |v_ULTIMATE.start_main_~#t1898~0#1.base_53| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1899~0#1.base_45|) (_ bv0 1)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1897~0#1.base_57|) (_ bv0 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t1898~0#1.base_53|) (_ bv0 1)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1897~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1898~0#1.base_53| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1899~0#1.base_45| (_ bv0 1)))))) is different from true [2023-12-02 14:24:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:28,016 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:24:28,017 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:24:28,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053388963] [2023-12-02 14:24:28,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053388963] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:28,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:28,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:24:28,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138013325] [2023-12-02 14:24:28,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:28,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:24:28,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:24:28,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:24:28,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-12-02 14:24:28,019 INFO L87 Difference]: Start difference. First operand 1067 states and 3149 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:28,216 INFO L93 Difference]: Finished difference Result 1073 states and 3154 transitions. [2023-12-02 14:24:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:24:28,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-02 14:24:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:28,220 INFO L225 Difference]: With dead ends: 1073 [2023-12-02 14:24:28,220 INFO L226 Difference]: Without dead ends: 1071 [2023-12-02 14:24:28,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-12-02 14:24:28,221 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 26 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:28,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 91 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 77 Unchecked, 0.2s Time] [2023-12-02 14:24:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2023-12-02 14:24:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2023-12-02 14:24:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1069 states have (on average 2.9457436856875585) internal successors, (3149), 1070 states have internal predecessors, (3149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 3149 transitions. [2023-12-02 14:24:28,251 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 3149 transitions. Word has length 34 [2023-12-02 14:24:28,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:28,251 INFO L495 AbstractCegarLoop]: Abstraction has 1071 states and 3149 transitions. [2023-12-02 14:24:28,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 3149 transitions. [2023-12-02 14:24:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 14:24:28,256 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:28,256 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:28,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-02 14:24:28,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:28,459 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:28,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:28,460 INFO L85 PathProgramCache]: Analyzing trace with hash 591532227, now seen corresponding path program 1 times [2023-12-02 14:24:28,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:28,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26748271] [2023-12-02 14:24:28,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:28,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:28,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:28,462 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:24:28,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-02 14:24:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:28,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:24:28,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:28,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:24:28,657 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:24:28,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26748271] [2023-12-02 14:24:28,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26748271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:28,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:28,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 14:24:28,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152963901] [2023-12-02 14:24:28,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:28,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:24:28,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:24:28,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:24:28,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:24:28,660 INFO L87 Difference]: Start difference. First operand 1071 states and 3149 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:28,884 INFO L93 Difference]: Finished difference Result 2059 states and 5959 transitions. [2023-12-02 14:24:28,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:24:28,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-02 14:24:28,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:28,888 INFO L225 Difference]: With dead ends: 2059 [2023-12-02 14:24:28,889 INFO L226 Difference]: Without dead ends: 2052 [2023-12-02 14:24:28,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:24:28,889 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 53 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:28,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 135 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:24:28,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2023-12-02 14:24:28,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1512. [2023-12-02 14:24:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1510 states have (on average 2.9158940397350994) internal successors, (4403), 1511 states have internal predecessors, (4403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 4403 transitions. [2023-12-02 14:24:28,937 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 4403 transitions. Word has length 34 [2023-12-02 14:24:28,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:28,937 INFO L495 AbstractCegarLoop]: Abstraction has 1512 states and 4403 transitions. [2023-12-02 14:24:28,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:28,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 4403 transitions. [2023-12-02 14:24:28,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 14:24:28,942 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:28,942 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:28,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-02 14:24:29,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:29,146 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:29,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:29,146 INFO L85 PathProgramCache]: Analyzing trace with hash 244395003, now seen corresponding path program 2 times [2023-12-02 14:24:29,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:29,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745836133] [2023-12-02 14:24:29,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:24:29,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:29,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:29,148 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:24:29,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-02 14:24:29,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-02 14:24:29,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:24:29,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 14:24:29,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:24:29,684 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:24:29,684 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:24:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745836133] [2023-12-02 14:24:29,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745836133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:24:29,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:24:29,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 14:24:29,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012839949] [2023-12-02 14:24:29,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:24:29,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 14:24:29,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:24:29,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 14:24:29,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-02 14:24:29,686 INFO L87 Difference]: Start difference. First operand 1512 states and 4403 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:30,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:30,017 INFO L93 Difference]: Finished difference Result 2021 states and 5749 transitions. [2023-12-02 14:24:30,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 14:24:30,017 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-02 14:24:30,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:30,020 INFO L225 Difference]: With dead ends: 2021 [2023-12-02 14:24:30,020 INFO L226 Difference]: Without dead ends: 2014 [2023-12-02 14:24:30,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-12-02 14:24:30,021 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 97 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:30,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 264 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 14:24:30,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2023-12-02 14:24:30,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1410. [2023-12-02 14:24:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1408 states have (on average 2.9126420454545454) internal successors, (4101), 1409 states have internal predecessors, (4101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 4101 transitions. [2023-12-02 14:24:30,074 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 4101 transitions. Word has length 34 [2023-12-02 14:24:30,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:30,074 INFO L495 AbstractCegarLoop]: Abstraction has 1410 states and 4101 transitions. [2023-12-02 14:24:30,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:24:30,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 4101 transitions. [2023-12-02 14:24:30,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 14:24:30,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:30,078 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:30,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-02 14:24:30,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:30,279 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 14:24:30,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:30,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1519292357, now seen corresponding path program 3 times [2023-12-02 14:24:30,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:30,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323246805] [2023-12-02 14:24:30,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 14:24:30,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:30,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:30,281 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:24:30,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-02 14:24:30,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-02 14:24:30,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-02 14:24:30,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 14:24:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 14:24:30,535 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2023-12-02 14:24:30,535 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 14:24:30,536 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-12-02 14:24:30,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-12-02 14:24:30,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-12-02 14:24:30,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-12-02 14:24:30,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-12-02 14:24:30,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-12-02 14:24:30,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-12-02 14:24:30,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-12-02 14:24:30,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-12-02 14:24:30,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-12-02 14:24:30,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-12-02 14:24:30,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-12-02 14:24:30,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-12-02 14:24:30,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-02 14:24:30,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:30,744 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:24:30,749 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 14:24:30,749 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 14:24:30,802 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-12-02 14:24:30,804 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 14:24:30,807 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-12-02 14:24:30,816 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-12-02 14:24:30,817 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-12-02 14:24:30,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:24:30 BasicIcfg [2023-12-02 14:24:30,829 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 14:24:30,829 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 14:24:30,829 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 14:24:30,829 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 14:24:30,830 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:24:19" (3/4) ... [2023-12-02 14:24:30,831 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 14:24:30,832 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 14:24:30,833 INFO L158 Benchmark]: Toolchain (without parser) took 12914.25ms. Allocated memory was 109.1MB in the beginning and 964.7MB in the end (delta: 855.6MB). Free memory was 84.5MB in the beginning and 730.7MB in the end (delta: -646.3MB). Peak memory consumption was 212.5MB. Max. memory is 16.1GB. [2023-12-02 14:24:30,833 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 65.0MB. Free memory was 41.2MB in the beginning and 41.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 14:24:30,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.25ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 60.4MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 14:24:30,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.04ms. Allocated memory is still 109.1MB. Free memory was 60.1MB in the beginning and 57.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 14:24:30,834 INFO L158 Benchmark]: Boogie Preprocessor took 35.92ms. Allocated memory is still 109.1MB. Free memory was 57.7MB in the beginning and 55.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 14:24:30,834 INFO L158 Benchmark]: RCFGBuilder took 771.61ms. Allocated memory is still 109.1MB. Free memory was 55.6MB in the beginning and 75.9MB in the end (delta: -20.3MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2023-12-02 14:24:30,835 INFO L158 Benchmark]: TraceAbstraction took 11570.35ms. Allocated memory was 109.1MB in the beginning and 964.7MB in the end (delta: 855.6MB). Free memory was 75.2MB in the beginning and 730.7MB in the end (delta: -655.5MB). Peak memory consumption was 201.2MB. Max. memory is 16.1GB. [2023-12-02 14:24:30,835 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 964.7MB. Free memory is still 730.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 14:24:30,837 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.32ms. Allocated memory is still 65.0MB. Free memory was 41.2MB in the beginning and 41.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.25ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 60.4MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.04ms. Allocated memory is still 109.1MB. Free memory was 60.1MB in the beginning and 57.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.92ms. Allocated memory is still 109.1MB. Free memory was 57.7MB in the beginning and 55.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 771.61ms. Allocated memory is still 109.1MB. Free memory was 55.6MB in the beginning and 75.9MB in the end (delta: -20.3MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11570.35ms. Allocated memory was 109.1MB in the beginning and 964.7MB in the end (delta: 855.6MB). Free memory was 75.2MB in the beginning and 730.7MB in the end (delta: -655.5MB). Peak memory consumption was 201.2MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 964.7MB. Free memory is still 730.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={3:0}, t1898={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={3:0}, t1898={7:0}, t1899={15:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={3:0}, t1898={7:0}, t1899={15:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={3:0}, t1898={7:0}, t1899={15:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={3:0}, t1898={7:0}, t1899={15:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 79 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 720 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 720 mSDsluCounter, 1006 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 77 IncrementalHoareTripleChecker+Unchecked, 646 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1133 IncrementalHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 360 mSDtfsCounter, 1133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6805occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 1144 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 196 ConstructedInterpolants, 1 QuantifiedInterpolants, 1796 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1442 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-02 14:24:30,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e79a240a-5e7a-478a-9a1f-d814c0f7123e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample