./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ --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 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:03:34,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:03:34,309 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 05:03:34,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:03:34,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:03:34,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:03:34,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:03:34,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:03:34,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:03:34,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:03:34,363 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:03:34,364 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:03:34,365 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:03:34,366 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:03:34,367 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:03:34,367 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:03:34,367 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:03:34,368 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:03:34,368 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:03:34,369 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:03:34,369 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:03:34,369 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:03:34,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 05:03:34,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 05:03:34,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:03:34,372 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:03:34,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:03:34,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:03:34,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:03:34,374 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 05:03:34,375 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 05:03:34,375 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 05:03:34,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:03:34,375 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 05:03:34,376 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:03:34,376 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:03:34,376 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:03:34,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:03:34,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:03:34,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:03:34,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:03:34,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:03:34,377 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:03:34,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:03:34,378 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:03:34,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:03:34,378 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_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ 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 -> 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 [2023-11-19 05:03:34,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:03:34,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:03:34,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:03:34,694 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:03:34,695 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:03:34,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 05:03:37,804 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:03:38,105 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:03:38,106 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 05:03:38,125 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/data/89fc04ec4/9732f7a9b4cf47cf92777fd4bd0d444c/FLAGbe789fa80 [2023-11-19 05:03:38,140 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/data/89fc04ec4/9732f7a9b4cf47cf92777fd4bd0d444c [2023-11-19 05:03:38,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:03:38,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:03:38,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:03:38,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:03:38,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:03:38,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:03:38" (1/1) ... [2023-11-19 05:03:38,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4583b7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:38, skipping insertion in model container [2023-11-19 05:03:38,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:03:38" (1/1) ... [2023-11-19 05:03:38,209 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:03:38,728 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:03:38,745 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:03:38,808 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:03:38,861 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 05:03:38,861 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 05:03:38,870 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:03:38,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:38 WrapperNode [2023-11-19 05:03:38,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:03:38,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:03:38,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:03:38,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:03:38,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:38" (1/1) ... [2023-11-19 05:03:38,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:38" (1/1) ... [2023-11-19 05:03:38,977 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-11-19 05:03:38,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:03:38,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:03:38,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:03:38,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:03:38,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:38" (1/1) ... [2023-11-19 05:03:38,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:38" (1/1) ... [2023-11-19 05:03:39,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:38" (1/1) ... [2023-11-19 05:03:39,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:38" (1/1) ... [2023-11-19 05:03:39,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:38" (1/1) ... [2023-11-19 05:03:39,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:38" (1/1) ... [2023-11-19 05:03:39,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:38" (1/1) ... [2023-11-19 05:03:39,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:38" (1/1) ... [2023-11-19 05:03:39,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:03:39,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:03:39,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:03:39,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:03:39,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:38" (1/1) ... [2023-11-19 05:03:39,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:03:39,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:03:39,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:03:39,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:03:39,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:03:39,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 05:03:39,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:03:39,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:03:39,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:03:39,157 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 05:03:39,157 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 05:03:39,157 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 05:03:39,158 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 05:03:39,158 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 05:03:39,158 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 05:03:39,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:03:39,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 05:03:39,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:03:39,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:03:39,161 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 05:03:39,356 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:03:39,359 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:03:39,753 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:03:39,997 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:03:39,997 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 05:03:40,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:03:40 BoogieIcfgContainer [2023-11-19 05:03:40,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:03:40,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:03:40,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:03:40,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:03:40,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:03:38" (1/3) ... [2023-11-19 05:03:40,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ceda6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:03:40, skipping insertion in model container [2023-11-19 05:03:40,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:38" (2/3) ... [2023-11-19 05:03:40,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ceda6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:03:40, skipping insertion in model container [2023-11-19 05:03:40,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:03:40" (3/3) ... [2023-11-19 05:03:40,015 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 05:03:40,034 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:03:40,034 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-19 05:03:40,034 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 05:03:40,104 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 05:03:40,160 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 05:03:40,180 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 129 transitions, 270 flow [2023-11-19 05:03:40,183 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 129 transitions, 270 flow [2023-11-19 05:03:40,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 129 transitions, 270 flow [2023-11-19 05:03:40,245 INFO L124 PetriNetUnfolderBase]: 4/126 cut-off events. [2023-11-19 05:03:40,246 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 05:03:40,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 4/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-19 05:03:40,255 INFO L119 LiptonReduction]: Number of co-enabled transitions 2800 [2023-11-19 05:03:45,390 INFO L134 LiptonReduction]: Checked pairs total: 7828 [2023-11-19 05:03:45,391 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-11-19 05:03:45,402 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 36 transitions, 84 flow [2023-11-19 05:03:45,544 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:45,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:03:45,582 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;@3e0cd4f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:03:45,583 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-19 05:03:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:45,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-19 05:03:45,596 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:03:45,596 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-19 05:03:45,597 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:03:45,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:03:45,606 INFO L85 PathProgramCache]: Analyzing trace with hash 572, now seen corresponding path program 1 times [2023-11-19 05:03:45,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:03:45,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224139958] [2023-11-19 05:03:45,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:03:45,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:03:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:03:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:03:45,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:03:45,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224139958] [2023-11-19 05:03:45,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224139958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:03:45,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:03:45,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 05:03:45,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155154049] [2023-11-19 05:03:45,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:03:45,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 05:03:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:03:45,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 05:03:45,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 05:03:45,799 INFO L87 Difference]: Start difference. First operand has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:45,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:03:45,940 INFO L93 Difference]: Finished difference Result 1214 states and 3934 transitions. [2023-11-19 05:03:45,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 05:03:45,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2023-11-19 05:03:45,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:03:45,978 INFO L225 Difference]: With dead ends: 1214 [2023-11-19 05:03:45,978 INFO L226 Difference]: Without dead ends: 1214 [2023-11-19 05:03:45,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 05:03:45,983 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:03:45,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:03:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2023-11-19 05:03:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2023-11-19 05:03:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1209 states have (on average 3.2539288668320925) internal successors, (3934), 1213 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3934 transitions. [2023-11-19 05:03:46,139 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3934 transitions. Word has length 1 [2023-11-19 05:03:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:03:46,140 INFO L495 AbstractCegarLoop]: Abstraction has 1214 states and 3934 transitions. [2023-11-19 05:03:46,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:46,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3934 transitions. [2023-11-19 05:03:46,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-19 05:03:46,141 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:03:46,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-19 05:03:46,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:03:46,143 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:03:46,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:03:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash 564092, now seen corresponding path program 1 times [2023-11-19 05:03:46,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:03:46,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479411643] [2023-11-19 05:03:46,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:03:46,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:03:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:03:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:03:46,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:03:46,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479411643] [2023-11-19 05:03:46,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479411643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:03:46,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:03:46,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:03:46,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925130753] [2023-11-19 05:03:46,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:03:46,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:03:46,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:03:46,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:03:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:03:46,586 INFO L87 Difference]: Start difference. First operand 1214 states and 3934 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:46,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:03:46,708 INFO L93 Difference]: Finished difference Result 992 states and 3169 transitions. [2023-11-19 05:03:46,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:03:46,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-19 05:03:46,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:03:46,720 INFO L225 Difference]: With dead ends: 992 [2023-11-19 05:03:46,720 INFO L226 Difference]: Without dead ends: 962 [2023-11-19 05:03:46,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:03:46,722 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:03:46,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:03:46,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2023-11-19 05:03:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2023-11-19 05:03:46,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 960 states have (on average 3.21875) internal successors, (3090), 961 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 3090 transitions. [2023-11-19 05:03:46,771 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 3090 transitions. Word has length 3 [2023-11-19 05:03:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:03:46,773 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 3090 transitions. [2023-11-19 05:03:46,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:46,774 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 3090 transitions. [2023-11-19 05:03:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 05:03:46,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:03:46,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:03:46,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:03:46,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:03:46,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:03:46,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1127242783, now seen corresponding path program 1 times [2023-11-19 05:03:46,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:03:46,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740966449] [2023-11-19 05:03:46,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:03:46,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:03:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:03:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:03:47,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:03:47,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740966449] [2023-11-19 05:03:47,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740966449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:03:47,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:03:47,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:03:47,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555469734] [2023-11-19 05:03:47,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:03:47,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:03:47,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:03:47,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:03:47,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:03:47,178 INFO L87 Difference]: Start difference. First operand 962 states and 3090 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:03:47,309 INFO L93 Difference]: Finished difference Result 1592 states and 4940 transitions. [2023-11-19 05:03:47,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:03:47,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2023-11-19 05:03:47,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:03:47,326 INFO L225 Difference]: With dead ends: 1592 [2023-11-19 05:03:47,326 INFO L226 Difference]: Without dead ends: 1592 [2023-11-19 05:03:47,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:03:47,333 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:03:47,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:03:47,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2023-11-19 05:03:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1228. [2023-11-19 05:03:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1226 states have (on average 3.2096247960848285) internal successors, (3935), 1227 states have internal predecessors, (3935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3935 transitions. [2023-11-19 05:03:47,403 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 3935 transitions. Word has length 9 [2023-11-19 05:03:47,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:03:47,405 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 3935 transitions. [2023-11-19 05:03:47,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:47,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 3935 transitions. [2023-11-19 05:03:47,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 05:03:47,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:03:47,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:03:47,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:03:47,409 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:03:47,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:03:47,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1651256568, now seen corresponding path program 1 times [2023-11-19 05:03:47,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:03:47,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761551632] [2023-11-19 05:03:47,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:03:47,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:03:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:03:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:03:47,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:03:47,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761551632] [2023-11-19 05:03:47,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761551632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:03:47,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:03:47,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:03:47,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648912415] [2023-11-19 05:03:47,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:03:47,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:03:47,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:03:47,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:03:47,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:03:47,652 INFO L87 Difference]: Start difference. First operand 1228 states and 3935 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:03:47,802 INFO L93 Difference]: Finished difference Result 1448 states and 4496 transitions. [2023-11-19 05:03:47,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:03:47,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-11-19 05:03:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:03:47,818 INFO L225 Difference]: With dead ends: 1448 [2023-11-19 05:03:47,818 INFO L226 Difference]: Without dead ends: 1448 [2023-11-19 05:03:47,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:03:47,822 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:03:47,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 7 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:03:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2023-11-19 05:03:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1092. [2023-11-19 05:03:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1090 states have (on average 3.2009174311926607) internal successors, (3489), 1091 states have internal predecessors, (3489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 3489 transitions. [2023-11-19 05:03:47,887 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 3489 transitions. Word has length 10 [2023-11-19 05:03:47,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:03:47,887 INFO L495 AbstractCegarLoop]: Abstraction has 1092 states and 3489 transitions. [2023-11-19 05:03:47,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 3489 transitions. [2023-11-19 05:03:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 05:03:47,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:03:47,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:03:47,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:03:47,896 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:03:47,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:03:47,897 INFO L85 PathProgramCache]: Analyzing trace with hash 584788517, now seen corresponding path program 1 times [2023-11-19 05:03:47,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:03:47,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606523003] [2023-11-19 05:03:47,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:03:47,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:03:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:03:48,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:03:48,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:03:48,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606523003] [2023-11-19 05:03:48,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606523003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:03:48,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:03:48,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:03:48,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283704171] [2023-11-19 05:03:48,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:03:48,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:03:48,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:03:48,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:03:48,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:03:48,440 INFO L87 Difference]: Start difference. First operand 1092 states and 3489 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:03:48,687 INFO L93 Difference]: Finished difference Result 942 states and 2974 transitions. [2023-11-19 05:03:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:03:48,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-11-19 05:03:48,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:03:48,695 INFO L225 Difference]: With dead ends: 942 [2023-11-19 05:03:48,695 INFO L226 Difference]: Without dead ends: 711 [2023-11-19 05:03:48,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:03:48,697 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:03:48,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 36 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:03:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2023-11-19 05:03:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2023-11-19 05:03:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 3.036619718309859) internal successors, (2156), 710 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 2156 transitions. [2023-11-19 05:03:48,735 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 2156 transitions. Word has length 10 [2023-11-19 05:03:48,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:03:48,736 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 2156 transitions. [2023-11-19 05:03:48,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:48,736 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 2156 transitions. [2023-11-19 05:03:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 05:03:48,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:03:48,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:03:48,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:03:48,764 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:03:48,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:03:48,765 INFO L85 PathProgramCache]: Analyzing trace with hash 948779664, now seen corresponding path program 1 times [2023-11-19 05:03:48,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:03:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498336553] [2023-11-19 05:03:48,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:03:48,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:03:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:03:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:03:48,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:03:48,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498336553] [2023-11-19 05:03:48,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498336553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:03:48,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:03:48,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:03:48,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188614091] [2023-11-19 05:03:48,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:03:48,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:03:48,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:03:48,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:03:48,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:03:48,963 INFO L87 Difference]: Start difference. First operand 711 states and 2156 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:03:49,042 INFO L93 Difference]: Finished difference Result 703 states and 2126 transitions. [2023-11-19 05:03:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:03:49,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-19 05:03:49,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:03:49,051 INFO L225 Difference]: With dead ends: 703 [2023-11-19 05:03:49,052 INFO L226 Difference]: Without dead ends: 703 [2023-11-19 05:03:49,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:03:49,053 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:03:49,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:03:49,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2023-11-19 05:03:49,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2023-11-19 05:03:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 702 states have (on average 3.0284900284900287) internal successors, (2126), 702 states have internal predecessors, (2126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 2126 transitions. [2023-11-19 05:03:49,091 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 2126 transitions. Word has length 11 [2023-11-19 05:03:49,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:03:49,092 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 2126 transitions. [2023-11-19 05:03:49,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 2126 transitions. [2023-11-19 05:03:49,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 05:03:49,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:03:49,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:03:49,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 05:03:49,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:03:49,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:03:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2014405831, now seen corresponding path program 1 times [2023-11-19 05:03:49,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:03:49,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010378689] [2023-11-19 05:03:49,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:03:49,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:03:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:03:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:03:49,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:03:49,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010378689] [2023-11-19 05:03:49,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010378689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:03:49,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:03:49,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:03:49,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152167357] [2023-11-19 05:03:49,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:03:49,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:03:49,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:03:49,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:03:49,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:03:49,299 INFO L87 Difference]: Start difference. First operand 703 states and 2126 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:03:49,373 INFO L93 Difference]: Finished difference Result 469 states and 1198 transitions. [2023-11-19 05:03:49,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:03:49,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 05:03:49,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:03:49,377 INFO L225 Difference]: With dead ends: 469 [2023-11-19 05:03:49,378 INFO L226 Difference]: Without dead ends: 469 [2023-11-19 05:03:49,378 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-11-19 05:03:49,379 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:03:49,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:03:49,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2023-11-19 05:03:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2023-11-19 05:03:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 2.5598290598290596) internal successors, (1198), 468 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1198 transitions. [2023-11-19 05:03:49,399 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1198 transitions. Word has length 12 [2023-11-19 05:03:49,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:03:49,400 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 1198 transitions. [2023-11-19 05:03:49,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1198 transitions. [2023-11-19 05:03:49,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 05:03:49,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:03:49,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:03:49,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 05:03:49,402 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:03:49,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:03:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash -557314211, now seen corresponding path program 1 times [2023-11-19 05:03:49,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:03:49,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254232103] [2023-11-19 05:03:49,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:03:49,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:03:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:03:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:03:49,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:03:49,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254232103] [2023-11-19 05:03:49,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254232103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:03:49,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:03:49,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:03:49,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146128852] [2023-11-19 05:03:49,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:03:49,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:03:49,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:03:49,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:03:49,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:03:49,647 INFO L87 Difference]: Start difference. First operand 469 states and 1198 transitions. Second operand has 4 states, 3 states have (on average 5.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-11-19 05:03:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:03:49,759 INFO L93 Difference]: Finished difference Result 664 states and 1661 transitions. [2023-11-19 05:03:49,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:03:49,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.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-11-19 05:03:49,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:03:49,764 INFO L225 Difference]: With dead ends: 664 [2023-11-19 05:03:49,765 INFO L226 Difference]: Without dead ends: 441 [2023-11-19 05:03:49,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:03:49,766 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:03:49,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 7 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:03:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2023-11-19 05:03:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 396. [2023-11-19 05:03:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 2.4683544303797467) internal successors, (975), 395 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 975 transitions. [2023-11-19 05:03:49,788 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 975 transitions. Word has length 15 [2023-11-19 05:03:49,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:03:49,789 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 975 transitions. [2023-11-19 05:03:49,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.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-11-19 05:03:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 975 transitions. [2023-11-19 05:03:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 05:03:49,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:03:49,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:03:49,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 05:03:49,796 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:03:49,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:03:49,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1926019528, now seen corresponding path program 1 times [2023-11-19 05:03:49,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:03:49,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699574300] [2023-11-19 05:03:49,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:03:49,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:03:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:03:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:03:50,001 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:03:50,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699574300] [2023-11-19 05:03:50,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699574300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:03:50,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:03:50,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:03:50,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760715151] [2023-11-19 05:03:50,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:03:50,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:03:50,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:03:50,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:03:50,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:03:50,003 INFO L87 Difference]: Start difference. First operand 396 states and 975 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-11-19 05:03:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:03:50,110 INFO L93 Difference]: Finished difference Result 251 states and 556 transitions. [2023-11-19 05:03:50,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:03:50,111 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-11-19 05:03:50,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:03:50,113 INFO L225 Difference]: With dead ends: 251 [2023-11-19 05:03:50,113 INFO L226 Difference]: Without dead ends: 251 [2023-11-19 05:03:50,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:03:50,114 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 21 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:03:50,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 9 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:03:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-11-19 05:03:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2023-11-19 05:03:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 2.224) internal successors, (556), 250 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 556 transitions. [2023-11-19 05:03:50,126 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 556 transitions. Word has length 15 [2023-11-19 05:03:50,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:03:50,127 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 556 transitions. [2023-11-19 05:03:50,127 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-11-19 05:03:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 556 transitions. [2023-11-19 05:03:50,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 05:03:50,128 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:03:50,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:03:50,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 05:03:50,129 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:03:50,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:03:50,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1026131081, now seen corresponding path program 1 times [2023-11-19 05:03:50,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:03:50,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576080542] [2023-11-19 05:03:50,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:03:50,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:03:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:03:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:03:50,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:03:50,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576080542] [2023-11-19 05:03:50,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576080542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:03:50,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:03:50,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:03:50,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91288450] [2023-11-19 05:03:50,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:03:50,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:03:50,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:03:50,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:03:50,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:03:50,407 INFO L87 Difference]: Start difference. First operand 251 states and 556 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-11-19 05:03:50,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:03:50,513 INFO L93 Difference]: Finished difference Result 215 states and 486 transitions. [2023-11-19 05:03:50,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:03:50,514 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-11-19 05:03:50,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:03:50,515 INFO L225 Difference]: With dead ends: 215 [2023-11-19 05:03:50,515 INFO L226 Difference]: Without dead ends: 151 [2023-11-19 05:03:50,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:03:50,516 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 39 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:03:50,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:03:50,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-19 05:03:50,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2023-11-19 05:03:50,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.2266666666666666) internal successors, (334), 150 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:50,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 334 transitions. [2023-11-19 05:03:50,524 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 334 transitions. Word has length 18 [2023-11-19 05:03:50,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:03:50,525 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 334 transitions. [2023-11-19 05:03:50,525 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-11-19 05:03:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 334 transitions. [2023-11-19 05:03:50,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 05:03:50,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:03:50,527 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] [2023-11-19 05:03:50,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 05:03:50,527 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:03:50,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:03:50,528 INFO L85 PathProgramCache]: Analyzing trace with hash 802559498, now seen corresponding path program 1 times [2023-11-19 05:03:50,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:03:50,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981153670] [2023-11-19 05:03:50,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:03:50,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:03:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:03:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:03:51,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:03:51,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981153670] [2023-11-19 05:03:51,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981153670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:03:51,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:03:51,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:03:51,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771561297] [2023-11-19 05:03:51,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:03:51,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 05:03:51,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:03:51,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 05:03:51,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:03:51,634 INFO L87 Difference]: Start difference. First operand 151 states and 334 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:03:51,847 INFO L93 Difference]: Finished difference Result 183 states and 395 transitions. [2023-11-19 05:03:51,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:03:51,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2023-11-19 05:03:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:03:51,849 INFO L225 Difference]: With dead ends: 183 [2023-11-19 05:03:51,849 INFO L226 Difference]: Without dead ends: 97 [2023-11-19 05:03:51,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-19 05:03:51,850 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 38 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:03:51,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 21 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:03:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-19 05:03:51,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-19 05:03:51,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.9375) internal successors, (186), 96 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 186 transitions. [2023-11-19 05:03:51,854 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 186 transitions. Word has length 22 [2023-11-19 05:03:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:03:51,855 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 186 transitions. [2023-11-19 05:03:51,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:03:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 186 transitions. [2023-11-19 05:03:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 05:03:51,856 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:03:51,856 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] [2023-11-19 05:03:51,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 05:03:51,857 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:03:51,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:03:51,857 INFO L85 PathProgramCache]: Analyzing trace with hash 399796682, now seen corresponding path program 2 times [2023-11-19 05:03:51,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:03:51,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195232855] [2023-11-19 05:03:51,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:03:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:03:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 05:03:51,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 05:03:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 05:03:52,028 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 05:03:52,029 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 05:03:52,030 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-19 05:03:52,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-19 05:03:52,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-19 05:03:52,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-19 05:03:52,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-19 05:03:52,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-19 05:03:52,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-19 05:03:52,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-19 05:03:52,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-19 05:03:52,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-19 05:03:52,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-19 05:03:52,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-19 05:03:52,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-19 05:03:52,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 05:03:52,037 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:03:52,042 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 05:03:52,042 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 05:03:52,102 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 05:03:52,106 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 05:03:52,109 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 05:03:52,114 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 05:03:52,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:03:52 BasicIcfg [2023-11-19 05:03:52,125 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 05:03:52,126 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 05:03:52,126 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 05:03:52,126 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 05:03:52,126 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:03:40" (3/4) ... [2023-11-19 05:03:52,128 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 05:03:52,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 05:03:52,130 INFO L158 Benchmark]: Toolchain (without parser) took 13986.07ms. Allocated memory was 169.9MB in the beginning and 262.1MB in the end (delta: 92.3MB). Free memory was 131.3MB in the beginning and 102.8MB in the end (delta: 28.5MB). Peak memory consumption was 121.7MB. Max. memory is 16.1GB. [2023-11-19 05:03:52,131 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 169.9MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 05:03:52,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 725.75ms. Allocated memory is still 169.9MB. Free memory was 131.3MB in the beginning and 107.6MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 05:03:52,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.68ms. Allocated memory is still 169.9MB. Free memory was 107.6MB in the beginning and 105.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:03:52,132 INFO L158 Benchmark]: Boogie Preprocessor took 57.93ms. Allocated memory is still 169.9MB. Free memory was 105.1MB in the beginning and 103.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:03:52,132 INFO L158 Benchmark]: RCFGBuilder took 953.95ms. Allocated memory is still 169.9MB. Free memory was 103.0MB in the beginning and 135.1MB in the end (delta: -32.1MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2023-11-19 05:03:52,133 INFO L158 Benchmark]: TraceAbstraction took 12119.92ms. Allocated memory was 169.9MB in the beginning and 262.1MB in the end (delta: 92.3MB). Free memory was 134.3MB in the beginning and 102.8MB in the end (delta: 31.6MB). Peak memory consumption was 123.2MB. Max. memory is 16.1GB. [2023-11-19 05:03:52,133 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 262.1MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 05:03:52,135 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.22ms. Allocated memory is still 169.9MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 725.75ms. Allocated memory is still 169.9MB. Free memory was 131.3MB in the beginning and 107.6MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.68ms. Allocated memory is still 169.9MB. Free memory was 107.6MB in the beginning and 105.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.93ms. Allocated memory is still 169.9MB. Free memory was 105.1MB in the beginning and 103.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 953.95ms. Allocated memory is still 169.9MB. Free memory was 103.0MB in the beginning and 135.1MB in the end (delta: -32.1MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12119.92ms. Allocated memory was 169.9MB in the beginning and 262.1MB in the end (delta: 92.3MB). Free memory was 134.3MB in the beginning and 102.8MB in the end (delta: 31.6MB). Peak memory consumption was 123.2MB. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 262.1MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 135 PlacesBefore, 45 PlacesAfterwards, 129 TransitionsBefore, 36 TransitionsAfterwards, 2800 CoEnabledTransitionPairs, 8 FixpointIterations, 45 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 125 TotalNumberOfCompositions, 7828 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3922, independent: 3701, independent conditional: 0, independent unconditional: 3701, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2011, independent: 1951, independent conditional: 0, independent unconditional: 1951, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2011, independent: 1929, independent conditional: 0, independent unconditional: 1929, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 82, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 377, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 322, dependent conditional: 0, dependent unconditional: 322, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3922, independent: 1750, independent conditional: 0, independent unconditional: 1750, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 2011, unknown conditional: 0, unknown unconditional: 2011] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 210, Positive conditional cache size: 0, Positive unconditional cache size: 210, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t497; [L839] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t497={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t498; [L841] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t497={5:0}, t498={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L842] 0 pthread_t t499; [L843] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L794] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix019_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 843]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 155 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 213 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 112 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 711 IncrementalHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 46 mSDtfsCounter, 711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1288occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 765 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 856 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-11-19 05:03:52,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ --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 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:03:54,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:03:54,959 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-19 05:03:54,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:03:54,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:03:55,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:03:55,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:03:55,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:03:55,012 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:03:55,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:03:55,018 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:03:55,018 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:03:55,019 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:03:55,021 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:03:55,021 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:03:55,022 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:03:55,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 05:03:55,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 05:03:55,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:03:55,025 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:03:55,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:03:55,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:03:55,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:03:55,027 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 05:03:55,028 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 05:03:55,028 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 05:03:55,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:03:55,029 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 05:03:55,030 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 05:03:55,030 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 05:03:55,032 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:03:55,032 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:03:55,033 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:03:55,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:03:55,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 05:03:55,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:03:55,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:03:55,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:03:55,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:03:55,036 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-19 05:03:55,036 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 05:03:55,036 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:03:55,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:03:55,037 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_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ 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 -> 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 [2023-11-19 05:03:55,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:03:55,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:03:55,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:03:55,543 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:03:55,543 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:03:55,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 05:03:58,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:03:59,197 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:03:59,198 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 05:03:59,218 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/data/1632490ca/0caf124f502046e4998aa383853891cd/FLAG63b4ac34e [2023-11-19 05:03:59,236 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/data/1632490ca/0caf124f502046e4998aa383853891cd [2023-11-19 05:03:59,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:03:59,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:03:59,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:03:59,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:03:59,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:03:59,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:03:59" (1/1) ... [2023-11-19 05:03:59,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c721388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:59, skipping insertion in model container [2023-11-19 05:03:59,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:03:59" (1/1) ... [2023-11-19 05:03:59,312 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:03:59,861 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:03:59,890 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:04:00,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:04:00,119 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 05:04:00,120 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 05:04:00,129 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:04:00,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:00 WrapperNode [2023-11-19 05:04:00,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:04:00,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:04:00,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:04:00,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:04:00,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:00" (1/1) ... [2023-11-19 05:04:00,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:00" (1/1) ... [2023-11-19 05:04:00,237 INFO L138 Inliner]: procedures = 179, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2023-11-19 05:04:00,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:04:00,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:04:00,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:04:00,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:04:00,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:00" (1/1) ... [2023-11-19 05:04:00,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:00" (1/1) ... [2023-11-19 05:04:00,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:00" (1/1) ... [2023-11-19 05:04:00,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:00" (1/1) ... [2023-11-19 05:04:00,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:00" (1/1) ... [2023-11-19 05:04:00,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:00" (1/1) ... [2023-11-19 05:04:00,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:00" (1/1) ... [2023-11-19 05:04:00,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:00" (1/1) ... [2023-11-19 05:04:00,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:04:00,357 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:04:00,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:04:00,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:04:00,359 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:00" (1/1) ... [2023-11-19 05:04:00,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:04:00,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:04:00,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:04:00,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:04:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 05:04:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:04:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:04:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:04:00,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 05:04:00,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 05:04:00,452 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 05:04:00,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 05:04:00,452 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 05:04:00,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 05:04:00,453 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 05:04:00,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 05:04:00,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 05:04:00,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:04:00,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:04:00,457 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 05:04:00,739 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:04:00,743 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:04:01,219 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:04:01,399 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:04:01,400 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 05:04:01,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:04:01 BoogieIcfgContainer [2023-11-19 05:04:01,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:04:01,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:04:01,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:04:01,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:04:01,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:03:59" (1/3) ... [2023-11-19 05:04:01,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9407dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:04:01, skipping insertion in model container [2023-11-19 05:04:01,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:00" (2/3) ... [2023-11-19 05:04:01,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9407dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:04:01, skipping insertion in model container [2023-11-19 05:04:01,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:04:01" (3/3) ... [2023-11-19 05:04:01,416 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 05:04:01,439 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:04:01,439 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-19 05:04:01,440 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 05:04:01,513 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 05:04:01,556 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 05:04:01,572 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 130 transitions, 272 flow [2023-11-19 05:04:01,575 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 130 transitions, 272 flow [2023-11-19 05:04:01,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 130 transitions, 272 flow [2023-11-19 05:04:01,661 INFO L124 PetriNetUnfolderBase]: 4/127 cut-off events. [2023-11-19 05:04:01,662 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 05:04:01,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 4/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-19 05:04:01,672 INFO L119 LiptonReduction]: Number of co-enabled transitions 2800 [2023-11-19 05:04:10,506 INFO L134 LiptonReduction]: Checked pairs total: 8101 [2023-11-19 05:04:10,507 INFO L136 LiptonReduction]: Total number of compositions: 129 [2023-11-19 05:04:10,516 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 37 transitions, 86 flow [2023-11-19 05:04:10,622 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1288 states, 1273 states have (on average 3.534956794972506) internal successors, (4500), 1287 states have internal predecessors, (4500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:10,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:04:10,646 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;@6aae59e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:04:10,646 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-19 05:04:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 1288 states, 1273 states have (on average 3.534956794972506) internal successors, (4500), 1287 states have internal predecessors, (4500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:10,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-19 05:04:10,658 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:04:10,659 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-19 05:04:10,659 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:04:10,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:04:10,674 INFO L85 PathProgramCache]: Analyzing trace with hash 577, now seen corresponding path program 1 times [2023-11-19 05:04:10,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 05:04:10,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699141934] [2023-11-19 05:04:10,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:04:10,687 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-11-19 05:04:10,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 05:04:10,690 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:10,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:04:10,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 05:04:10,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:04:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:04:10,798 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 05:04:10,798 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 05:04:10,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699141934] [2023-11-19 05:04:10,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699141934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:04:10,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:04:10,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 05:04:10,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113877738] [2023-11-19 05:04:10,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:04:10,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 05:04:10,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 05:04:10,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 05:04:10,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 05:04:10,836 INFO L87 Difference]: Start difference. First operand has 1288 states, 1273 states have (on average 3.534956794972506) internal successors, (4500), 1287 states have internal predecessors, (4500), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:04:11,056 INFO L93 Difference]: Finished difference Result 1214 states and 3934 transitions. [2023-11-19 05:04:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 05:04:11,059 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2023-11-19 05:04:11,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:04:11,094 INFO L225 Difference]: With dead ends: 1214 [2023-11-19 05:04:11,094 INFO L226 Difference]: Without dead ends: 1214 [2023-11-19 05:04:11,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 05:04:11,099 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:04:11,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:04:11,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2023-11-19 05:04:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2023-11-19 05:04:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1209 states have (on average 3.2539288668320925) internal successors, (3934), 1213 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3934 transitions. [2023-11-19 05:04:11,248 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3934 transitions. Word has length 1 [2023-11-19 05:04:11,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:04:11,249 INFO L495 AbstractCegarLoop]: Abstraction has 1214 states and 3934 transitions. [2023-11-19 05:04:11,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3934 transitions. [2023-11-19 05:04:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-19 05:04:11,252 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:04:11,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-19 05:04:11,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:11,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:11,455 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:04:11,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:04:11,456 INFO L85 PathProgramCache]: Analyzing trace with hash 569813, now seen corresponding path program 1 times [2023-11-19 05:04:11,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 05:04:11,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323277703] [2023-11-19 05:04:11,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:04:11,458 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-11-19 05:04:11,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 05:04:11,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:11,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:04:11,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 05:04:11,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:04:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:04:11,591 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 05:04:11,592 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 05:04:11,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323277703] [2023-11-19 05:04:11,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323277703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:04:11,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:04:11,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:04:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102251911] [2023-11-19 05:04:11,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:04:11,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:04:11,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 05:04:11,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:04:11,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:04:11,597 INFO L87 Difference]: Start difference. First operand 1214 states and 3934 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:04:11,727 INFO L93 Difference]: Finished difference Result 992 states and 3169 transitions. [2023-11-19 05:04:11,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:04:11,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-19 05:04:11,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:04:11,739 INFO L225 Difference]: With dead ends: 992 [2023-11-19 05:04:11,740 INFO L226 Difference]: Without dead ends: 962 [2023-11-19 05:04:11,740 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-11-19 05:04:11,742 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:04:11,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:04:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2023-11-19 05:04:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2023-11-19 05:04:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 960 states have (on average 3.21875) internal successors, (3090), 961 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 3090 transitions. [2023-11-19 05:04:11,796 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 3090 transitions. Word has length 3 [2023-11-19 05:04:11,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:04:11,796 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 3090 transitions. [2023-11-19 05:04:11,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 3090 transitions. [2023-11-19 05:04:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 05:04:11,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:04:11,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:04:11,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:12,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:12,002 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:04:12,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:04:12,003 INFO L85 PathProgramCache]: Analyzing trace with hash -798571677, now seen corresponding path program 1 times [2023-11-19 05:04:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 05:04:12,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461382707] [2023-11-19 05:04:12,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:04:12,004 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-11-19 05:04:12,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 05:04:12,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:12,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:04:12,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 05:04:12,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:04:12,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-11-19 05:04:12,171 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 05:04:12,171 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 05:04:12,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461382707] [2023-11-19 05:04:12,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461382707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:04:12,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:04:12,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:04:12,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638348821] [2023-11-19 05:04:12,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:04:12,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:04:12,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 05:04:12,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:04:12,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:04:12,177 INFO L87 Difference]: Start difference. First operand 962 states and 3090 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:04:12,290 INFO L93 Difference]: Finished difference Result 562 states and 1490 transitions. [2023-11-19 05:04:12,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:04:12,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2023-11-19 05:04:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:04:12,296 INFO L225 Difference]: With dead ends: 562 [2023-11-19 05:04:12,296 INFO L226 Difference]: Without dead ends: 562 [2023-11-19 05:04:12,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:04:12,300 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6 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-11-19 05:04:12,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 6 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:04:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2023-11-19 05:04:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2023-11-19 05:04:12,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 560 states have (on average 2.6607142857142856) internal successors, (1490), 561 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1490 transitions. [2023-11-19 05:04:12,334 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1490 transitions. Word has length 9 [2023-11-19 05:04:12,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:04:12,334 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1490 transitions. [2023-11-19 05:04:12,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:12,335 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1490 transitions. [2023-11-19 05:04:12,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 05:04:12,343 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:04:12,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:04:12,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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)] Forceful destruction successful, exit code 0 [2023-11-19 05:04:12,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:12,553 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:04:12,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:04:12,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1136716925, now seen corresponding path program 1 times [2023-11-19 05:04:12,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 05:04:12,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684541949] [2023-11-19 05:04:12,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:04:12,561 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-11-19 05:04:12,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 05:04:12,563 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:12,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:04:12,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 05:04:12,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:04:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:04:12,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 05:04:12,762 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 05:04:12,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684541949] [2023-11-19 05:04:12,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684541949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:04:12,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:04:12,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:04:12,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143830066] [2023-11-19 05:04:12,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:04:12,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:04:12,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 05:04:12,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:04:12,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:04:12,766 INFO L87 Difference]: Start difference. First operand 562 states and 1490 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:12,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:04:12,916 INFO L93 Difference]: Finished difference Result 282 states and 650 transitions. [2023-11-19 05:04:12,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:04:12,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-19 05:04:12,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:04:12,919 INFO L225 Difference]: With dead ends: 282 [2023-11-19 05:04:12,920 INFO L226 Difference]: Without dead ends: 282 [2023-11-19 05:04:12,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:04:12,921 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 12 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-11-19 05:04:12,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 12 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:04:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-11-19 05:04:12,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2023-11-19 05:04:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 280 states have (on average 2.3214285714285716) internal successors, (650), 281 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 650 transitions. [2023-11-19 05:04:12,938 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 650 transitions. Word has length 13 [2023-11-19 05:04:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:04:12,938 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 650 transitions. [2023-11-19 05:04:12,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:12,939 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 650 transitions. [2023-11-19 05:04:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 05:04:12,942 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:04:12,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:04:12,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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)] Forceful destruction successful, exit code 0 [2023-11-19 05:04:13,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:13,146 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:04:13,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:04:13,146 INFO L85 PathProgramCache]: Analyzing trace with hash -429575339, now seen corresponding path program 1 times [2023-11-19 05:04:13,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 05:04:13,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212646510] [2023-11-19 05:04:13,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:04:13,148 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-11-19 05:04:13,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 05:04:13,149 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:13,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:04:13,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 05:04:13,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:04:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:04:13,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 05:04:13,363 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 05:04:13,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212646510] [2023-11-19 05:04:13,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212646510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:04:13,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:04:13,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:04:13,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474158613] [2023-11-19 05:04:13,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:04:13,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:04:13,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 05:04:13,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:04:13,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:04:13,372 INFO L87 Difference]: Start difference. First operand 282 states and 650 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:04:13,651 INFO L93 Difference]: Finished difference Result 217 states and 520 transitions. [2023-11-19 05:04:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:04:13,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-19 05:04:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:04:13,654 INFO L225 Difference]: With dead ends: 217 [2023-11-19 05:04:13,654 INFO L226 Difference]: Without dead ends: 217 [2023-11-19 05:04:13,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:04:13,655 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:04:13,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 27 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:04:13,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-11-19 05:04:13,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2023-11-19 05:04:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 215 states have (on average 2.4186046511627906) internal successors, (520), 216 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 520 transitions. [2023-11-19 05:04:13,668 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 520 transitions. Word has length 17 [2023-11-19 05:04:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:04:13,669 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 520 transitions. [2023-11-19 05:04:13,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:13,670 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 520 transitions. [2023-11-19 05:04:13,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 05:04:13,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:04:13,671 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] [2023-11-19 05:04:13,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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)] Forceful destruction successful, exit code 0 [2023-11-19 05:04:13,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:13,875 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:04:13,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:04:13,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1679510325, now seen corresponding path program 1 times [2023-11-19 05:04:13,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 05:04:13,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889580916] [2023-11-19 05:04:13,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:04:13,876 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-11-19 05:04:13,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 05:04:13,880 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:13,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:04:14,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 05:04:14,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:04:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:04:14,080 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 05:04:14,080 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 05:04:14,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889580916] [2023-11-19 05:04:14,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889580916] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:04:14,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:04:14,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:04:14,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963183884] [2023-11-19 05:04:14,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:04:14,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:04:14,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 05:04:14,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:04:14,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:04:14,082 INFO L87 Difference]: Start difference. First operand 217 states and 520 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:04:14,261 INFO L93 Difference]: Finished difference Result 296 states and 694 transitions. [2023-11-19 05:04:14,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:04:14,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2023-11-19 05:04:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:04:14,265 INFO L225 Difference]: With dead ends: 296 [2023-11-19 05:04:14,265 INFO L226 Difference]: Without dead ends: 296 [2023-11-19 05:04:14,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:04:14,267 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:04:14,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:04:14,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-11-19 05:04:14,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2023-11-19 05:04:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 292 states have (on average 2.3732876712328768) internal successors, (693), 293 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 693 transitions. [2023-11-19 05:04:14,282 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 693 transitions. Word has length 22 [2023-11-19 05:04:14,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:04:14,282 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 693 transitions. [2023-11-19 05:04:14,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 693 transitions. [2023-11-19 05:04:14,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 05:04:14,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:04:14,285 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] [2023-11-19 05:04:14,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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)] Forceful destruction successful, exit code 0 [2023-11-19 05:04:14,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:14,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:04:14,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:04:14,489 INFO L85 PathProgramCache]: Analyzing trace with hash 797736735, now seen corresponding path program 2 times [2023-11-19 05:04:14,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 05:04:14,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15945029] [2023-11-19 05:04:14,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 05:04:14,490 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-11-19 05:04:14,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 05:04:14,492 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:14,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:14,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-19 05:04:14,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:04:14,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 05:04:14,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:04:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:04:14,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 05:04:14,687 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 05:04:14,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15945029] [2023-11-19 05:04:14,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15945029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:04:14,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:04:14,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:04:14,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421349685] [2023-11-19 05:04:14,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:04:14,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:04:14,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 05:04:14,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:04:14,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:04:14,689 INFO L87 Difference]: Start difference. First operand 294 states and 693 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:04:14,808 INFO L93 Difference]: Finished difference Result 441 states and 1016 transitions. [2023-11-19 05:04:14,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:04:14,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2023-11-19 05:04:14,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:04:14,813 INFO L225 Difference]: With dead ends: 441 [2023-11-19 05:04:14,813 INFO L226 Difference]: Without dead ends: 441 [2023-11-19 05:04:14,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:04:14,814 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:04:14,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 7 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:04:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2023-11-19 05:04:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 300. [2023-11-19 05:04:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 298 states have (on average 2.3691275167785233) internal successors, (706), 299 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 706 transitions. [2023-11-19 05:04:14,836 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 706 transitions. Word has length 22 [2023-11-19 05:04:14,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:04:14,840 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 706 transitions. [2023-11-19 05:04:14,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:04:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 706 transitions. [2023-11-19 05:04:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 05:04:14,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:04:14,842 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] [2023-11-19 05:04:14,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:15,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:15,046 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:04:15,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:04:15,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1657224631, now seen corresponding path program 3 times [2023-11-19 05:04:15,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 05:04:15,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915666064] [2023-11-19 05:04:15,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 05:04:15,047 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-11-19 05:04:15,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 05:04:15,049 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:15,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:15,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-19 05:04:15,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-19 05:04:15,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 05:04:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 05:04:15,387 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2023-11-19 05:04:15,388 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 05:04:15,389 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-19 05:04:15,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-19 05:04:15,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-19 05:04:15,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-19 05:04:15,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-19 05:04:15,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-19 05:04:15,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-19 05:04:15,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-19 05:04:15,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-19 05:04:15,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-19 05:04:15,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-19 05:04:15,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-19 05:04:15,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-19 05:04:15,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-19 05:04:15,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/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-11-19 05:04:15,600 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-11-19 05:04:15,604 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 05:04:15,604 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 05:04:15,656 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 05:04:15,659 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 05:04:15,661 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 05:04:15,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:04:15 BasicIcfg [2023-11-19 05:04:15,685 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 05:04:15,685 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 05:04:15,685 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 05:04:15,686 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 05:04:15,686 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:04:01" (3/4) ... [2023-11-19 05:04:15,688 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 05:04:15,689 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 05:04:15,690 INFO L158 Benchmark]: Toolchain (without parser) took 16449.63ms. Allocated memory was 73.4MB in the beginning and 115.3MB in the end (delta: 41.9MB). Free memory was 47.9MB in the beginning and 55.0MB in the end (delta: -7.1MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2023-11-19 05:04:15,691 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 73.4MB. Free memory was 49.0MB in the beginning and 48.9MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 05:04:15,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 888.74ms. Allocated memory was 73.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Free memory was 47.7MB in the beginning and 64.4MB in the end (delta: -16.8MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2023-11-19 05:04:15,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.28ms. Allocated memory is still 94.4MB. Free memory was 64.4MB in the beginning and 61.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:04:15,692 INFO L158 Benchmark]: Boogie Preprocessor took 117.04ms. Allocated memory is still 94.4MB. Free memory was 61.9MB in the beginning and 59.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:04:15,692 INFO L158 Benchmark]: RCFGBuilder took 1048.12ms. Allocated memory is still 94.4MB. Free memory was 59.9MB in the beginning and 51.5MB in the end (delta: 8.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2023-11-19 05:04:15,693 INFO L158 Benchmark]: TraceAbstraction took 14276.96ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 50.9MB in the beginning and 55.0MB in the end (delta: -4.1MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2023-11-19 05:04:15,693 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 115.3MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 05:04:15,695 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.36ms. Allocated memory is still 73.4MB. Free memory was 49.0MB in the beginning and 48.9MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 888.74ms. Allocated memory was 73.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Free memory was 47.7MB in the beginning and 64.4MB in the end (delta: -16.8MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.28ms. Allocated memory is still 94.4MB. Free memory was 64.4MB in the beginning and 61.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.04ms. Allocated memory is still 94.4MB. Free memory was 61.9MB in the beginning and 59.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1048.12ms. Allocated memory is still 94.4MB. Free memory was 59.9MB in the beginning and 51.5MB in the end (delta: 8.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14276.96ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 50.9MB in the beginning and 55.0MB in the end (delta: -4.1MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 115.3MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9s, 136 PlacesBefore, 45 PlacesAfterwards, 130 TransitionsBefore, 37 TransitionsAfterwards, 2800 CoEnabledTransitionPairs, 8 FixpointIterations, 46 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 129 TotalNumberOfCompositions, 8101 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4397, independent: 4184, independent conditional: 0, independent unconditional: 4184, dependent: 213, dependent conditional: 0, dependent unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2229, independent: 2168, independent conditional: 0, independent unconditional: 2168, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2229, independent: 2117, independent conditional: 0, independent unconditional: 2117, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 112, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 533, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 416, dependent conditional: 0, dependent unconditional: 416, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4397, independent: 2016, independent conditional: 0, independent unconditional: 2016, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 2229, unknown conditional: 0, unknown unconditional: 2229] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 242, Positive conditional cache size: 0, Positive unconditional cache size: 242, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t497; [L839] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t497={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t498; [L841] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t497={-6:0}, t498={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t499; [L843] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t497={-6:0}, t498={-10:0}, t499={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L797] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497={-6:0}, t498={-10:0}, t499={-2:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix019_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 843]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 463 IncrementalHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 33 mSDtfsCounter, 463 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1288occurred in iteration=0, InterpolantAutomatonStates: 24, 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, 7 MinimizatonAttempts, 143 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 186 SizeOfPredicates, 1 NumberOfNonLiveVariables, 752 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 05:04:15,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f171d1a2-1a18-4b2d-9b76-6b329a5889d7/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample