./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:18:05,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:18:05,098 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 15:18:05,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:18:05,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:18:05,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:18:05,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:18:05,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:18:05,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:18:05,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:18:05,129 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:18:05,129 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:18:05,130 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:18:05,130 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:18:05,131 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:18:05,131 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:18:05,132 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:18:05,132 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:18:05,133 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:18:05,133 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:18:05,134 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:18:05,134 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:18:05,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 15:18:05,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 15:18:05,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:18:05,136 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:18:05,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:18:05,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:18:05,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:18:05,137 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 15:18:05,138 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 15:18:05,138 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 15:18:05,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:18:05,139 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:18:05,139 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:18:05,139 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:18:05,139 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:18:05,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:18:05,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:18:05,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:18:05,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:18:05,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:18:05,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:18:05,141 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:18:05,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:18:05,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:18:05,141 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:18:05,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:18:05,142 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_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 -> 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5 [2023-12-02 15:18:05,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:18:05,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:18:05,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:18:05,407 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:18:05,407 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:18:05,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-wmm/mix000.oepc.i [2023-12-02 15:18:08,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:18:08,373 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:18:08,374 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/sv-benchmarks/c/pthread-wmm/mix000.oepc.i [2023-12-02 15:18:08,388 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/data/f3ef0e009/03b19562c262463fa97f3da5b1bf3474/FLAGf42adb613 [2023-12-02 15:18:08,403 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/data/f3ef0e009/03b19562c262463fa97f3da5b1bf3474 [2023-12-02 15:18:08,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:18:08,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:18:08,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:18:08,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:18:08,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:18:08,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:18:08" (1/1) ... [2023-12-02 15:18:08,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b56f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:08, skipping insertion in model container [2023-12-02 15:18:08,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:18:08" (1/1) ... [2023-12-02 15:18:08,457 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:18:08,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:18:08,785 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:18:08,839 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:18:08,868 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:18:08,868 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:18:08,874 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:18:08,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:08 WrapperNode [2023-12-02 15:18:08,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:18:08,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:18:08,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:18:08,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:18:08,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:08" (1/1) ... [2023-12-02 15:18:08,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:08" (1/1) ... [2023-12-02 15:18:08,926 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 140 [2023-12-02 15:18:08,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:18:08,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:18:08,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:18:08,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:18:08,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:08" (1/1) ... [2023-12-02 15:18:08,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:08" (1/1) ... [2023-12-02 15:18:08,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:08" (1/1) ... [2023-12-02 15:18:08,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:08" (1/1) ... [2023-12-02 15:18:08,950 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:08" (1/1) ... [2023-12-02 15:18:08,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:08" (1/1) ... [2023-12-02 15:18:08,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:08" (1/1) ... [2023-12-02 15:18:08,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:08" (1/1) ... [2023-12-02 15:18:08,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:18:08,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:18:08,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:18:08,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:18:08,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:08" (1/1) ... [2023-12-02 15:18:08,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:18:08,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:18:09,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:18:09,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:18:09,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 15:18:09,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 15:18:09,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:18:09,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 15:18:09,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:18:09,047 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-02 15:18:09,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-02 15:18:09,047 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-02 15:18:09,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-02 15:18:09,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:18:09,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 15:18:09,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:18:09,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:18:09,050 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 15:18:09,180 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:18:09,182 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:18:09,498 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:18:09,694 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:18:09,694 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 15:18:09,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:18:09 BoogieIcfgContainer [2023-12-02 15:18:09,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:18:09,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:18:09,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:18:09,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:18:09,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:18:08" (1/3) ... [2023-12-02 15:18:09,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af1bc03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:18:09, skipping insertion in model container [2023-12-02 15:18:09,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:08" (2/3) ... [2023-12-02 15:18:09,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af1bc03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:18:09, skipping insertion in model container [2023-12-02 15:18:09,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:18:09" (3/3) ... [2023-12-02 15:18:09,703 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i [2023-12-02 15:18:09,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:18:09,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-12-02 15:18:09,723 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 15:18:09,769 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 15:18:09,798 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 43 transitions, 94 flow [2023-12-02 15:18:09,872 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1082 states, 1071 states have (on average 2.8095238095238093) internal successors, (3009), 1081 states have internal predecessors, (3009), 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 15:18:09,886 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:18:09,892 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;@f3b5181, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:18:09,893 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-12-02 15:18:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 1082 states, 1071 states have (on average 2.8095238095238093) internal successors, (3009), 1081 states have internal predecessors, (3009), 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 15:18:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 15:18:09,903 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:09,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 15:18:09,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:09,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash 12857, now seen corresponding path program 1 times [2023-12-02 15:18:09,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:09,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940296732] [2023-12-02 15:18:09,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:09,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:10,169 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 15:18:10,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:10,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940296732] [2023-12-02 15:18:10,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940296732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:10,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:10,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:18:10,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166803736] [2023-12-02 15:18:10,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:10,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:18:10,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:10,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:18:10,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:18:10,201 INFO L87 Difference]: Start difference. First operand has 1082 states, 1071 states have (on average 2.8095238095238093) internal successors, (3009), 1081 states have internal predecessors, (3009), 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 15:18:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:10,311 INFO L93 Difference]: Finished difference Result 1009 states and 2665 transitions. [2023-12-02 15:18:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:18:10,313 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 15:18:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:10,334 INFO L225 Difference]: With dead ends: 1009 [2023-12-02 15:18:10,335 INFO L226 Difference]: Without dead ends: 1009 [2023-12-02 15:18:10,336 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 15:18:10,340 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:10,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 21 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2023-12-02 15:18:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2023-12-02 15:18:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 999 states have (on average 2.6676676676676676) internal successors, (2665), 1008 states have internal predecessors, (2665), 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 15:18:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 2665 transitions. [2023-12-02 15:18:10,436 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 2665 transitions. Word has length 2 [2023-12-02 15:18:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:10,436 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 2665 transitions. [2023-12-02 15:18:10,436 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 15:18:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 2665 transitions. [2023-12-02 15:18:10,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 15:18:10,437 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:10,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 15:18:10,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 15:18:10,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:10,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:10,439 INFO L85 PathProgramCache]: Analyzing trace with hash 12858, now seen corresponding path program 1 times [2023-12-02 15:18:10,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:10,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008221599] [2023-12-02 15:18:10,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:10,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:10,543 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 15:18:10,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:10,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008221599] [2023-12-02 15:18:10,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008221599] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:10,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:10,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:18:10,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499560161] [2023-12-02 15:18:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:10,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:18:10,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:10,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:18:10,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:18:10,547 INFO L87 Difference]: Start difference. First operand 1009 states and 2665 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 15:18:10,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:10,622 INFO L93 Difference]: Finished difference Result 1008 states and 2664 transitions. [2023-12-02 15:18:10,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:18:10,623 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 15:18:10,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:10,631 INFO L225 Difference]: With dead ends: 1008 [2023-12-02 15:18:10,631 INFO L226 Difference]: Without dead ends: 1008 [2023-12-02 15:18:10,632 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 15:18:10,633 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:10,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 22 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2023-12-02 15:18:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2023-12-02 15:18:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 999 states have (on average 2.6666666666666665) internal successors, (2664), 1007 states have internal predecessors, (2664), 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 15:18:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 2664 transitions. [2023-12-02 15:18:10,672 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 2664 transitions. Word has length 2 [2023-12-02 15:18:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:10,673 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 2664 transitions. [2023-12-02 15:18:10,673 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 15:18:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 2664 transitions. [2023-12-02 15:18:10,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 15:18:10,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:10,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 15:18:10,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 15:18:10,674 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:10,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash 383379756, now seen corresponding path program 1 times [2023-12-02 15:18:10,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:10,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942703278] [2023-12-02 15:18:10,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:10,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:10,734 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 15:18:10,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:10,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942703278] [2023-12-02 15:18:10,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942703278] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:10,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:10,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:18:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707072480] [2023-12-02 15:18:10,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:10,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:18:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:10,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:18:10,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:18:10,737 INFO L87 Difference]: Start difference. First operand 1008 states and 2664 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 15:18:10,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:10,809 INFO L93 Difference]: Finished difference Result 999 states and 2647 transitions. [2023-12-02 15:18:10,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:18:10,810 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 15:18:10,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:10,816 INFO L225 Difference]: With dead ends: 999 [2023-12-02 15:18:10,816 INFO L226 Difference]: Without dead ends: 999 [2023-12-02 15:18:10,817 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 15:18:10,818 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 24 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 15:18:10,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 24 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2023-12-02 15:18:10,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 999. [2023-12-02 15:18:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 992 states have (on average 2.6683467741935485) internal successors, (2647), 998 states have internal predecessors, (2647), 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 15:18:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 2647 transitions. [2023-12-02 15:18:10,845 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 2647 transitions. Word has length 5 [2023-12-02 15:18:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:10,845 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 2647 transitions. [2023-12-02 15:18:10,845 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 15:18:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 2647 transitions. [2023-12-02 15:18:10,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 15:18:10,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:10,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 15:18:10,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 15:18:10,846 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:10,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:10,847 INFO L85 PathProgramCache]: Analyzing trace with hash 383379757, now seen corresponding path program 1 times [2023-12-02 15:18:10,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:10,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038096112] [2023-12-02 15:18:10,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:10,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:18:10,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:10,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038096112] [2023-12-02 15:18:10,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038096112] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:10,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:10,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:18:10,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96317262] [2023-12-02 15:18:10,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:10,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:18:10,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:10,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:18:10,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:18:10,941 INFO L87 Difference]: Start difference. First operand 999 states and 2647 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 15:18:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:11,011 INFO L93 Difference]: Finished difference Result 990 states and 2630 transitions. [2023-12-02 15:18:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:18:11,012 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 15:18:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:11,018 INFO L225 Difference]: With dead ends: 990 [2023-12-02 15:18:11,018 INFO L226 Difference]: Without dead ends: 990 [2023-12-02 15:18:11,018 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 15:18:11,019 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:11,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 25 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2023-12-02 15:18:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2023-12-02 15:18:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 985 states have (on average 2.6700507614213196) internal successors, (2630), 989 states have internal predecessors, (2630), 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 15:18:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 2630 transitions. [2023-12-02 15:18:11,044 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 2630 transitions. Word has length 5 [2023-12-02 15:18:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:11,044 INFO L495 AbstractCegarLoop]: Abstraction has 990 states and 2630 transitions. [2023-12-02 15:18:11,045 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 15:18:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 2630 transitions. [2023-12-02 15:18:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 15:18:11,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:11,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 15:18:11,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 15:18:11,046 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:11,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:11,046 INFO L85 PathProgramCache]: Analyzing trace with hash 383380848, now seen corresponding path program 1 times [2023-12-02 15:18:11,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:11,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218754913] [2023-12-02 15:18:11,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:11,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:11,130 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 15:18:11,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:11,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218754913] [2023-12-02 15:18:11,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218754913] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:11,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:11,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:18:11,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166535320] [2023-12-02 15:18:11,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:11,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:18:11,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:11,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:18:11,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:18:11,132 INFO L87 Difference]: Start difference. First operand 990 states and 2630 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 15:18:11,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:11,195 INFO L93 Difference]: Finished difference Result 875 states and 2310 transitions. [2023-12-02 15:18:11,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:18:11,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 15:18:11,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:11,203 INFO L225 Difference]: With dead ends: 875 [2023-12-02 15:18:11,203 INFO L226 Difference]: Without dead ends: 859 [2023-12-02 15:18:11,203 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 15:18:11,204 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:11,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2023-12-02 15:18:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2023-12-02 15:18:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 857 states have (on average 2.651108518086348) internal successors, (2272), 858 states have internal predecessors, (2272), 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 15:18:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 2272 transitions. [2023-12-02 15:18:11,234 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 2272 transitions. Word has length 5 [2023-12-02 15:18:11,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:11,234 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 2272 transitions. [2023-12-02 15:18:11,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 15:18:11,235 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 2272 transitions. [2023-12-02 15:18:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 15:18:11,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:11,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:18:11,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 15:18:11,238 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:11,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:11,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1534597448, now seen corresponding path program 1 times [2023-12-02 15:18:11,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:11,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638588171] [2023-12-02 15:18:11,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:11,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:11,524 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 15:18:11,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:11,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638588171] [2023-12-02 15:18:11,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638588171] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:11,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:11,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:18:11,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315352757] [2023-12-02 15:18:11,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:11,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:18:11,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:11,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:18:11,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:18:11,527 INFO L87 Difference]: Start difference. First operand 859 states and 2272 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:11,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:11,711 INFO L93 Difference]: Finished difference Result 795 states and 2096 transitions. [2023-12-02 15:18:11,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:18:11,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 15:18:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:11,718 INFO L225 Difference]: With dead ends: 795 [2023-12-02 15:18:11,718 INFO L226 Difference]: Without dead ends: 667 [2023-12-02 15:18:11,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:18:11,719 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:11,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 79 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:18:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2023-12-02 15:18:11,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2023-12-02 15:18:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 2.6186186186186187) internal successors, (1744), 666 states have internal predecessors, (1744), 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 15:18:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1744 transitions. [2023-12-02 15:18:11,742 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1744 transitions. Word has length 15 [2023-12-02 15:18:11,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:11,743 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 1744 transitions. [2023-12-02 15:18:11,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1744 transitions. [2023-12-02 15:18:11,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 15:18:11,746 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:11,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:18:11,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 15:18:11,746 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:11,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:11,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1534597561, now seen corresponding path program 1 times [2023-12-02 15:18:11,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:11,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018643093] [2023-12-02 15:18:11,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:11,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:11,926 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 15:18:11,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:11,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018643093] [2023-12-02 15:18:11,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018643093] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:11,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:11,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:18:11,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120087309] [2023-12-02 15:18:11,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:11,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:18:11,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:11,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:18:11,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:18:11,928 INFO L87 Difference]: Start difference. First operand 667 states and 1744 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:12,124 INFO L93 Difference]: Finished difference Result 675 states and 1711 transitions. [2023-12-02 15:18:12,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:18:12,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 15:18:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:12,128 INFO L225 Difference]: With dead ends: 675 [2023-12-02 15:18:12,129 INFO L226 Difference]: Without dead ends: 547 [2023-12-02 15:18:12,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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 15:18:12,130 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 55 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:12,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:12,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2023-12-02 15:18:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2023-12-02 15:18:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 2.562271062271062) internal successors, (1399), 546 states have internal predecessors, (1399), 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 15:18:12,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1399 transitions. [2023-12-02 15:18:12,159 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1399 transitions. Word has length 15 [2023-12-02 15:18:12,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:12,160 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 1399 transitions. [2023-12-02 15:18:12,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:12,160 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1399 transitions. [2023-12-02 15:18:12,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 15:18:12,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:12,162 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 15:18:12,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 15:18:12,163 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:12,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1137757095, now seen corresponding path program 1 times [2023-12-02 15:18:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348335284] [2023-12-02 15:18:12,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:12,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:12,346 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 15:18:12,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:12,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348335284] [2023-12-02 15:18:12,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348335284] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:12,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:12,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:18:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261032985] [2023-12-02 15:18:12,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:12,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:18:12,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:12,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:18:12,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:18:12,349 INFO L87 Difference]: Start difference. First operand 547 states and 1399 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 15:18:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:12,515 INFO L93 Difference]: Finished difference Result 552 states and 1378 transitions. [2023-12-02 15:18:12,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:18:12,515 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 15:18:12,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:12,519 INFO L225 Difference]: With dead ends: 552 [2023-12-02 15:18:12,519 INFO L226 Difference]: Without dead ends: 472 [2023-12-02 15:18:12,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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 15:18:12,520 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:12,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 64 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2023-12-02 15:18:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2023-12-02 15:18:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 2.524416135881104) internal successors, (1189), 471 states have internal predecessors, (1189), 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 15:18:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1189 transitions. [2023-12-02 15:18:12,535 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1189 transitions. Word has length 18 [2023-12-02 15:18:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:12,535 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 1189 transitions. [2023-12-02 15:18:12,535 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 15:18:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1189 transitions. [2023-12-02 15:18:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 15:18:12,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:12,537 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] [2023-12-02 15:18:12,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 15:18:12,537 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:12,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:12,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1445597991, now seen corresponding path program 1 times [2023-12-02 15:18:12,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:12,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429011839] [2023-12-02 15:18:12,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:12,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:12,702 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 15:18:12,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:12,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429011839] [2023-12-02 15:18:12,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429011839] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:12,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:12,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:18:12,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117118732] [2023-12-02 15:18:12,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:12,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:18:12,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:12,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:18:12,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:18:12,705 INFO L87 Difference]: Start difference. First operand 472 states and 1189 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:12,794 INFO L93 Difference]: Finished difference Result 383 states and 878 transitions. [2023-12-02 15:18:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:18:12,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 15:18:12,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:12,797 INFO L225 Difference]: With dead ends: 383 [2023-12-02 15:18:12,797 INFO L226 Difference]: Without dead ends: 319 [2023-12-02 15:18:12,797 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 15:18:12,798 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 44 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:12,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 29 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-12-02 15:18:12,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2023-12-02 15:18:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 2.2955974842767297) internal successors, (730), 318 states have internal predecessors, (730), 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 15:18:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 730 transitions. [2023-12-02 15:18:12,810 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 730 transitions. Word has length 21 [2023-12-02 15:18:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:12,810 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 730 transitions. [2023-12-02 15:18:12,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 730 transitions. [2023-12-02 15:18:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 15:18:12,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:12,812 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] [2023-12-02 15:18:12,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 15:18:12,812 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:12,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash -48900569, now seen corresponding path program 1 times [2023-12-02 15:18:12,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:12,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370680929] [2023-12-02 15:18:12,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:12,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:13,015 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 15:18:13,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:13,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370680929] [2023-12-02 15:18:13,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370680929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:13,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:13,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:18:13,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847116258] [2023-12-02 15:18:13,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:13,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:18:13,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:13,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:18:13,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:18:13,017 INFO L87 Difference]: Start difference. First operand 319 states and 730 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 15:18:13,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:13,099 INFO L93 Difference]: Finished difference Result 215 states and 464 transitions. [2023-12-02 15:18:13,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:18:13,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2023-12-02 15:18:13,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:13,101 INFO L225 Difference]: With dead ends: 215 [2023-12-02 15:18:13,101 INFO L226 Difference]: Without dead ends: 187 [2023-12-02 15:18:13,101 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 15:18:13,102 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 66 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:13,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 22 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:13,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-02 15:18:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2023-12-02 15:18:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 2.150537634408602) internal successors, (400), 186 states have internal predecessors, (400), 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 15:18:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 400 transitions. [2023-12-02 15:18:13,108 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 400 transitions. Word has length 24 [2023-12-02 15:18:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:13,109 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 400 transitions. [2023-12-02 15:18:13,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 15:18:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 400 transitions. [2023-12-02 15:18:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:18:13,110 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:13,110 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] [2023-12-02 15:18:13,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 15:18:13,110 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:13,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1444482966, now seen corresponding path program 1 times [2023-12-02 15:18:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:13,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831224049] [2023-12-02 15:18:13,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:13,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:14,585 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 15:18:14,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:14,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831224049] [2023-12-02 15:18:14,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831224049] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:14,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:14,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 15:18:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982188547] [2023-12-02 15:18:14,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:14,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:18:14,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:14,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:18:14,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:18:14,587 INFO L87 Difference]: Start difference. First operand 187 states and 400 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:15,001 INFO L93 Difference]: Finished difference Result 287 states and 606 transitions. [2023-12-02 15:18:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 15:18:15,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-02 15:18:15,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:15,005 INFO L225 Difference]: With dead ends: 287 [2023-12-02 15:18:15,005 INFO L226 Difference]: Without dead ends: 210 [2023-12-02 15:18:15,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-12-02 15:18:15,006 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 100 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:15,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 118 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:18:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-12-02 15:18:15,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 154. [2023-12-02 15:18:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.104575163398693) internal successors, (322), 153 states have internal predecessors, (322), 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 15:18:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 322 transitions. [2023-12-02 15:18:15,011 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 322 transitions. Word has length 27 [2023-12-02 15:18:15,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:15,011 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 322 transitions. [2023-12-02 15:18:15,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 322 transitions. [2023-12-02 15:18:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:18:15,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:15,012 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] [2023-12-02 15:18:15,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 15:18:15,013 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:15,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:15,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1720928180, now seen corresponding path program 2 times [2023-12-02 15:18:15,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:15,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611031846] [2023-12-02 15:18:15,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:15,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:18:15,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 15:18:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:18:15,122 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 15:18:15,122 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 15:18:15,123 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-12-02 15:18:15,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-12-02 15:18:15,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-12-02 15:18:15,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-12-02 15:18:15,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-12-02 15:18:15,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-12-02 15:18:15,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-12-02 15:18:15,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-12-02 15:18:15,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-12-02 15:18:15,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-12-02 15:18:15,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 15:18:15,129 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:18:15,133 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 15:18:15,133 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:18:15,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 15:18:15,172 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-12-02 15:18:15,181 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-12-02 15:18:15,182 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-12-02 15:18:15,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:18:15 BasicIcfg [2023-12-02 15:18:15,191 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:18:15,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:18:15,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:18:15,192 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:18:15,192 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:18:09" (3/4) ... [2023-12-02 15:18:15,194 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 15:18:15,194 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:18:15,195 INFO L158 Benchmark]: Toolchain (without parser) took 6788.88ms. Allocated memory was 130.0MB in the beginning and 213.9MB in the end (delta: 83.9MB). Free memory was 88.2MB in the beginning and 71.7MB in the end (delta: 16.4MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. [2023-12-02 15:18:15,195 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:18:15,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.93ms. Allocated memory is still 130.0MB. Free memory was 87.9MB in the beginning and 63.7MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-12-02 15:18:15,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.79ms. Allocated memory is still 130.0MB. Free memory was 63.7MB in the beginning and 61.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:18:15,196 INFO L158 Benchmark]: Boogie Preprocessor took 34.97ms. Allocated memory is still 130.0MB. Free memory was 61.0MB in the beginning and 58.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:18:15,196 INFO L158 Benchmark]: RCFGBuilder took 731.92ms. Allocated memory was 130.0MB in the beginning and 176.2MB in the end (delta: 46.1MB). Free memory was 58.9MB in the beginning and 106.4MB in the end (delta: -47.5MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2023-12-02 15:18:15,197 INFO L158 Benchmark]: TraceAbstraction took 5494.29ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 105.5MB in the beginning and 72.8MB in the end (delta: 32.7MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2023-12-02 15:18:15,197 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 213.9MB. Free memory was 72.8MB in the beginning and 71.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:18:15,199 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.16ms. Allocated memory is still 130.0MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.93ms. Allocated memory is still 130.0MB. Free memory was 87.9MB in the beginning and 63.7MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.79ms. Allocated memory is still 130.0MB. Free memory was 63.7MB in the beginning and 61.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.97ms. Allocated memory is still 130.0MB. Free memory was 61.0MB in the beginning and 58.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 731.92ms. Allocated memory was 130.0MB in the beginning and 176.2MB in the end (delta: 46.1MB). Free memory was 58.9MB in the beginning and 106.4MB in the end (delta: -47.5MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5494.29ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 105.5MB in the beginning and 72.8MB in the end (delta: 32.7MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 213.9MB. Free memory was 72.8MB in the beginning and 71.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t0; [L832] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L833] 0 pthread_t t1; [L834] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 1 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L787] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 y$flush_delayed = weak$$choice2 [L796] 2 y$mem_tmp = y [L797] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L798] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L799] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L800] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L801] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L803] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = y [L805] 2 y = y$flush_delayed ? y$mem_tmp : y [L806] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L775] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L776] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L777] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L849] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 __assert_fail ("0", "mix000.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 61 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 490 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 490 mSDsluCounter, 504 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 321 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 783 IncrementalHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 183 mSDtfsCounter, 783 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1082occurred in iteration=0, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 56 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 877 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 15:18:15,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:18:17,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:18:17,237 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 15:18:17,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:18:17,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:18:17,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:18:17,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:18:17,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:18:17,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:18:17,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:18:17,275 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:18:17,276 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:18:17,276 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:18:17,277 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:18:17,277 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:18:17,278 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:18:17,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 15:18:17,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 15:18:17,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:18:17,280 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:18:17,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:18:17,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:18:17,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:18:17,283 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 15:18:17,283 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 15:18:17,284 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 15:18:17,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:18:17,284 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:18:17,285 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 15:18:17,285 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 15:18:17,286 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:18:17,286 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:18:17,286 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:18:17,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:18:17,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 15:18:17,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:18:17,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:18:17,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:18:17,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:18:17,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:18:17,288 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 15:18:17,289 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 15:18:17,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:18:17,289 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:18:17,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:18:17,289 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_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 -> 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5 [2023-12-02 15:18:17,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:18:17,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:18:17,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:18:17,588 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:18:17,588 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:18:17,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-wmm/mix000.oepc.i [2023-12-02 15:18:20,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:18:20,622 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:18:20,623 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/sv-benchmarks/c/pthread-wmm/mix000.oepc.i [2023-12-02 15:18:20,639 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/data/e2979244e/b7edc35b7f9248caa7c075b3f69bfb97/FLAG93e9e63e9 [2023-12-02 15:18:20,651 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/data/e2979244e/b7edc35b7f9248caa7c075b3f69bfb97 [2023-12-02 15:18:20,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:18:20,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:18:20,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:18:20,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:18:20,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:18:20,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:18:20" (1/1) ... [2023-12-02 15:18:20,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154c8490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:20, skipping insertion in model container [2023-12-02 15:18:20,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:18:20" (1/1) ... [2023-12-02 15:18:20,711 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:18:21,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:18:21,049 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:18:21,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:18:21,176 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:18:21,176 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:18:21,184 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:18:21,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:21 WrapperNode [2023-12-02 15:18:21,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:18:21,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:18:21,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:18:21,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:18:21,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:21" (1/1) ... [2023-12-02 15:18:21,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:21" (1/1) ... [2023-12-02 15:18:21,238 INFO L138 Inliner]: procedures = 178, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 141 [2023-12-02 15:18:21,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:18:21,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:18:21,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:18:21,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:18:21,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:21" (1/1) ... [2023-12-02 15:18:21,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:21" (1/1) ... [2023-12-02 15:18:21,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:21" (1/1) ... [2023-12-02 15:18:21,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:21" (1/1) ... [2023-12-02 15:18:21,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:21" (1/1) ... [2023-12-02 15:18:21,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:21" (1/1) ... [2023-12-02 15:18:21,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:21" (1/1) ... [2023-12-02 15:18:21,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:21" (1/1) ... [2023-12-02 15:18:21,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:18:21,274 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:18:21,274 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:18:21,274 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:18:21,275 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:21" (1/1) ... [2023-12-02 15:18:21,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:18:21,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:18:21,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:18:21,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:18:21,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 15:18:21,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:18:21,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 15:18:21,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:18:21,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 15:18:21,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 15:18:21,345 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-02 15:18:21,345 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-02 15:18:21,345 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-02 15:18:21,345 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-02 15:18:21,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 15:18:21,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:18:21,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:18:21,347 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 15:18:21,497 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:18:21,499 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:18:21,830 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:18:22,028 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:18:22,028 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 15:18:22,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:18:22 BoogieIcfgContainer [2023-12-02 15:18:22,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:18:22,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:18:22,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:18:22,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:18:22,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:18:20" (1/3) ... [2023-12-02 15:18:22,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2597a2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:18:22, skipping insertion in model container [2023-12-02 15:18:22,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:18:21" (2/3) ... [2023-12-02 15:18:22,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2597a2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:18:22, skipping insertion in model container [2023-12-02 15:18:22,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:18:22" (3/3) ... [2023-12-02 15:18:22,036 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i [2023-12-02 15:18:22,051 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:18:22,051 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-12-02 15:18:22,052 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 15:18:22,096 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 15:18:22,117 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 43 transitions, 94 flow [2023-12-02 15:18:22,187 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1082 states, 1071 states have (on average 2.8095238095238093) internal successors, (3009), 1081 states have internal predecessors, (3009), 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 15:18:22,203 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:18:22,208 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;@26e77c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:18:22,209 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-12-02 15:18:22,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 1082 states, 1071 states have (on average 2.8095238095238093) internal successors, (3009), 1081 states have internal predecessors, (3009), 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 15:18:22,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 15:18:22,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:22,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 15:18:22,220 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:22,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash 12921, now seen corresponding path program 1 times [2023-12-02 15:18:22,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:18:22,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737314200] [2023-12-02 15:18:22,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:22,235 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 15:18:22,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:18:22,238 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:22,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:22,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:18:22,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:22,452 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 15:18:22,465 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 15:18:22,466 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:18:22,466 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:18:22,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737314200] [2023-12-02 15:18:22,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737314200] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:22,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:22,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:18:22,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991376034] [2023-12-02 15:18:22,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:22,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:18:22,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:18:22,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:18:22,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:18:22,509 INFO L87 Difference]: Start difference. First operand has 1082 states, 1071 states have (on average 2.8095238095238093) internal successors, (3009), 1081 states have internal predecessors, (3009), 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 15:18:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:22,648 INFO L93 Difference]: Finished difference Result 1009 states and 2665 transitions. [2023-12-02 15:18:22,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:18:22,650 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 15:18:22,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:22,671 INFO L225 Difference]: With dead ends: 1009 [2023-12-02 15:18:22,671 INFO L226 Difference]: Without dead ends: 1009 [2023-12-02 15:18:22,672 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 15:18:22,675 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:22,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 21 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2023-12-02 15:18:22,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2023-12-02 15:18:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 999 states have (on average 2.6676676676676676) internal successors, (2665), 1008 states have internal predecessors, (2665), 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 15:18:22,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 2665 transitions. [2023-12-02 15:18:22,777 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 2665 transitions. Word has length 2 [2023-12-02 15:18:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:22,777 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 2665 transitions. [2023-12-02 15:18:22,777 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 15:18:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 2665 transitions. [2023-12-02 15:18:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 15:18:22,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:22,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 15:18:22,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:22,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:22,980 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:22,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:22,981 INFO L85 PathProgramCache]: Analyzing trace with hash 12922, now seen corresponding path program 1 times [2023-12-02 15:18:22,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:18:22,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185486297] [2023-12-02 15:18:22,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:22,982 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 15:18:22,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:18:22,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:22,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:23,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:18:23,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:23,078 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 15:18:23,089 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 15:18:23,089 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:18:23,089 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:18:23,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185486297] [2023-12-02 15:18:23,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185486297] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:23,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:23,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:18:23,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540420526] [2023-12-02 15:18:23,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:23,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:18:23,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:18:23,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:18:23,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:18:23,092 INFO L87 Difference]: Start difference. First operand 1009 states and 2665 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 15:18:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:23,193 INFO L93 Difference]: Finished difference Result 1008 states and 2664 transitions. [2023-12-02 15:18:23,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:18:23,194 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 15:18:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:23,202 INFO L225 Difference]: With dead ends: 1008 [2023-12-02 15:18:23,202 INFO L226 Difference]: Without dead ends: 1008 [2023-12-02 15:18:23,203 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 15:18:23,204 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:23,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 22 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2023-12-02 15:18:23,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2023-12-02 15:18:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 999 states have (on average 2.6666666666666665) internal successors, (2664), 1007 states have internal predecessors, (2664), 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 15:18:23,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 2664 transitions. [2023-12-02 15:18:23,246 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 2664 transitions. Word has length 2 [2023-12-02 15:18:23,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:23,246 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 2664 transitions. [2023-12-02 15:18:23,247 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 15:18:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 2664 transitions. [2023-12-02 15:18:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 15:18:23,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:23,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 15:18:23,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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)] Forceful destruction successful, exit code 0 [2023-12-02 15:18:23,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:23,449 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:23,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:23,450 INFO L85 PathProgramCache]: Analyzing trace with hash 385288366, now seen corresponding path program 1 times [2023-12-02 15:18:23,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:18:23,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870272741] [2023-12-02 15:18:23,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:23,451 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 15:18:23,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:18:23,452 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:23,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:23,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:18:23,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:23,528 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 15:18:23,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 15:18:23,534 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:18:23,534 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:18:23,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870272741] [2023-12-02 15:18:23,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870272741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:23,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:23,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:18:23,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688814622] [2023-12-02 15:18:23,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:23,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:18:23,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:18:23,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:18:23,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:18:23,537 INFO L87 Difference]: Start difference. First operand 1008 states and 2664 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 15:18:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:23,630 INFO L93 Difference]: Finished difference Result 999 states and 2647 transitions. [2023-12-02 15:18:23,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:18:23,631 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 15:18:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:23,639 INFO L225 Difference]: With dead ends: 999 [2023-12-02 15:18:23,639 INFO L226 Difference]: Without dead ends: 999 [2023-12-02 15:18:23,639 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 15:18:23,641 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 24 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 15:18:23,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 24 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2023-12-02 15:18:23,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 999. [2023-12-02 15:18:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 992 states have (on average 2.6683467741935485) internal successors, (2647), 998 states have internal predecessors, (2647), 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 15:18:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 2647 transitions. [2023-12-02 15:18:23,697 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 2647 transitions. Word has length 5 [2023-12-02 15:18:23,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:23,697 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 2647 transitions. [2023-12-02 15:18:23,697 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 15:18:23,698 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 2647 transitions. [2023-12-02 15:18:23,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 15:18:23,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:23,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 15:18:23,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:23,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:23,899 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:23,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash 385288367, now seen corresponding path program 1 times [2023-12-02 15:18:23,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:18:23,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678905089] [2023-12-02 15:18:23,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:23,900 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 15:18:23,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:18:23,901 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:23,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:23,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:18:23,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:23,981 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 15:18:23,990 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 15:18:23,990 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:18:23,990 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:18:23,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678905089] [2023-12-02 15:18:23,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678905089] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:23,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:23,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:18:23,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630663405] [2023-12-02 15:18:23,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:23,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:18:23,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:18:23,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:18:23,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:18:23,992 INFO L87 Difference]: Start difference. First operand 999 states and 2647 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 15:18:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:24,092 INFO L93 Difference]: Finished difference Result 990 states and 2630 transitions. [2023-12-02 15:18:24,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:18:24,093 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 15:18:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:24,101 INFO L225 Difference]: With dead ends: 990 [2023-12-02 15:18:24,101 INFO L226 Difference]: Without dead ends: 990 [2023-12-02 15:18:24,101 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 15:18:24,102 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:24,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 25 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2023-12-02 15:18:24,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2023-12-02 15:18:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 985 states have (on average 2.6700507614213196) internal successors, (2630), 989 states have internal predecessors, (2630), 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 15:18:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 2630 transitions. [2023-12-02 15:18:24,139 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 2630 transitions. Word has length 5 [2023-12-02 15:18:24,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:24,139 INFO L495 AbstractCegarLoop]: Abstraction has 990 states and 2630 transitions. [2023-12-02 15:18:24,139 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 15:18:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 2630 transitions. [2023-12-02 15:18:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 15:18:24,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:24,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 15:18:24,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:24,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:24,341 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:24,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash 385289458, now seen corresponding path program 1 times [2023-12-02 15:18:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:18:24,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538714335] [2023-12-02 15:18:24,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:24,342 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 15:18:24,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:18:24,343 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:24,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:24,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 15:18:24,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:24,437 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 15:18:24,437 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:18:24,437 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:18:24,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538714335] [2023-12-02 15:18:24,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538714335] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:24,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:24,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:18:24,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897053564] [2023-12-02 15:18:24,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:24,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:18:24,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:18:24,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:18:24,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:18:24,439 INFO L87 Difference]: Start difference. First operand 990 states and 2630 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 15:18:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:24,518 INFO L93 Difference]: Finished difference Result 875 states and 2310 transitions. [2023-12-02 15:18:24,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:18:24,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 15:18:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:24,525 INFO L225 Difference]: With dead ends: 875 [2023-12-02 15:18:24,525 INFO L226 Difference]: Without dead ends: 859 [2023-12-02 15:18:24,525 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 15:18:24,526 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:24,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:24,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2023-12-02 15:18:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2023-12-02 15:18:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 857 states have (on average 2.651108518086348) internal successors, (2272), 858 states have internal predecessors, (2272), 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 15:18:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 2272 transitions. [2023-12-02 15:18:24,555 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 2272 transitions. Word has length 5 [2023-12-02 15:18:24,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:24,556 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 2272 transitions. [2023-12-02 15:18:24,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 15:18:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 2272 transitions. [2023-12-02 15:18:24,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 15:18:24,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:24,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:18:24,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:24,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:24,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:24,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2141295366, now seen corresponding path program 1 times [2023-12-02 15:18:24,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:18:24,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301560916] [2023-12-02 15:18:24,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:24,763 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 15:18:24,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:18:24,764 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:24,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:24,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:18:24,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:24,882 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 15:18:24,882 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:18:24,882 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:18:24,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301560916] [2023-12-02 15:18:24,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301560916] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:24,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:24,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:18:24,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234632175] [2023-12-02 15:18:24,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:24,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:18:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:18:24,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:18:24,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:18:24,884 INFO L87 Difference]: Start difference. First operand 859 states and 2272 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:24,996 INFO L93 Difference]: Finished difference Result 527 states and 1232 transitions. [2023-12-02 15:18:24,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:18:24,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 15:18:24,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:25,000 INFO L225 Difference]: With dead ends: 527 [2023-12-02 15:18:25,000 INFO L226 Difference]: Without dead ends: 463 [2023-12-02 15:18:25,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 15:18:25,001 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 47 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:25,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 35 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:25,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-12-02 15:18:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2023-12-02 15:18:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 461 states have (on average 2.351409978308026) internal successors, (1084), 462 states have internal predecessors, (1084), 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 15:18:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1084 transitions. [2023-12-02 15:18:25,016 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1084 transitions. Word has length 15 [2023-12-02 15:18:25,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:25,017 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 1084 transitions. [2023-12-02 15:18:25,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1084 transitions. [2023-12-02 15:18:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 15:18:25,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:25,020 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] [2023-12-02 15:18:25,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:25,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:25,222 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:25,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash 34323828, now seen corresponding path program 1 times [2023-12-02 15:18:25,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:18:25,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644639253] [2023-12-02 15:18:25,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:25,223 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 15:18:25,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:18:25,224 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:25,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:25,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:18:25,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:25,377 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 15:18:25,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:18:25,377 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:18:25,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644639253] [2023-12-02 15:18:25,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644639253] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:25,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:25,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:18:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630896735] [2023-12-02 15:18:25,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:25,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:18:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:18:25,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:18:25,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:18:25,380 INFO L87 Difference]: Start difference. First operand 463 states and 1084 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:25,500 INFO L93 Difference]: Finished difference Result 227 states and 488 transitions. [2023-12-02 15:18:25,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:18:25,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 15:18:25,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:25,503 INFO L225 Difference]: With dead ends: 227 [2023-12-02 15:18:25,503 INFO L226 Difference]: Without dead ends: 199 [2023-12-02 15:18:25,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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 15:18:25,504 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 61 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:25,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 46 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-12-02 15:18:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2023-12-02 15:18:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.1522842639593907) internal successors, (424), 198 states have internal predecessors, (424), 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 15:18:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 424 transitions. [2023-12-02 15:18:25,513 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 424 transitions. Word has length 21 [2023-12-02 15:18:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:25,513 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 424 transitions. [2023-12-02 15:18:25,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 424 transitions. [2023-12-02 15:18:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:18:25,515 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:25,515 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] [2023-12-02 15:18:25,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:25,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:25,716 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:25,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:25,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2007132849, now seen corresponding path program 1 times [2023-12-02 15:18:25,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:18:25,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945087805] [2023-12-02 15:18:25,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:25,717 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 15:18:25,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:18:25,718 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:25,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:25,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 15:18:25,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:26,186 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t0~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| (_ BitVec 32))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t0~0#1.base_47| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1~0#1.base_43| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t0~0#1.base_47|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t0~0#1.base_47| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1~0#1.base_43|) (_ bv0 1)))) is different from true [2023-12-02 15:18:26,187 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 15:18:26,187 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:18:26,187 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:18:26,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945087805] [2023-12-02 15:18:26,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945087805] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:26,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:26,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:18:26,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044282845] [2023-12-02 15:18:26,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:26,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:18:26,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:18:26,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:18:26,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-12-02 15:18:26,189 INFO L87 Difference]: Start difference. First operand 199 states and 424 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:26,306 INFO L93 Difference]: Finished difference Result 201 states and 423 transitions. [2023-12-02 15:18:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:18:26,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-02 15:18:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:26,309 INFO L225 Difference]: With dead ends: 201 [2023-12-02 15:18:26,309 INFO L226 Difference]: Without dead ends: 199 [2023-12-02 15:18:26,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-12-02 15:18:26,310 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:26,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 48 Unchecked, 0.1s Time] [2023-12-02 15:18:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-12-02 15:18:26,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2023-12-02 15:18:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.1269035532994924) internal successors, (419), 198 states have internal predecessors, (419), 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 15:18:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 419 transitions. [2023-12-02 15:18:26,318 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 419 transitions. Word has length 27 [2023-12-02 15:18:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:26,319 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 419 transitions. [2023-12-02 15:18:26,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 419 transitions. [2023-12-02 15:18:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:18:26,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:26,320 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] [2023-12-02 15:18:26,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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)] Ended with exit code 0 [2023-12-02 15:18:26,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:26,521 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:26,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:26,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2007132736, now seen corresponding path program 1 times [2023-12-02 15:18:26,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:18:26,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646278255] [2023-12-02 15:18:26,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:26,522 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 15:18:26,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:18:26,523 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:26,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:26,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:18:26,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:26,690 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 15:18:26,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:18:26,690 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:18:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646278255] [2023-12-02 15:18:26,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646278255] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:26,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:26,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:18:26,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418969053] [2023-12-02 15:18:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:26,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:18:26,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:18:26,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:18:26,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:18:26,692 INFO L87 Difference]: Start difference. First operand 199 states and 419 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:26,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:26,863 INFO L93 Difference]: Finished difference Result 279 states and 578 transitions. [2023-12-02 15:18:26,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:18:26,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-02 15:18:26,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:26,865 INFO L225 Difference]: With dead ends: 279 [2023-12-02 15:18:26,865 INFO L226 Difference]: Without dead ends: 272 [2023-12-02 15:18:26,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:18:26,866 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:26,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 65 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:26,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-12-02 15:18:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2023-12-02 15:18:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 258 states have (on average 2.10077519379845) internal successors, (542), 259 states have internal predecessors, (542), 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 15:18:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 542 transitions. [2023-12-02 15:18:26,874 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 542 transitions. Word has length 27 [2023-12-02 15:18:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:26,874 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 542 transitions. [2023-12-02 15:18:26,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:18:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 542 transitions. [2023-12-02 15:18:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:18:26,875 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:26,875 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] [2023-12-02 15:18:26,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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)] Forceful destruction successful, exit code 0 [2023-12-02 15:18:27,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:27,076 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-12-02 15:18:27,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash -390344624, now seen corresponding path program 2 times [2023-12-02 15:18:27,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:18:27,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133460824] [2023-12-02 15:18:27,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:18:27,077 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 15:18:27,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:18:27,078 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:27,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:27,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-02 15:18:27,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-02 15:18:27,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 15:18:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:18:27,298 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2023-12-02 15:18:27,298 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 15:18:27,299 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-12-02 15:18:27,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-12-02 15:18:27,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-12-02 15:18:27,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-12-02 15:18:27,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-12-02 15:18:27,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-12-02 15:18:27,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-12-02 15:18:27,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-12-02 15:18:27,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-12-02 15:18:27,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-12-02 15:18:27,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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)] Forceful destruction successful, exit code 0 [2023-12-02 15:18:27,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/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 15:18:27,505 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:18:27,509 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 15:18:27,509 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:18:27,556 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 15:18:27,558 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-12-02 15:18:27,567 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-12-02 15:18:27,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-12-02 15:18:27,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:18:27 BasicIcfg [2023-12-02 15:18:27,579 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:18:27,580 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:18:27,580 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:18:27,580 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:18:27,580 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:18:22" (3/4) ... [2023-12-02 15:18:27,582 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 15:18:27,583 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:18:27,584 INFO L158 Benchmark]: Toolchain (without parser) took 6928.35ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 62.8MB in the beginning and 96.1MB in the end (delta: -33.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2023-12-02 15:18:27,584 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 62.9MB. Free memory was 38.9MB in the beginning and 38.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:18:27,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.79ms. Allocated memory is still 88.1MB. Free memory was 62.5MB in the beginning and 59.4MB in the end (delta: 3.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-12-02 15:18:27,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.60ms. Allocated memory is still 88.1MB. Free memory was 59.4MB in the beginning and 56.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:18:27,585 INFO L158 Benchmark]: Boogie Preprocessor took 34.08ms. Allocated memory is still 88.1MB. Free memory was 56.9MB in the beginning and 54.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:18:27,585 INFO L158 Benchmark]: RCFGBuilder took 755.14ms. Allocated memory is still 88.1MB. Free memory was 54.8MB in the beginning and 54.7MB in the end (delta: 119.5kB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2023-12-02 15:18:27,586 INFO L158 Benchmark]: TraceAbstraction took 5548.55ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 54.1MB in the beginning and 97.2MB in the end (delta: -43.1MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2023-12-02 15:18:27,586 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 132.1MB. Free memory was 97.2MB in the beginning and 96.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:18:27,588 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 62.9MB. Free memory was 38.9MB in the beginning and 38.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.79ms. Allocated memory is still 88.1MB. Free memory was 62.5MB in the beginning and 59.4MB in the end (delta: 3.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.60ms. Allocated memory is still 88.1MB. Free memory was 59.4MB in the beginning and 56.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.08ms. Allocated memory is still 88.1MB. Free memory was 56.9MB in the beginning and 54.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 755.14ms. Allocated memory is still 88.1MB. Free memory was 54.8MB in the beginning and 54.7MB in the end (delta: 119.5kB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5548.55ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 54.1MB in the beginning and 97.2MB in the end (delta: -43.1MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 132.1MB. Free memory was 97.2MB in the beginning and 96.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t0; [L832] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L833] 0 pthread_t t1; [L834] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t0={7:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 1 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L787] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 y$flush_delayed = weak$$choice2 [L796] 2 y$mem_tmp = y [L797] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L798] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L799] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L800] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L801] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L803] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = y [L805] 2 y = y$flush_delayed ? y$mem_tmp : y [L806] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L775] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L776] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L777] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={7:0}, t1={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={7:0}, t1={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={7:0}, t1={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L849] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 __assert_fail ("0", "mix000.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 61 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 308 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 308 mSDsluCounter, 297 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 48 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 489 IncrementalHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 138 mSDtfsCounter, 489 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1082occurred in iteration=0, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 100 ConstructedInterpolants, 1 QuantifiedInterpolants, 794 SizeOfPredicates, 6 NumberOfNonLiveVariables, 825 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 15:18:27,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe083ca9-78fe-4da4-ad06-e755bc8366fe/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample