./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60cd4209446f80c263553fdb6a481b4dd4e668058f5fe80fa8786bdb8310f6e8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:14:35,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:14:35,388 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-21 22:14:35,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:14:35,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:14:35,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:14:35,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:14:35,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:14:35,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:14:35,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:14:35,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:14:35,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:14:35,429 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:14:35,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:14:35,430 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:14:35,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:14:35,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:14:35,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:14:35,432 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 22:14:35,433 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 22:14:35,433 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 22:14:35,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:14:35,438 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 22:14:35,438 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:14:35,438 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:14:35,439 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:14:35,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:14:35,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:14:35,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:14:35,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:14:35,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:14:35,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:14:35,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:14:35,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:14:35,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:14:35,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:14:35,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:14:35,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:14:35,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:14:35,445 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60cd4209446f80c263553fdb6a481b4dd4e668058f5fe80fa8786bdb8310f6e8 [2023-11-21 22:14:35,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:14:35,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:14:35,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:14:35,800 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:14:35,801 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:14:35,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-21 22:14:38,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:14:39,069 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:14:39,070 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-21 22:14:39,118 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/data/66e8df453/4f35b0a9615e4173a37da28ec31700f6/FLAGf6fa6bc2c [2023-11-21 22:14:39,133 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/data/66e8df453/4f35b0a9615e4173a37da28ec31700f6 [2023-11-21 22:14:39,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:14:39,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:14:39,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:39,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:14:39,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:14:39,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:39" (1/1) ... [2023-11-21 22:14:39,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d8dbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:39, skipping insertion in model container [2023-11-21 22:14:39,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:39" (1/1) ... [2023-11-21 22:14:39,199 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:14:39,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:39,624 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:14:39,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:39,737 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:14:39,738 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:14:39,745 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:14:39,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:39 WrapperNode [2023-11-21 22:14:39,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:39,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:39,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:14:39,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:14:39,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:39" (1/1) ... [2023-11-21 22:14:39,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:39" (1/1) ... [2023-11-21 22:14:39,817 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 118 [2023-11-21 22:14:39,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:39,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:14:39,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:14:39,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:14:39,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:39" (1/1) ... [2023-11-21 22:14:39,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:39" (1/1) ... [2023-11-21 22:14:39,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:39" (1/1) ... [2023-11-21 22:14:39,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:39" (1/1) ... [2023-11-21 22:14:39,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:39" (1/1) ... [2023-11-21 22:14:39,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:39" (1/1) ... [2023-11-21 22:14:39,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:39" (1/1) ... [2023-11-21 22:14:39,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:39" (1/1) ... [2023-11-21 22:14:39,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:14:39,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:14:39,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:14:39,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:14:39,875 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:39" (1/1) ... [2023-11-21 22:14:39,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:14:39,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:39,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:14:39,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:14:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:14:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 22:14:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:14:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:14:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:14:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 22:14:39,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 22:14:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 22:14:39,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 22:14:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 22:14:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 22:14:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:14:39,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:14:39,964 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:14:40,175 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:14:40,178 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:14:40,598 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:14:40,890 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:14:40,891 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:14:40,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:40 BoogieIcfgContainer [2023-11-21 22:14:40,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:14:40,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:14:40,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:14:40,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:14:40,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:14:39" (1/3) ... [2023-11-21 22:14:40,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4670a095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:14:40, skipping insertion in model container [2023-11-21 22:14:40,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:39" (2/3) ... [2023-11-21 22:14:40,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4670a095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:14:40, skipping insertion in model container [2023-11-21 22:14:40,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:40" (3/3) ... [2023-11-21 22:14:40,902 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-21 22:14:40,921 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:14:40,921 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-21 22:14:40,921 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:14:40,985 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 22:14:41,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 92 flow [2023-11-21 22:14:41,069 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-21 22:14:41,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:14:41,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-11-21 22:14:41,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 42 transitions, 92 flow [2023-11-21 22:14:41,079 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 40 transitions, 86 flow [2023-11-21 22:14:41,093 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:14:41,103 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=PETRI_NET, 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;@3bc4a3ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:14:41,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-21 22:14:41,110 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:14:41,110 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-21 22:14:41,110 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:14:41,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:41,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:14:41,112 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:41,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:41,120 INFO L85 PathProgramCache]: Analyzing trace with hash 11541, now seen corresponding path program 1 times [2023-11-21 22:14:41,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:41,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083837096] [2023-11-21 22:14:41,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:41,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:41,475 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-21 22:14:41,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:41,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083837096] [2023-11-21 22:14:41,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083837096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:41,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:41,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:14:41,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106585783] [2023-11-21 22:14:41,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:41,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:14:41,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:41,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:41,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:41,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-21 22:14:41,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-21 22:14:41,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:41,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-21 22:14:41,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:41,833 INFO L124 PetriNetUnfolderBase]: 237/558 cut-off events. [2023-11-21 22:14:41,833 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-21 22:14:41,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 558 events. 237/558 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3206 event pairs, 175 based on Foata normal form. 40/536 useless extension candidates. Maximal degree in co-relation 970. Up to 307 conditions per place. [2023-11-21 22:14:41,847 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 24 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-21 22:14:41,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 144 flow [2023-11-21 22:14:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:14:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2023-11-21 22:14:41,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2023-11-21 22:14:41,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2023-11-21 22:14:41,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2023-11-21 22:14:41,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:41,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2023-11-21 22:14:41,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-21 22:14:41,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:41,880 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:41,882 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 86 flow. Second operand 3 states and 86 transitions. [2023-11-21 22:14:41,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 144 flow [2023-11-21 22:14:41,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:14:41,890 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-21 22:14:41,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-21 22:14:41,899 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-21 22:14:41,900 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-21 22:14:41,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-21 22:14:41,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:41,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:14:41,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:14:41,901 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:41,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:41,902 INFO L85 PathProgramCache]: Analyzing trace with hash 11542, now seen corresponding path program 1 times [2023-11-21 22:14:41,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:41,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650003227] [2023-11-21 22:14:41,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:41,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:42,043 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-21 22:14:42,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:42,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650003227] [2023-11-21 22:14:42,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650003227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:42,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:42,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:14:42,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917519529] [2023-11-21 22:14:42,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:42,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:14:42,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:42,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:42,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:42,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-21 22:14:42,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-21 22:14:42,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:42,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-21 22:14:42,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:42,227 INFO L124 PetriNetUnfolderBase]: 237/557 cut-off events. [2023-11-21 22:14:42,227 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-21 22:14:42,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 557 events. 237/557 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3216 event pairs, 175 based on Foata normal form. 1/496 useless extension candidates. Maximal degree in co-relation 990. Up to 306 conditions per place. [2023-11-21 22:14:42,234 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 23 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-21 22:14:42,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 142 flow [2023-11-21 22:14:42,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:42,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:14:42,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2023-11-21 22:14:42,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2023-11-21 22:14:42,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2023-11-21 22:14:42,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2023-11-21 22:14:42,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:42,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2023-11-21 22:14:42,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-21 22:14:42,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:42,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:42,240 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 86 transitions. [2023-11-21 22:14:42,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 142 flow [2023-11-21 22:14:42,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:14:42,243 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-21 22:14:42,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-21 22:14:42,245 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-21 22:14:42,245 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-21 22:14:42,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-21 22:14:42,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:42,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:14:42,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:14:42,246 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:42,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:42,247 INFO L85 PathProgramCache]: Analyzing trace with hash 344136189, now seen corresponding path program 1 times [2023-11-21 22:14:42,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:42,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441329614] [2023-11-21 22:14:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:42,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:42,306 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-21 22:14:42,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:42,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441329614] [2023-11-21 22:14:42,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441329614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:42,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:42,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:14:42,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170999487] [2023-11-21 22:14:42,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:42,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:14:42,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:42,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:42,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:42,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-21 22:14:42,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-21 22:14:42,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:42,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-21 22:14:42,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:42,543 INFO L124 PetriNetUnfolderBase]: 241/552 cut-off events. [2023-11-21 22:14:42,543 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-21 22:14:42,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 552 events. 241/552 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3167 event pairs, 183 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 994. Up to 309 conditions per place. [2023-11-21 22:14:42,548 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 24 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-21 22:14:42,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 142 flow [2023-11-21 22:14:42,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:14:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-21 22:14:42,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-21 22:14:42,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-21 22:14:42,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-21 22:14:42,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:42,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-21 22:14:42,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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-21 22:14:42,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:42,555 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:42,555 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 84 transitions. [2023-11-21 22:14:42,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 142 flow [2023-11-21 22:14:42,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:14:42,558 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-21 22:14:42,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-11-21 22:14:42,559 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-21 22:14:42,559 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-21 22:14:42,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-21 22:14:42,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:42,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:14:42,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:14:42,560 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:42,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:42,561 INFO L85 PathProgramCache]: Analyzing trace with hash 344136190, now seen corresponding path program 1 times [2023-11-21 22:14:42,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:42,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814493653] [2023-11-21 22:14:42,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:42,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:14:42,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:42,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814493653] [2023-11-21 22:14:42,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814493653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:42,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:42,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:14:42,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165314243] [2023-11-21 22:14:42,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:42,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:14:42,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:42,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:42,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:42,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-21 22:14:42,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-21 22:14:42,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:42,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-21 22:14:42,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:42,867 INFO L124 PetriNetUnfolderBase]: 237/547 cut-off events. [2023-11-21 22:14:42,867 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-21 22:14:42,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 547 events. 237/547 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3158 event pairs, 107 based on Foata normal form. 5/503 useless extension candidates. Maximal degree in co-relation 985. Up to 300 conditions per place. [2023-11-21 22:14:42,872 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 23 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-21 22:14:42,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 138 flow [2023-11-21 22:14:42,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:14:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2023-11-21 22:14:42,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2023-11-21 22:14:42,874 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2023-11-21 22:14:42,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2023-11-21 22:14:42,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:42,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2023-11-21 22:14:42,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-21 22:14:42,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:42,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:42,877 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 86 transitions. [2023-11-21 22:14:42,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 138 flow [2023-11-21 22:14:42,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:14:42,879 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 74 flow [2023-11-21 22:14:42,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-11-21 22:14:42,880 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-11-21 22:14:42,880 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 74 flow [2023-11-21 22:14:42,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-21 22:14:42,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:42,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:14:42,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:14:42,882 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:42,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:42,882 INFO L85 PathProgramCache]: Analyzing trace with hash 344137133, now seen corresponding path program 1 times [2023-11-21 22:14:42,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:42,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744246117] [2023-11-21 22:14:42,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:42,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:43,011 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-21 22:14:43,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:43,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744246117] [2023-11-21 22:14:43,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744246117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:43,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:43,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:14:43,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679483452] [2023-11-21 22:14:43,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:43,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:14:43,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:43,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:43,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:43,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2023-11-21 22:14:43,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-21 22:14:43,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:43,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2023-11-21 22:14:43,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:43,158 INFO L124 PetriNetUnfolderBase]: 183/393 cut-off events. [2023-11-21 22:14:43,158 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-21 22:14:43,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 393 events. 183/393 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1956 event pairs, 69 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 736. Up to 265 conditions per place. [2023-11-21 22:14:43,162 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 25 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2023-11-21 22:14:43,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 160 flow [2023-11-21 22:14:43,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:14:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-21 22:14:43,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2023-11-21 22:14:43,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-21 22:14:43,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-21 22:14:43,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:43,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-21 22:14:43,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-21 22:14:43,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:43,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:43,167 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 74 flow. Second operand 3 states and 93 transitions. [2023-11-21 22:14:43,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 160 flow [2023-11-21 22:14:43,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:14:43,169 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2023-11-21 22:14:43,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-11-21 22:14:43,170 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2023-11-21 22:14:43,171 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2023-11-21 22:14:43,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-21 22:14:43,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:43,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:43,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:14:43,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:43,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:43,173 INFO L85 PathProgramCache]: Analyzing trace with hash -900160555, now seen corresponding path program 1 times [2023-11-21 22:14:43,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:43,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662305585] [2023-11-21 22:14:43,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:43,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:43,582 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-21 22:14:43,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:43,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662305585] [2023-11-21 22:14:43,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662305585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:43,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:43,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:14:43,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724699559] [2023-11-21 22:14:43,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:43,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:14:43,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:43,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:14:43,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:14:43,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-21 22:14:43,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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-21 22:14:43,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:43,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-21 22:14:43,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:43,831 INFO L124 PetriNetUnfolderBase]: 159/370 cut-off events. [2023-11-21 22:14:43,831 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-21 22:14:43,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 370 events. 159/370 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1955 event pairs, 132 based on Foata normal form. 16/376 useless extension candidates. Maximal degree in co-relation 683. Up to 235 conditions per place. [2023-11-21 22:14:43,835 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 17 selfloop transitions, 2 changer transitions 7/39 dead transitions. [2023-11-21 22:14:43,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 142 flow [2023-11-21 22:14:43,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:14:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 22:14:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2023-11-21 22:14:43,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2023-11-21 22:14:43,837 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 117 transitions. [2023-11-21 22:14:43,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 117 transitions. [2023-11-21 22:14:43,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:43,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 117 transitions. [2023-11-21 22:14:43,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 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-21 22:14:43,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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-21 22:14:43,841 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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-21 22:14:43,842 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 5 states and 117 transitions. [2023-11-21 22:14:43,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 142 flow [2023-11-21 22:14:43,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:14:43,845 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-11-21 22:14:43,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-11-21 22:14:43,848 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2023-11-21 22:14:43,848 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-11-21 22:14:43,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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-21 22:14:43,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:43,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:43,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:14:43,850 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:43,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:43,850 INFO L85 PathProgramCache]: Analyzing trace with hash -900159313, now seen corresponding path program 1 times [2023-11-21 22:14:43,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:43,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776703773] [2023-11-21 22:14:43,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:43,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:14:44,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:44,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776703773] [2023-11-21 22:14:44,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776703773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:44,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:44,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:14:44,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026255186] [2023-11-21 22:14:44,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:44,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:14:44,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:44,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:14:44,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:14:44,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-21 22:14:44,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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-21 22:14:44,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:44,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-21 22:14:44,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:44,192 INFO L124 PetriNetUnfolderBase]: 198/443 cut-off events. [2023-11-21 22:14:44,192 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-21 22:14:44,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 443 events. 198/443 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2143 event pairs, 38 based on Foata normal form. 25/457 useless extension candidates. Maximal degree in co-relation 817. Up to 191 conditions per place. [2023-11-21 22:14:44,195 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 31 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2023-11-21 22:14:44,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 178 flow [2023-11-21 22:14:44,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:14:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:14:44,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2023-11-21 22:14:44,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2023-11-21 22:14:44,197 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 110 transitions. [2023-11-21 22:14:44,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 110 transitions. [2023-11-21 22:14:44,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:44,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 110 transitions. [2023-11-21 22:14:44,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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-21 22:14:44,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 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-21 22:14:44,199 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 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-21 22:14:44,199 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 4 states and 110 transitions. [2023-11-21 22:14:44,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 178 flow [2023-11-21 22:14:44,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:14:44,218 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 89 flow [2023-11-21 22:14:44,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2023-11-21 22:14:44,219 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-11-21 22:14:44,219 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 89 flow [2023-11-21 22:14:44,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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-21 22:14:44,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:44,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:44,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:14:44,220 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:44,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:44,221 INFO L85 PathProgramCache]: Analyzing trace with hash 882239732, now seen corresponding path program 1 times [2023-11-21 22:14:44,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:44,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146440069] [2023-11-21 22:14:44,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,447 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-21 22:14:44,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:44,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146440069] [2023-11-21 22:14:44,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146440069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:44,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:44,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:14:44,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937553633] [2023-11-21 22:14:44,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:44,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:14:44,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:44,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:14:44,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:14:44,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-21 22:14:44,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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-21 22:14:44,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:44,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-21 22:14:44,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:44,587 INFO L124 PetriNetUnfolderBase]: 102/230 cut-off events. [2023-11-21 22:14:44,588 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-21 22:14:44,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 230 events. 102/230 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 772 event pairs, 26 based on Foata normal form. 16/237 useless extension candidates. Maximal degree in co-relation 519. Up to 86 conditions per place. [2023-11-21 22:14:44,590 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 26 selfloop transitions, 6 changer transitions 1/44 dead transitions. [2023-11-21 22:14:44,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 187 flow [2023-11-21 22:14:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:14:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 22:14:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2023-11-21 22:14:44,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2023-11-21 22:14:44,592 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 125 transitions. [2023-11-21 22:14:44,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 125 transitions. [2023-11-21 22:14:44,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:44,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 125 transitions. [2023-11-21 22:14:44,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 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-21 22:14:44,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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-21 22:14:44,594 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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-21 22:14:44,594 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 89 flow. Second operand 5 states and 125 transitions. [2023-11-21 22:14:44,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 187 flow [2023-11-21 22:14:44,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 178 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-21 22:14:44,601 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 105 flow [2023-11-21 22:14:44,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-11-21 22:14:44,605 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2023-11-21 22:14:44,605 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 105 flow [2023-11-21 22:14:44,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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-21 22:14:44,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:44,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:44,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:14:44,606 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:44,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:44,607 INFO L85 PathProgramCache]: Analyzing trace with hash -812960445, now seen corresponding path program 1 times [2023-11-21 22:14:44,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:44,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668869166] [2023-11-21 22:14:44,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:44,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:45,421 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-21 22:14:45,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:45,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668869166] [2023-11-21 22:14:45,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668869166] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:45,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:45,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 22:14:45,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347125291] [2023-11-21 22:14:45,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:45,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:14:45,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:45,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:14:45,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:14:45,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-21 22:14:45,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 105 flow. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 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-21 22:14:45,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:45,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-21 22:14:45,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:45,793 INFO L124 PetriNetUnfolderBase]: 184/410 cut-off events. [2023-11-21 22:14:45,793 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-21 22:14:45,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 410 events. 184/410 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1759 event pairs, 50 based on Foata normal form. 4/403 useless extension candidates. Maximal degree in co-relation 928. Up to 107 conditions per place. [2023-11-21 22:14:45,796 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 21 selfloop transitions, 9 changer transitions 35/77 dead transitions. [2023-11-21 22:14:45,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 345 flow [2023-11-21 22:14:45,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 22:14:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-21 22:14:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2023-11-21 22:14:45,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5793650793650794 [2023-11-21 22:14:45,798 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 219 transitions. [2023-11-21 22:14:45,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 219 transitions. [2023-11-21 22:14:45,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:45,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 219 transitions. [2023-11-21 22:14:45,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 0 states have call successors, (0), 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-21 22:14:45,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 42.0) internal successors, (420), 10 states have internal predecessors, (420), 0 states have call successors, (0), 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-21 22:14:45,801 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 42.0) internal successors, (420), 10 states have internal predecessors, (420), 0 states have call successors, (0), 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-21 22:14:45,801 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 105 flow. Second operand 9 states and 219 transitions. [2023-11-21 22:14:45,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 345 flow [2023-11-21 22:14:45,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 305 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-11-21 22:14:45,806 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 149 flow [2023-11-21 22:14:45,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=149, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-11-21 22:14:45,807 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-11-21 22:14:45,807 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 149 flow [2023-11-21 22:14:45,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 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-21 22:14:45,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:45,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:45,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:14:45,808 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:45,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:45,808 INFO L85 PathProgramCache]: Analyzing trace with hash -784630455, now seen corresponding path program 2 times [2023-11-21 22:14:45,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:45,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20237508] [2023-11-21 22:14:45,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:45,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:45,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:45,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:45,932 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:14:45,933 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-21 22:14:45,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-21 22:14:45,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-21 22:14:45,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-21 22:14:45,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-21 22:14:45,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-21 22:14:45,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-21 22:14:45,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-21 22:14:45,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-21 22:14:45,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-21 22:14:45,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:14:45,937 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:45,942 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 22:14:45,942 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:14:45,982 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-21 22:14:45,984 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 22:14:45,992 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 22:14:45,993 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 22:14:46,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:14:46 BasicIcfg [2023-11-21 22:14:46,013 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:14:46,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:14:46,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:14:46,014 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:14:46,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:40" (3/4) ... [2023-11-21 22:14:46,016 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-21 22:14:46,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:14:46,021 INFO L158 Benchmark]: Toolchain (without parser) took 6883.70ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 147.0MB in the beginning and 106.4MB in the end (delta: 40.6MB). Peak memory consumption was 120.6MB. Max. memory is 16.1GB. [2023-11-21 22:14:46,021 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:14:46,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.88ms. Allocated memory is still 176.2MB. Free memory was 146.3MB in the beginning and 123.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-21 22:14:46,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.88ms. Allocated memory is still 176.2MB. Free memory was 123.2MB in the beginning and 121.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:14:46,022 INFO L158 Benchmark]: Boogie Preprocessor took 54.97ms. Allocated memory is still 176.2MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:14:46,022 INFO L158 Benchmark]: RCFGBuilder took 1018.99ms. Allocated memory is still 176.2MB. Free memory was 119.0MB in the beginning and 109.2MB in the end (delta: 9.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-21 22:14:46,023 INFO L158 Benchmark]: TraceAbstraction took 5118.50ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 108.4MB in the beginning and 106.4MB in the end (delta: 2.0MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2023-11-21 22:14:46,025 INFO L158 Benchmark]: Witness Printer took 6.13ms. Allocated memory is still 255.9MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:14:46,029 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 607.88ms. Allocated memory is still 176.2MB. Free memory was 146.3MB in the beginning and 123.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.88ms. Allocated memory is still 176.2MB. Free memory was 123.2MB in the beginning and 121.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.97ms. Allocated memory is still 176.2MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1018.99ms. Allocated memory is still 176.2MB. Free memory was 119.0MB in the beginning and 109.2MB in the end (delta: 9.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5118.50ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 108.4MB in the beginning and 106.4MB in the end (delta: 2.0MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. * Witness Printer took 6.13ms. Allocated memory is still 255.9MB. Free memory is still 106.4MB. 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: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1705; [L811] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1705={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 0 pthread_t t1706; [L813] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1705={5:0}, t1706={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L738] 1 x$w_buff1 = x$w_buff0 [L739] 1 x$w_buff0 = 1 [L740] 1 x$w_buff1_used = x$w_buff0_used [L741] 1 x$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L743] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L744] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L745] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L746] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L749] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L766] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 x$flush_delayed = weak$$choice2 [L775] 2 x$mem_tmp = x [L776] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L777] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L778] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L779] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L780] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L782] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = x [L784] 2 x = x$flush_delayed ? x$mem_tmp : x [L785] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L752] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L755] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705={5:0}, t1706={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705={5:0}, t1706={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L826] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705={5:0}, t1706={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L17] 0 __assert_fail ("0", "rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 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: 808]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 811]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 59 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 273 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 218 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 646 IncrementalHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 23 mSDtfsCounter, 646 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=9, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 574 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-21 22:14:46,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60cd4209446f80c263553fdb6a481b4dd4e668058f5fe80fa8786bdb8310f6e8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:14:48,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:14:48,882 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-21 22:14:48,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:14:48,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:14:48,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:14:48,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:14:48,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:14:48,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:14:48,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:14:48,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:14:48,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:14:48,943 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:14:48,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:14:48,945 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:14:48,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:14:48,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:14:48,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:14:48,947 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 22:14:48,948 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 22:14:48,948 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 22:14:48,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:14:48,949 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 22:14:48,950 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-21 22:14:48,950 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-21 22:14:48,950 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:14:48,951 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:14:48,951 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:14:48,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:14:48,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:14:48,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:14:48,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:14:48,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:14:48,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:14:48,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:14:48,955 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-21 22:14:48,956 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-21 22:14:48,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:14:48,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:14:48,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:14:48,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:14:48,958 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-21 22:14:48,958 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60cd4209446f80c263553fdb6a481b4dd4e668058f5fe80fa8786bdb8310f6e8 [2023-11-21 22:14:49,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:14:49,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:14:49,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:14:49,403 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:14:49,404 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:14:49,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-21 22:14:52,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:14:52,959 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:14:52,963 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-21 22:14:52,995 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/data/2b936509a/d8781e9ea634462fbea511f83d2b92e3/FLAGe69b5a416 [2023-11-21 22:14:53,008 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/data/2b936509a/d8781e9ea634462fbea511f83d2b92e3 [2023-11-21 22:14:53,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:14:53,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:14:53,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:53,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:14:53,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:14:53,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:53" (1/1) ... [2023-11-21 22:14:53,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f81b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:53, skipping insertion in model container [2023-11-21 22:14:53,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:53" (1/1) ... [2023-11-21 22:14:53,096 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:14:53,620 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:53,677 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:14:53,785 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:53,834 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:14:53,834 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:14:53,843 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:14:53,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:53 WrapperNode [2023-11-21 22:14:53,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:53,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:53,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:14:53,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:14:53,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:53" (1/1) ... [2023-11-21 22:14:53,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:53" (1/1) ... [2023-11-21 22:14:53,941 INFO L138 Inliner]: procedures = 178, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119 [2023-11-21 22:14:53,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:53,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:14:53,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:14:53,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:14:53,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:53" (1/1) ... [2023-11-21 22:14:53,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:53" (1/1) ... [2023-11-21 22:14:53,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:53" (1/1) ... [2023-11-21 22:14:53,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:53" (1/1) ... [2023-11-21 22:14:53,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:53" (1/1) ... [2023-11-21 22:14:54,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:53" (1/1) ... [2023-11-21 22:14:54,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:53" (1/1) ... [2023-11-21 22:14:54,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:53" (1/1) ... [2023-11-21 22:14:54,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:14:54,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:14:54,031 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:14:54,032 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:14:54,033 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:53" (1/1) ... [2023-11-21 22:14:54,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:14:54,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:54,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:14:54,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:14:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 22:14:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:14:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:14:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:14:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-21 22:14:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-21 22:14:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 22:14:54,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 22:14:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 22:14:54,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 22:14:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 22:14:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:14:54,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:14:54,137 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:14:54,358 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:14:54,360 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:14:54,799 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:14:55,012 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:14:55,013 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:14:55,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:55 BoogieIcfgContainer [2023-11-21 22:14:55,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:14:55,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:14:55,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:14:55,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:14:55,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:14:53" (1/3) ... [2023-11-21 22:14:55,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560cf954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:14:55, skipping insertion in model container [2023-11-21 22:14:55,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:53" (2/3) ... [2023-11-21 22:14:55,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560cf954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:14:55, skipping insertion in model container [2023-11-21 22:14:55,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:55" (3/3) ... [2023-11-21 22:14:55,027 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-21 22:14:55,047 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:14:55,048 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-21 22:14:55,048 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:14:55,142 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 22:14:55,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 92 flow [2023-11-21 22:14:55,214 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-21 22:14:55,214 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:14:55,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-11-21 22:14:55,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 42 transitions, 92 flow [2023-11-21 22:14:55,232 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 40 transitions, 86 flow [2023-11-21 22:14:55,247 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:14:55,256 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=PETRI_NET, 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;@60d33ca1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:14:55,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-21 22:14:55,260 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:14:55,260 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-21 22:14:55,260 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:14:55,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:55,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:14:55,262 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:55,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:55,268 INFO L85 PathProgramCache]: Analyzing trace with hash 11605, now seen corresponding path program 1 times [2023-11-21 22:14:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:14:55,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245213921] [2023-11-21 22:14:55,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:55,282 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-21 22:14:55,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:14:55,285 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:55,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:55,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:14:55,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:55,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-21 22:14:55,468 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-21 22:14:55,468 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:14:55,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:14:55,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245213921] [2023-11-21 22:14:55,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245213921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:55,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:55,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:14:55,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507538475] [2023-11-21 22:14:55,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:55,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:14:55,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:14:55,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:55,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:55,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-21 22:14:55,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-21 22:14:55,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:55,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-21 22:14:55,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:55,797 INFO L124 PetriNetUnfolderBase]: 237/558 cut-off events. [2023-11-21 22:14:55,797 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-21 22:14:55,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 558 events. 237/558 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3217 event pairs, 175 based on Foata normal form. 40/537 useless extension candidates. Maximal degree in co-relation 970. Up to 307 conditions per place. [2023-11-21 22:14:55,806 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 24 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-21 22:14:55,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 144 flow [2023-11-21 22:14:55,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:14:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2023-11-21 22:14:55,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2023-11-21 22:14:55,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2023-11-21 22:14:55,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2023-11-21 22:14:55,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:55,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2023-11-21 22:14:55,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-21 22:14:55,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:55,827 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:55,829 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 86 flow. Second operand 3 states and 86 transitions. [2023-11-21 22:14:55,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 144 flow [2023-11-21 22:14:55,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:14:55,836 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-21 22:14:55,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-21 22:14:55,842 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-21 22:14:55,842 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-21 22:14:55,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-21 22:14:55,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:55,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:14:55,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:56,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:56,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:56,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:56,046 INFO L85 PathProgramCache]: Analyzing trace with hash 11606, now seen corresponding path program 1 times [2023-11-21 22:14:56,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:14:56,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037526330] [2023-11-21 22:14:56,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:56,048 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-21 22:14:56,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:14:56,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:56,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:56,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:14:56,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:56,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:14:56,182 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-21 22:14:56,182 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:14:56,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:14:56,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037526330] [2023-11-21 22:14:56,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037526330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:56,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:56,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:14:56,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265364391] [2023-11-21 22:14:56,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:56,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:14:56,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:14:56,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:56,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:56,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-21 22:14:56,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-21 22:14:56,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:56,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-21 22:14:56,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:56,451 INFO L124 PetriNetUnfolderBase]: 237/557 cut-off events. [2023-11-21 22:14:56,452 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-21 22:14:56,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 557 events. 237/557 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3179 event pairs, 175 based on Foata normal form. 1/497 useless extension candidates. Maximal degree in co-relation 990. Up to 306 conditions per place. [2023-11-21 22:14:56,461 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 23 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-21 22:14:56,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 142 flow [2023-11-21 22:14:56,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:14:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2023-11-21 22:14:56,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2023-11-21 22:14:56,468 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2023-11-21 22:14:56,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2023-11-21 22:14:56,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:56,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2023-11-21 22:14:56,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-21 22:14:56,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:56,475 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:56,475 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 86 transitions. [2023-11-21 22:14:56,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 142 flow [2023-11-21 22:14:56,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:14:56,479 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-21 22:14:56,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-21 22:14:56,480 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-21 22:14:56,480 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-21 22:14:56,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-21 22:14:56,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:56,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:14:56,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:56,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:56,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:56,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:56,682 INFO L85 PathProgramCache]: Analyzing trace with hash 346043821, now seen corresponding path program 1 times [2023-11-21 22:14:56,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:14:56,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818456949] [2023-11-21 22:14:56,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:56,683 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-21 22:14:56,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:14:56,684 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:56,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:56,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 22:14:56,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:56,837 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-21 22:14:56,837 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:14:56,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:14:56,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818456949] [2023-11-21 22:14:56,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818456949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:56,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:56,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:14:56,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531688592] [2023-11-21 22:14:56,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:56,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:14:56,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:14:56,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:56,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:56,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2023-11-21 22:14:56,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-21 22:14:56,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:56,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2023-11-21 22:14:56,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:56,959 INFO L124 PetriNetUnfolderBase]: 183/418 cut-off events. [2023-11-21 22:14:56,959 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-21 22:14:56,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 418 events. 183/418 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2207 event pairs, 21 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 757. Up to 265 conditions per place. [2023-11-21 22:14:56,963 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 25 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2023-11-21 22:14:56,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 162 flow [2023-11-21 22:14:56,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:14:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-21 22:14:56,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2023-11-21 22:14:56,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-21 22:14:56,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-21 22:14:56,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:56,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-21 22:14:56,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-21 22:14:56,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:56,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:56,969 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 93 transitions. [2023-11-21 22:14:56,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 162 flow [2023-11-21 22:14:56,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:14:56,971 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 74 flow [2023-11-21 22:14:56,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-11-21 22:14:56,972 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-21 22:14:56,972 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 74 flow [2023-11-21 22:14:56,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-21 22:14:56,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:56,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:14:56,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:57,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:57,176 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:57,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:57,176 INFO L85 PathProgramCache]: Analyzing trace with hash 346042877, now seen corresponding path program 1 times [2023-11-21 22:14:57,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:14:57,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982897601] [2023-11-21 22:14:57,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:57,177 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-21 22:14:57,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:14:57,178 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:57,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:57,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:14:57,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:57,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-21 22:14:57,272 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-21 22:14:57,272 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:14:57,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:14:57,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982897601] [2023-11-21 22:14:57,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982897601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:57,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:57,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:14:57,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863959508] [2023-11-21 22:14:57,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:57,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:14:57,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:14:57,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:57,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:57,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-21 22:14:57,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-21 22:14:57,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:57,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-21 22:14:57,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:57,409 INFO L124 PetriNetUnfolderBase]: 162/399 cut-off events. [2023-11-21 22:14:57,409 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-21 22:14:57,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 399 events. 162/399 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2127 event pairs, 72 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 720. Up to 242 conditions per place. [2023-11-21 22:14:57,413 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 21 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-11-21 22:14:57,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 132 flow [2023-11-21 22:14:57,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:14:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2023-11-21 22:14:57,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2023-11-21 22:14:57,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 81 transitions. [2023-11-21 22:14:57,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 81 transitions. [2023-11-21 22:14:57,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:57,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 81 transitions. [2023-11-21 22:14:57,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-21 22:14:57,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:57,417 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:57,417 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 74 flow. Second operand 3 states and 81 transitions. [2023-11-21 22:14:57,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 132 flow [2023-11-21 22:14:57,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:14:57,419 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 72 flow [2023-11-21 22:14:57,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-11-21 22:14:57,420 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2023-11-21 22:14:57,421 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 72 flow [2023-11-21 22:14:57,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-21 22:14:57,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:57,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:14:57,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:57,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:57,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:57,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:57,625 INFO L85 PathProgramCache]: Analyzing trace with hash 346042878, now seen corresponding path program 1 times [2023-11-21 22:14:57,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:14:57,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447419091] [2023-11-21 22:14:57,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:57,626 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-21 22:14:57,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:14:57,627 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:57,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:57,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:14:57,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:57,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:14:57,732 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-21 22:14:57,733 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:14:57,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:14:57,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447419091] [2023-11-21 22:14:57,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447419091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:57,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:57,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:14:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505778741] [2023-11-21 22:14:57,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:57,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:14:57,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:14:57,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:57,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:57,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-21 22:14:57,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-21 22:14:57,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:57,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-21 22:14:57,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:57,875 INFO L124 PetriNetUnfolderBase]: 159/383 cut-off events. [2023-11-21 22:14:57,875 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-21 22:14:57,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 383 events. 159/383 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2052 event pairs, 112 based on Foata normal form. 4/375 useless extension candidates. Maximal degree in co-relation 686. Up to 235 conditions per place. [2023-11-21 22:14:57,879 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 20 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-11-21 22:14:57,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 126 flow [2023-11-21 22:14:57,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:14:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2023-11-21 22:14:57,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2023-11-21 22:14:57,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 83 transitions. [2023-11-21 22:14:57,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 83 transitions. [2023-11-21 22:14:57,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:57,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 83 transitions. [2023-11-21 22:14:57,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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-21 22:14:57,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:57,887 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 22:14:57,887 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 72 flow. Second operand 3 states and 83 transitions. [2023-11-21 22:14:57,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 126 flow [2023-11-21 22:14:57,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:14:57,889 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 70 flow [2023-11-21 22:14:57,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-11-21 22:14:57,892 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -7 predicate places. [2023-11-21 22:14:57,892 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 70 flow [2023-11-21 22:14:57,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-21 22:14:57,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:57,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:57,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:58,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:58,096 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:58,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:58,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1313079469, now seen corresponding path program 1 times [2023-11-21 22:14:58,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:14:58,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863437796] [2023-11-21 22:14:58,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:58,098 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-21 22:14:58,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:14:58,102 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:58,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:58,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:14:58,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:58,226 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-21 22:14:58,226 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:14:58,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:14:58,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863437796] [2023-11-21 22:14:58,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863437796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:58,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:58,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:14:58,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279011153] [2023-11-21 22:14:58,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:58,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:14:58,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:14:58,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:14:58,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:14:58,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-21 22:14:58,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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-21 22:14:58,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:58,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-21 22:14:58,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:58,400 INFO L124 PetriNetUnfolderBase]: 220/497 cut-off events. [2023-11-21 22:14:58,401 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-21 22:14:58,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 497 events. 220/497 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2503 event pairs, 38 based on Foata normal form. 25/511 useless extension candidates. Maximal degree in co-relation 925. Up to 229 conditions per place. [2023-11-21 22:14:58,405 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 32 selfloop transitions, 4 changer transitions 1/49 dead transitions. [2023-11-21 22:14:58,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 184 flow [2023-11-21 22:14:58,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:14:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:14:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2023-11-21 22:14:58,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2023-11-21 22:14:58,407 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 111 transitions. [2023-11-21 22:14:58,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 111 transitions. [2023-11-21 22:14:58,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:58,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 111 transitions. [2023-11-21 22:14:58,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-21 22:14:58,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 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-21 22:14:58,409 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 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-21 22:14:58,409 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 70 flow. Second operand 4 states and 111 transitions. [2023-11-21 22:14:58,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 184 flow [2023-11-21 22:14:58,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:14:58,412 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 92 flow [2023-11-21 22:14:58,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-11-21 22:14:58,413 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-21 22:14:58,413 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 92 flow [2023-11-21 22:14:58,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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-21 22:14:58,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:58,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:58,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-21 22:14:58,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:58,616 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:58,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:58,616 INFO L85 PathProgramCache]: Analyzing trace with hash 155563998, now seen corresponding path program 1 times [2023-11-21 22:14:58,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:14:58,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33534598] [2023-11-21 22:14:58,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:58,617 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-21 22:14:58,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:14:58,618 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:58,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:58,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:14:58,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:58,788 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-21 22:14:58,789 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:14:58,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:14:58,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33534598] [2023-11-21 22:14:58,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33534598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:58,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:58,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:14:58,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477047419] [2023-11-21 22:14:58,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:58,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:14:58,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:14:58,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:14:58,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:14:58,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-21 22:14:58,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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-21 22:14:58,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:58,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-21 22:14:58,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:58,993 INFO L124 PetriNetUnfolderBase]: 106/242 cut-off events. [2023-11-21 22:14:58,994 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-21 22:14:58,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 242 events. 106/242 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 822 event pairs, 26 based on Foata normal form. 16/250 useless extension candidates. Maximal degree in co-relation 534. Up to 86 conditions per place. [2023-11-21 22:14:58,996 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 27 selfloop transitions, 6 changer transitions 1/46 dead transitions. [2023-11-21 22:14:58,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 191 flow [2023-11-21 22:14:58,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:14:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 22:14:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2023-11-21 22:14:58,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2023-11-21 22:14:58,998 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 126 transitions. [2023-11-21 22:14:58,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 126 transitions. [2023-11-21 22:14:58,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:58,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 126 transitions. [2023-11-21 22:14:59,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 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-21 22:14:59,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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-21 22:14:59,002 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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-21 22:14:59,002 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 92 flow. Second operand 5 states and 126 transitions. [2023-11-21 22:14:59,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 191 flow [2023-11-21 22:14:59,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 182 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-21 22:14:59,006 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 108 flow [2023-11-21 22:14:59,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-11-21 22:14:59,007 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2023-11-21 22:14:59,007 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 108 flow [2023-11-21 22:14:59,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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-21 22:14:59,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:59,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:59,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:59,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:59,211 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:14:59,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1805447661, now seen corresponding path program 1 times [2023-11-21 22:14:59,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:14:59,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394956053] [2023-11-21 22:14:59,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:59,212 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-21 22:14:59,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:14:59,214 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:59,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:14:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:59,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-21 22:14:59,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:59,678 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-21 22:14:59,679 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:14:59,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:14:59,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394956053] [2023-11-21 22:14:59,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394956053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:59,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:59,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:14:59,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017812502] [2023-11-21 22:14:59,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:59,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:14:59,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:14:59,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:14:59,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:14:59,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-21 22:14:59,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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-21 22:14:59,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:14:59,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-21 22:14:59,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:14:59,964 INFO L124 PetriNetUnfolderBase]: 62/168 cut-off events. [2023-11-21 22:14:59,965 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-11-21 22:14:59,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 168 events. 62/168 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 547 event pairs, 45 based on Foata normal form. 4/164 useless extension candidates. Maximal degree in co-relation 358. Up to 110 conditions per place. [2023-11-21 22:14:59,966 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 16 selfloop transitions, 2 changer transitions 3/37 dead transitions. [2023-11-21 22:14:59,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 158 flow [2023-11-21 22:14:59,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:14:59,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 22:14:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2023-11-21 22:14:59,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2023-11-21 22:14:59,968 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 112 transitions. [2023-11-21 22:14:59,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 112 transitions. [2023-11-21 22:14:59,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:59,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 112 transitions. [2023-11-21 22:14:59,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 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-21 22:14:59,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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-21 22:14:59,970 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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-21 22:14:59,971 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 108 flow. Second operand 5 states and 112 transitions. [2023-11-21 22:14:59,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 158 flow [2023-11-21 22:14:59,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 130 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-21 22:14:59,973 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 80 flow [2023-11-21 22:14:59,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-11-21 22:14:59,974 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-21 22:14:59,974 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 80 flow [2023-11-21 22:14:59,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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-21 22:14:59,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:14:59,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:59,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:15:00,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:15:00,179 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 22:15:00,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:00,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1341834583, now seen corresponding path program 1 times [2023-11-21 22:15:00,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:15:00,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930651444] [2023-11-21 22:15:00,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:00,180 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-21 22:15:00,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:15:00,183 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:15:00,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-21 22:15:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:00,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:00,435 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-21 22:15:00,436 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:15:00,437 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-21 22:15:00,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-21 22:15:00,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-21 22:15:00,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-21 22:15:00,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-21 22:15:00,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-21 22:15:00,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-21 22:15:00,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-21 22:15:00,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-21 22:15:00,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-21 22:15:00,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:00,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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-21 22:15:00,641 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:00,647 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 22:15:00,647 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:15:00,693 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-21 22:15:00,703 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 22:15:00,719 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 22:15:00,720 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 22:15:00,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:15:00 BasicIcfg [2023-11-21 22:15:00,738 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:15:00,738 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:15:00,738 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:15:00,739 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:15:00,739 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:55" (3/4) ... [2023-11-21 22:15:00,740 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-21 22:15:00,741 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:15:00,742 INFO L158 Benchmark]: Toolchain (without parser) took 7729.89ms. Allocated memory was 71.3MB in the beginning and 111.1MB in the end (delta: 39.8MB). Free memory was 45.5MB in the beginning and 44.1MB in the end (delta: 1.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2023-11-21 22:15:00,742 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 71.3MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:15:00,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 831.86ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 45.3MB in the beginning and 59.3MB in the end (delta: -14.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2023-11-21 22:15:00,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.93ms. Allocated memory is still 90.2MB. Free memory was 59.3MB in the beginning and 56.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:15:00,744 INFO L158 Benchmark]: Boogie Preprocessor took 83.25ms. Allocated memory is still 90.2MB. Free memory was 56.8MB in the beginning and 54.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:15:00,744 INFO L158 Benchmark]: RCFGBuilder took 986.21ms. Allocated memory is still 90.2MB. Free memory was 54.6MB in the beginning and 35.8MB in the end (delta: 18.9MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2023-11-21 22:15:00,745 INFO L158 Benchmark]: TraceAbstraction took 5720.52ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 35.2MB in the beginning and 44.1MB in the end (delta: -8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-21 22:15:00,745 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 111.1MB. Free memory is still 44.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:15:00,747 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.24ms. Allocated memory is still 71.3MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 831.86ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 45.3MB in the beginning and 59.3MB in the end (delta: -14.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.93ms. Allocated memory is still 90.2MB. Free memory was 59.3MB in the beginning and 56.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.25ms. Allocated memory is still 90.2MB. Free memory was 56.8MB in the beginning and 54.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 986.21ms. Allocated memory is still 90.2MB. Free memory was 54.6MB in the beginning and 35.8MB in the end (delta: 18.9MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5720.52ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 35.2MB in the beginning and 44.1MB in the end (delta: -8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 111.1MB. Free memory is still 44.1MB. 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: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1705; [L811] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1705={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L738] 1 x$w_buff1 = x$w_buff0 [L739] 1 x$w_buff0 = 1 [L740] 1 x$w_buff1_used = x$w_buff0_used [L741] 1 x$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L743] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L744] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L745] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L746] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L749] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L812] 0 pthread_t t1706; [L813] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1705={3:0}, t1706={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L766] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 x$flush_delayed = weak$$choice2 [L775] 2 x$mem_tmp = x [L776] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L777] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L778] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L779] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L780] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L782] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = x [L784] 2 x = x$flush_delayed ? x$mem_tmp : x [L785] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L752] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L755] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705={3:0}, t1706={7:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705={3:0}, t1706={7:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L826] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705={3:0}, t1706={7:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L17] 0 __assert_fail ("0", "rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 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: 808]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: 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: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 59 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 212 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 404 IncrementalHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 17 mSDtfsCounter, 404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=7, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 72 ConstructedInterpolants, 1 QuantifiedInterpolants, 658 SizeOfPredicates, 2 NumberOfNonLiveVariables, 644 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-21 22:15:00,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc2c670c-dacd-484e-9f9b-220bbfc38529/bin/uautomizer-verify-bycVGegfSx/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