./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix014.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b 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_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix014.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 615dc0a4278e77a094a63ed4629507c6f8d1cda73abba57cd69e8912d83fe5fd --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:56:08,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:56:08,751 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:56:08,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:56:08,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:56:08,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:56:08,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:56:08,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:56:08,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:56:08,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:56:08,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:56:08,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:56:08,795 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:56:08,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:56:08,796 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:56:08,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:56:08,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:56:08,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:56:08,798 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:56:08,798 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:56:08,799 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:56:08,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:56:08,805 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:56:08,806 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:56:08,806 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:56:08,807 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:56:08,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:56:08,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:56:08,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:56:08,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:56:08,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:56:08,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:56:08,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:56:08,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:56:08,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:56:08,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:56:08,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:56:08,813 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:56:08,813 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_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 615dc0a4278e77a094a63ed4629507c6f8d1cda73abba57cd69e8912d83fe5fd [2023-11-06 22:56:09,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:56:09,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:56:09,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:56:09,158 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:56:09,159 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:56:09,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix014.opt.i [2023-11-06 22:56:12,515 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:56:12,923 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:56:12,928 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/sv-benchmarks/c/pthread-wmm/mix014.opt.i [2023-11-06 22:56:12,961 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/data/580d2fef7/4fb723f39d9d4ad4a32d85add192c527/FLAGa055bdabd [2023-11-06 22:56:12,981 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/data/580d2fef7/4fb723f39d9d4ad4a32d85add192c527 [2023-11-06 22:56:12,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:56:12,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:56:12,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:56:12,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:56:13,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:56:13,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:56:12" (1/1) ... [2023-11-06 22:56:13,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7136be55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:13, skipping insertion in model container [2023-11-06 22:56:13,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:56:12" (1/1) ... [2023-11-06 22:56:13,089 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:56:13,578 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:56:13,600 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:56:13,682 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:56:13,725 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:56:13,725 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:56:13,734 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:56:13,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:13 WrapperNode [2023-11-06 22:56:13,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:56:13,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:56:13,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:56:13,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:56:13,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:13" (1/1) ... [2023-11-06 22:56:13,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:13" (1/1) ... [2023-11-06 22:56:13,851 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 171 [2023-11-06 22:56:13,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:56:13,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:56:13,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:56:13,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:56:13,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:13" (1/1) ... [2023-11-06 22:56:13,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:13" (1/1) ... [2023-11-06 22:56:13,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:13" (1/1) ... [2023-11-06 22:56:13,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:13" (1/1) ... [2023-11-06 22:56:13,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:13" (1/1) ... [2023-11-06 22:56:13,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:13" (1/1) ... [2023-11-06 22:56:13,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:13" (1/1) ... [2023-11-06 22:56:13,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:13" (1/1) ... [2023-11-06 22:56:13,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:56:13,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:56:13,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:56:13,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:56:13,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:13" (1/1) ... [2023-11-06 22:56:13,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:56:13,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:56:13,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:56:13,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:56:14,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:56:14,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:56:14,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:56:14,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:56:14,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:56:14,022 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:56:14,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:56:14,022 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:56:14,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:56:14,022 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:56:14,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:56:14,023 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:56:14,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:56:14,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:56:14,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:56:14,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:56:14,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:56:14,028 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:56:14,244 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:56:14,247 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:56:14,767 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:56:14,960 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:56:14,960 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:56:14,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:56:14 BoogieIcfgContainer [2023-11-06 22:56:14,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:56:14,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:56:14,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:56:14,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:56:14,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:56:12" (1/3) ... [2023-11-06 22:56:14,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a58871d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:56:14, skipping insertion in model container [2023-11-06 22:56:14,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:13" (2/3) ... [2023-11-06 22:56:14,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a58871d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:56:14, skipping insertion in model container [2023-11-06 22:56:14,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:56:14" (3/3) ... [2023-11-06 22:56:14,975 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014.opt.i [2023-11-06 22:56:14,994 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:56:14,995 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:56:14,995 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:56:15,133 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:56:15,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 22:56:15,311 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 22:56:15,312 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:56:15,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:56:15,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 22:56:15,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 146 transitions, 304 flow [2023-11-06 22:56:15,338 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:56:15,354 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 22:56:15,358 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 22:56:15,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 304 flow [2023-11-06 22:56:15,398 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 22:56:15,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:56:15,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:56:15,404 INFO L119 LiptonReduction]: Number of co-enabled transitions 3674 [2023-11-06 22:56:22,350 INFO L134 LiptonReduction]: Checked pairs total: 9403 [2023-11-06 22:56:22,351 INFO L136 LiptonReduction]: Total number of compositions: 148 [2023-11-06 22:56:22,368 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:56:22,376 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;@3f6f21f0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:56:22,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:56:22,378 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:56:22,379 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:56:22,379 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:56:22,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:22,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:56:22,380 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:22,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:22,386 INFO L85 PathProgramCache]: Analyzing trace with hash 663, now seen corresponding path program 1 times [2023-11-06 22:56:22,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:22,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552969732] [2023-11-06 22:56:22,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:22,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:22,533 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-06 22:56:22,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:22,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552969732] [2023-11-06 22:56:22,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552969732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:22,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:22,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:56:22,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868763987] [2023-11-06 22:56:22,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:22,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:56:22,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:22,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:56:22,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:56:22,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 298 [2023-11-06 22:56:22,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 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-06 22:56:22,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:22,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 298 [2023-11-06 22:56:22,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:23,644 INFO L124 PetriNetUnfolderBase]: 3743/5251 cut-off events. [2023-11-06 22:56:23,645 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-06 22:56:23,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10491 conditions, 5251 events. 3743/5251 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 27573 event pairs, 3743 based on Foata normal form. 0/4488 useless extension candidates. Maximal degree in co-relation 10479. Up to 5137 conditions per place. [2023-11-06 22:56:23,696 INFO L140 encePairwiseOnDemand]: 289/298 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-11-06 22:56:23,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 120 flow [2023-11-06 22:56:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:56:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:56:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 306 transitions. [2023-11-06 22:56:23,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5134228187919463 [2023-11-06 22:56:23,712 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 306 transitions. [2023-11-06 22:56:23,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 306 transitions. [2023-11-06 22:56:23,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:23,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 306 transitions. [2023-11-06 22:56:23,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 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-06 22:56:23,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 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-06 22:56:23,728 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 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-06 22:56:23,730 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 306 transitions. [2023-11-06 22:56:23,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 120 flow [2023-11-06 22:56:23,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:56:23,736 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-11-06 22:56:23,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-11-06 22:56:23,742 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-11-06 22:56:23,742 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-11-06 22:56:23,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 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-06 22:56:23,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:23,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:23,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:56:23,743 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:23,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash -931571963, now seen corresponding path program 1 times [2023-11-06 22:56:23,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:23,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641773246] [2023-11-06 22:56:23,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:23,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:24,367 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-06 22:56:24,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:24,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641773246] [2023-11-06 22:56:24,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641773246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:24,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:24,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:56:24,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150830964] [2023-11-06 22:56:24,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:24,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:56:24,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:24,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:56:24,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:56:24,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 298 [2023-11-06 22:56:24,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 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-06 22:56:24,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:24,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 298 [2023-11-06 22:56:24,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:25,208 INFO L124 PetriNetUnfolderBase]: 3113/4513 cut-off events. [2023-11-06 22:56:25,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:56:25,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8904 conditions, 4513 events. 3113/4513 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 24803 event pairs, 593 based on Foata normal form. 0/4146 useless extension candidates. Maximal degree in co-relation 8901. Up to 3385 conditions per place. [2023-11-06 22:56:25,248 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 32 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-11-06 22:56:25,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 160 flow [2023-11-06 22:56:25,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:56:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:56:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2023-11-06 22:56:25,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49440715883668906 [2023-11-06 22:56:25,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2023-11-06 22:56:25,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2023-11-06 22:56:25,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:25,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2023-11-06 22:56:25,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 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-06 22:56:25,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 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-06 22:56:25,261 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 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-06 22:56:25,261 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 442 transitions. [2023-11-06 22:56:25,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 160 flow [2023-11-06 22:56:25,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:56:25,263 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-11-06 22:56:25,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-06 22:56:25,264 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-11-06 22:56:25,264 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-11-06 22:56:25,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 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-06 22:56:25,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:25,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:25,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:56:25,266 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:25,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:25,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1887419894, now seen corresponding path program 1 times [2023-11-06 22:56:25,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:25,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901415416] [2023-11-06 22:56:25,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:26,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:26,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901415416] [2023-11-06 22:56:26,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901415416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:26,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:26,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:56:26,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430908349] [2023-11-06 22:56:26,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:26,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:56:26,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:26,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:56:26,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:56:26,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 298 [2023-11-06 22:56:26,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 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-06 22:56:26,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:26,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 298 [2023-11-06 22:56:26,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:27,348 INFO L124 PetriNetUnfolderBase]: 2150/3118 cut-off events. [2023-11-06 22:56:27,348 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-11-06 22:56:27,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6332 conditions, 3118 events. 2150/3118 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 16114 event pairs, 216 based on Foata normal form. 72/3079 useless extension candidates. Maximal degree in co-relation 6328. Up to 2026 conditions per place. [2023-11-06 22:56:27,385 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 40 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2023-11-06 22:56:27,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 200 flow [2023-11-06 22:56:27,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:56:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:56:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 761 transitions. [2023-11-06 22:56:27,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4256152125279642 [2023-11-06 22:56:27,389 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 761 transitions. [2023-11-06 22:56:27,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 761 transitions. [2023-11-06 22:56:27,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:27,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 761 transitions. [2023-11-06 22:56:27,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 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-06 22:56:27,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 298.0) internal successors, (2086), 7 states have internal predecessors, (2086), 0 states have call successors, (0), 0 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-06 22:56:27,400 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 298.0) internal successors, (2086), 7 states have internal predecessors, (2086), 0 states have call successors, (0), 0 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-06 22:56:27,400 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 6 states and 761 transitions. [2023-11-06 22:56:27,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 200 flow [2023-11-06 22:56:27,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:27,405 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 78 flow [2023-11-06 22:56:27,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-11-06 22:56:27,407 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2023-11-06 22:56:27,407 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 78 flow [2023-11-06 22:56:27,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 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-06 22:56:27,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:27,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:27,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:56:27,409 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:27,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:27,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1353356680, now seen corresponding path program 1 times [2023-11-06 22:56:27,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:27,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164952371] [2023-11-06 22:56:27,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:27,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:28,771 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-06 22:56:28,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:28,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164952371] [2023-11-06 22:56:28,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164952371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:28,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:28,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:56:28,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186161997] [2023-11-06 22:56:28,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:28,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:56:28,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:28,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:56:28,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:56:29,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 298 [2023-11-06 22:56:29,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 78 flow. Second operand has 8 states, 8 states have (on average 115.625) internal successors, (925), 8 states have internal predecessors, (925), 0 states have call successors, (0), 0 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-06 22:56:29,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:29,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 298 [2023-11-06 22:56:29,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:30,240 INFO L124 PetriNetUnfolderBase]: 2819/4147 cut-off events. [2023-11-06 22:56:30,240 INFO L125 PetriNetUnfolderBase]: For 261/261 co-relation queries the response was YES. [2023-11-06 22:56:30,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8889 conditions, 4147 events. 2819/4147 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 22839 event pairs, 711 based on Foata normal form. 0/4090 useless extension candidates. Maximal degree in co-relation 8884. Up to 2187 conditions per place. [2023-11-06 22:56:30,285 INFO L140 encePairwiseOnDemand]: 289/298 looper letters, 58 selfloop transitions, 10 changer transitions 0/72 dead transitions. [2023-11-06 22:56:30,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 319 flow [2023-11-06 22:56:30,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:56:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:56:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 981 transitions. [2023-11-06 22:56:30,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.411493288590604 [2023-11-06 22:56:30,290 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 981 transitions. [2023-11-06 22:56:30,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 981 transitions. [2023-11-06 22:56:30,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:30,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 981 transitions. [2023-11-06 22:56:30,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.625) internal successors, (981), 8 states have internal predecessors, (981), 0 states have call successors, (0), 0 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-06 22:56:30,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 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-06 22:56:30,304 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 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-06 22:56:30,304 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 78 flow. Second operand 8 states and 981 transitions. [2023-11-06 22:56:30,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 319 flow [2023-11-06 22:56:30,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 303 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-06 22:56:30,309 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 130 flow [2023-11-06 22:56:30,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=130, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-11-06 22:56:30,311 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-11-06 22:56:30,311 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 130 flow [2023-11-06 22:56:30,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.625) internal successors, (925), 8 states have internal predecessors, (925), 0 states have call successors, (0), 0 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-06 22:56:30,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:30,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:30,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:56:30,313 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:30,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:30,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1335482105, now seen corresponding path program 1 times [2023-11-06 22:56:30,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:30,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383250071] [2023-11-06 22:56:30,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:30,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:30,560 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-06 22:56:30,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:30,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383250071] [2023-11-06 22:56:30,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383250071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:30,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:30,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:56:30,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952922262] [2023-11-06 22:56:30,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:30,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:30,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:30,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:30,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:30,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 298 [2023-11-06 22:56:30,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 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-06 22:56:30,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:30,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 298 [2023-11-06 22:56:30,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:32,790 INFO L124 PetriNetUnfolderBase]: 9853/13722 cut-off events. [2023-11-06 22:56:32,791 INFO L125 PetriNetUnfolderBase]: For 4751/4751 co-relation queries the response was YES. [2023-11-06 22:56:32,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32274 conditions, 13722 events. 9853/13722 cut-off events. For 4751/4751 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 73449 event pairs, 2507 based on Foata normal form. 336/14058 useless extension candidates. Maximal degree in co-relation 32265. Up to 7339 conditions per place. [2023-11-06 22:56:32,918 INFO L140 encePairwiseOnDemand]: 289/298 looper letters, 74 selfloop transitions, 12 changer transitions 0/86 dead transitions. [2023-11-06 22:56:32,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 86 transitions, 510 flow [2023-11-06 22:56:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:56:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:56:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 567 transitions. [2023-11-06 22:56:32,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47567114093959734 [2023-11-06 22:56:32,922 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 567 transitions. [2023-11-06 22:56:32,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 567 transitions. [2023-11-06 22:56:32,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:32,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 567 transitions. [2023-11-06 22:56:32,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 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-06 22:56:32,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:32,928 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:32,929 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 130 flow. Second operand 4 states and 567 transitions. [2023-11-06 22:56:32,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 86 transitions, 510 flow [2023-11-06 22:56:32,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 86 transitions, 500 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:56:32,956 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 240 flow [2023-11-06 22:56:32,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-11-06 22:56:32,959 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2023-11-06 22:56:32,959 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 240 flow [2023-11-06 22:56:32,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 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-06 22:56:32,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:32,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:32,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:56:32,961 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:32,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:32,961 INFO L85 PathProgramCache]: Analyzing trace with hash -947580245, now seen corresponding path program 1 times [2023-11-06 22:56:32,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:32,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750290233] [2023-11-06 22:56:32,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:32,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:33,228 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-06 22:56:33,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:33,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750290233] [2023-11-06 22:56:33,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750290233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:33,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:33,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:56:33,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949626192] [2023-11-06 22:56:33,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:33,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:33,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:33,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:33,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:33,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 298 [2023-11-06 22:56:33,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 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-06 22:56:33,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:33,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 298 [2023-11-06 22:56:33,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:34,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([609] L887-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_30|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_30| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_40|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_40| 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_28 0) (= v_~__unbuffered_p3_EAX~0_26 1) (= v_~x~0_20 2) (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~__unbuffered_p1_EBX~0_16 0) (= 2 v_~__unbuffered_p1_EAX~0_16))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x~0=v_~x~0_20} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_32|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_40|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_32|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][108], [Black: 187#(and (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t358~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= ~z$w_buff0~0 0)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t359~0#1.base|)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t357~0#1.base| 0) |ULTIMATE.start_main_~#t360~0#1.base| 0) |ULTIMATE.start_main_~#t359~0#1.base| 0) |ULTIMATE.start_main_~#t358~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), P3Thread1of1ForFork3InUse, 201#true, 193#true, 122#L804true, 73#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 195#(= ~__unbuffered_p1_EAX~0 0), Black: 196#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 56#L773true, 134#P0EXITtrue, 152#L845true, Black: 175#(and (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t358~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t359~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t357~0#1.base| 0) |ULTIMATE.start_main_~#t360~0#1.base| 0) |ULTIMATE.start_main_~#t359~0#1.base| 0) |ULTIMATE.start_main_~#t358~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 185#(and (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t358~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t359~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t357~0#1.base| 0) |ULTIMATE.start_main_~#t360~0#1.base| 0) |ULTIMATE.start_main_~#t359~0#1.base| 0) |ULTIMATE.start_main_~#t358~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), P0Thread1of1ForFork0InUse, Black: 182#(and (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t358~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t358~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t357~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store |#valid| |ULTIMATE.start_main_~#t357~0#1.base| 0) |ULTIMATE.start_main_~#t359~0#1.base| 0) |ULTIMATE.start_main_~#t358~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start_main_~#t359~0#1.base|) 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P2Thread1of1ForFork1InUse, 163#true, Black: 183#(and (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t358~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t359~0#1.base|)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t357~0#1.base| 0) |ULTIMATE.start_main_~#t360~0#1.base| 0) |ULTIMATE.start_main_~#t359~0#1.base| 0) |ULTIMATE.start_main_~#t358~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), P1Thread1of1ForFork2InUse]) [2023-11-06 22:56:34,545 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 22:56:34,545 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:56:34,545 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:56:34,545 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:56:34,753 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([609] L887-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_30|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_30| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_40|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_40| 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_28 0) (= v_~__unbuffered_p3_EAX~0_26 1) (= v_~x~0_20 2) (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~__unbuffered_p1_EBX~0_16 0) (= 2 v_~__unbuffered_p1_EAX~0_16))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x~0=v_~x~0_20} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_32|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_40|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_32|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][108], [Black: 187#(and (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t358~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= ~z$w_buff0~0 0)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t359~0#1.base|)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t357~0#1.base| 0) |ULTIMATE.start_main_~#t360~0#1.base| 0) |ULTIMATE.start_main_~#t359~0#1.base| 0) |ULTIMATE.start_main_~#t358~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), 201#true, P3Thread1of1ForFork3InUse, 193#true, 73#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 195#(= ~__unbuffered_p1_EAX~0 0), Black: 196#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 56#L773true, 134#P0EXITtrue, 152#L845true, Black: 175#(and (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t358~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t359~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t357~0#1.base| 0) |ULTIMATE.start_main_~#t360~0#1.base| 0) |ULTIMATE.start_main_~#t359~0#1.base| 0) |ULTIMATE.start_main_~#t358~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 17#P2EXITtrue, 185#(and (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t358~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t359~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t357~0#1.base| 0) |ULTIMATE.start_main_~#t360~0#1.base| 0) |ULTIMATE.start_main_~#t359~0#1.base| 0) |ULTIMATE.start_main_~#t358~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), P0Thread1of1ForFork0InUse, Black: 182#(and (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t358~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t358~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t357~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store |#valid| |ULTIMATE.start_main_~#t357~0#1.base| 0) |ULTIMATE.start_main_~#t359~0#1.base| 0) |ULTIMATE.start_main_~#t358~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start_main_~#t359~0#1.base|) 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P2Thread1of1ForFork1InUse, 163#true, Black: 183#(and (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t359~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t358~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t357~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t358~0#1.base|)) (not (= |ULTIMATE.start_main_~#t360~0#1.base| |ULTIMATE.start_main_~#t359~0#1.base|)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t357~0#1.base| 0) |ULTIMATE.start_main_~#t360~0#1.base| 0) |ULTIMATE.start_main_~#t359~0#1.base| 0) |ULTIMATE.start_main_~#t358~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), P1Thread1of1ForFork2InUse]) [2023-11-06 22:56:34,753 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 22:56:34,753 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:56:34,754 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:56:34,754 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:56:34,934 INFO L124 PetriNetUnfolderBase]: 5613/8502 cut-off events. [2023-11-06 22:56:34,935 INFO L125 PetriNetUnfolderBase]: For 7885/8187 co-relation queries the response was YES. [2023-11-06 22:56:34,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23035 conditions, 8502 events. 5613/8502 cut-off events. For 7885/8187 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 54559 event pairs, 1201 based on Foata normal form. 606/8538 useless extension candidates. Maximal degree in co-relation 23024. Up to 5934 conditions per place. [2023-11-06 22:56:35,031 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 97 selfloop transitions, 10 changer transitions 0/114 dead transitions. [2023-11-06 22:56:35,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 114 transitions, 836 flow [2023-11-06 22:56:35,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:56:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:56:35,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 710 transitions. [2023-11-06 22:56:35,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47651006711409394 [2023-11-06 22:56:35,037 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 710 transitions. [2023-11-06 22:56:35,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 710 transitions. [2023-11-06 22:56:35,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:35,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 710 transitions. [2023-11-06 22:56:35,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 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-06 22:56:35,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 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-06 22:56:35,045 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 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-06 22:56:35,045 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 240 flow. Second operand 5 states and 710 transitions. [2023-11-06 22:56:35,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 114 transitions, 836 flow [2023-11-06 22:56:35,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 114 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:56:35,061 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 317 flow [2023-11-06 22:56:35,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=317, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2023-11-06 22:56:35,065 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2023-11-06 22:56:35,068 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 317 flow [2023-11-06 22:56:35,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 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-06 22:56:35,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:35,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:35,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:56:35,070 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:35,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:35,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2091915056, now seen corresponding path program 1 times [2023-11-06 22:56:35,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:35,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961270075] [2023-11-06 22:56:35,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:35,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:37,076 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-06 22:56:37,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:37,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961270075] [2023-11-06 22:56:37,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961270075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:37,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:37,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:56:37,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189938608] [2023-11-06 22:56:37,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:37,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:56:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:37,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:56:37,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:56:37,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 298 [2023-11-06 22:56:37,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 317 flow. Second operand has 9 states, 9 states have (on average 112.77777777777777) internal successors, (1015), 9 states have internal predecessors, (1015), 0 states have call successors, (0), 0 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-06 22:56:37,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:37,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 298 [2023-11-06 22:56:37,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:39,259 INFO L124 PetriNetUnfolderBase]: 5128/7996 cut-off events. [2023-11-06 22:56:39,259 INFO L125 PetriNetUnfolderBase]: For 12828/13239 co-relation queries the response was YES. [2023-11-06 22:56:39,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28428 conditions, 7996 events. 5128/7996 cut-off events. For 12828/13239 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 52378 event pairs, 965 based on Foata normal form. 161/7766 useless extension candidates. Maximal degree in co-relation 28413. Up to 5984 conditions per place. [2023-11-06 22:56:39,353 INFO L140 encePairwiseOnDemand]: 289/298 looper letters, 75 selfloop transitions, 18 changer transitions 6/106 dead transitions. [2023-11-06 22:56:39,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 106 transitions, 781 flow [2023-11-06 22:56:39,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:56:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:56:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 945 transitions. [2023-11-06 22:56:39,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3963926174496644 [2023-11-06 22:56:39,360 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 945 transitions. [2023-11-06 22:56:39,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 945 transitions. [2023-11-06 22:56:39,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:39,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 945 transitions. [2023-11-06 22:56:39,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.125) internal successors, (945), 8 states have internal predecessors, (945), 0 states have call successors, (0), 0 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-06 22:56:39,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 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-06 22:56:39,372 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 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-06 22:56:39,372 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 317 flow. Second operand 8 states and 945 transitions. [2023-11-06 22:56:39,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 106 transitions, 781 flow [2023-11-06 22:56:39,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 753 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:39,398 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 414 flow [2023-11-06 22:56:39,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=414, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-11-06 22:56:39,399 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2023-11-06 22:56:39,399 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 414 flow [2023-11-06 22:56:39,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.77777777777777) internal successors, (1015), 9 states have internal predecessors, (1015), 0 states have call successors, (0), 0 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-06 22:56:39,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:39,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:39,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:56:39,401 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:39,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:39,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1905841499, now seen corresponding path program 1 times [2023-11-06 22:56:39,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:39,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667011848] [2023-11-06 22:56:39,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:39,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:39,711 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-06 22:56:39,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:39,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667011848] [2023-11-06 22:56:39,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667011848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:39,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:39,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:56:39,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164770721] [2023-11-06 22:56:39,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:39,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:39,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:39,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:39,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:39,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 298 [2023-11-06 22:56:39,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 414 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 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-06 22:56:39,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:39,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 298 [2023-11-06 22:56:39,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:42,744 INFO L124 PetriNetUnfolderBase]: 10612/15484 cut-off events. [2023-11-06 22:56:42,745 INFO L125 PetriNetUnfolderBase]: For 28247/28247 co-relation queries the response was YES. [2023-11-06 22:56:42,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58018 conditions, 15484 events. 10612/15484 cut-off events. For 28247/28247 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 90868 event pairs, 2654 based on Foata normal form. 130/15614 useless extension candidates. Maximal degree in co-relation 58002. Up to 7844 conditions per place. [2023-11-06 22:56:42,868 INFO L140 encePairwiseOnDemand]: 288/298 looper letters, 109 selfloop transitions, 33 changer transitions 9/151 dead transitions. [2023-11-06 22:56:42,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 151 transitions, 1333 flow [2023-11-06 22:56:42,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:56:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:56:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2023-11-06 22:56:42,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657718120805369 [2023-11-06 22:56:42,873 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2023-11-06 22:56:42,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2023-11-06 22:56:42,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:42,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2023-11-06 22:56:42,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 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-06 22:56:42,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 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-06 22:56:42,882 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 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-06 22:56:42,882 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 414 flow. Second operand 5 states and 694 transitions. [2023-11-06 22:56:42,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 151 transitions, 1333 flow [2023-11-06 22:56:42,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 151 transitions, 1306 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-06 22:56:42,941 INFO L231 Difference]: Finished difference. Result has 67 places, 76 transitions, 700 flow [2023-11-06 22:56:42,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=700, PETRI_PLACES=67, PETRI_TRANSITIONS=76} [2023-11-06 22:56:42,944 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2023-11-06 22:56:42,944 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 76 transitions, 700 flow [2023-11-06 22:56:42,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 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-06 22:56:42,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:42,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:42,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:56:42,945 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:42,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1764774382, now seen corresponding path program 1 times [2023-11-06 22:56:42,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:42,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27060836] [2023-11-06 22:56:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:42,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:43,147 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-06 22:56:43,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:43,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27060836] [2023-11-06 22:56:43,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27060836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:43,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:43,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:56:43,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835254464] [2023-11-06 22:56:43,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:43,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:56:43,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:43,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:56:43,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:56:43,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 298 [2023-11-06 22:56:43,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 76 transitions, 700 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 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-06 22:56:43,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:43,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 298 [2023-11-06 22:56:43,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:44,486 INFO L124 PetriNetUnfolderBase]: 4182/6823 cut-off events. [2023-11-06 22:56:44,486 INFO L125 PetriNetUnfolderBase]: For 22123/23028 co-relation queries the response was YES. [2023-11-06 22:56:44,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28357 conditions, 6823 events. 4182/6823 cut-off events. For 22123/23028 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 46548 event pairs, 393 based on Foata normal form. 799/7287 useless extension candidates. Maximal degree in co-relation 28338. Up to 3179 conditions per place. [2023-11-06 22:56:44,679 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 169 selfloop transitions, 14 changer transitions 7/202 dead transitions. [2023-11-06 22:56:44,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 202 transitions, 2323 flow [2023-11-06 22:56:44,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:56:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:56:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 853 transitions. [2023-11-06 22:56:44,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47706935123042504 [2023-11-06 22:56:44,684 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 853 transitions. [2023-11-06 22:56:44,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 853 transitions. [2023-11-06 22:56:44,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:44,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 853 transitions. [2023-11-06 22:56:44,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.16666666666666) internal successors, (853), 6 states have internal predecessors, (853), 0 states have call successors, (0), 0 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-06 22:56:44,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 298.0) internal successors, (2086), 7 states have internal predecessors, (2086), 0 states have call successors, (0), 0 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-06 22:56:44,694 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 298.0) internal successors, (2086), 7 states have internal predecessors, (2086), 0 states have call successors, (0), 0 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-06 22:56:44,695 INFO L175 Difference]: Start difference. First operand has 67 places, 76 transitions, 700 flow. Second operand 6 states and 853 transitions. [2023-11-06 22:56:44,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 202 transitions, 2323 flow [2023-11-06 22:56:44,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 202 transitions, 2307 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-06 22:56:44,783 INFO L231 Difference]: Finished difference. Result has 72 places, 83 transitions, 789 flow [2023-11-06 22:56:44,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=789, PETRI_PLACES=72, PETRI_TRANSITIONS=83} [2023-11-06 22:56:44,784 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2023-11-06 22:56:44,785 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 83 transitions, 789 flow [2023-11-06 22:56:44,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 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-06 22:56:44,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:44,786 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] [2023-11-06 22:56:44,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:56:44,786 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:44,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:44,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1871088343, now seen corresponding path program 1 times [2023-11-06 22:56:44,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:44,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118598838] [2023-11-06 22:56:44,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:44,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:45,071 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-06 22:56:45,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:45,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118598838] [2023-11-06 22:56:45,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118598838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:45,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:45,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:56:45,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040865630] [2023-11-06 22:56:45,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:45,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:45,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:45,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:45,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:45,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 298 [2023-11-06 22:56:45,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 83 transitions, 789 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 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-06 22:56:45,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:45,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 298 [2023-11-06 22:56:45,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:46,897 INFO L124 PetriNetUnfolderBase]: 6466/10425 cut-off events. [2023-11-06 22:56:46,897 INFO L125 PetriNetUnfolderBase]: For 43191/43935 co-relation queries the response was YES. [2023-11-06 22:56:46,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52704 conditions, 10425 events. 6466/10425 cut-off events. For 43191/43935 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 72789 event pairs, 1058 based on Foata normal form. 235/10381 useless extension candidates. Maximal degree in co-relation 52682. Up to 5574 conditions per place. [2023-11-06 22:56:46,985 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 116 selfloop transitions, 4 changer transitions 42/171 dead transitions. [2023-11-06 22:56:46,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 171 transitions, 1989 flow [2023-11-06 22:56:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:56:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:56:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2023-11-06 22:56:46,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48573825503355705 [2023-11-06 22:56:46,989 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2023-11-06 22:56:46,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2023-11-06 22:56:46,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:46,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2023-11-06 22:56:46,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 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-06 22:56:46,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:46,996 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:46,996 INFO L175 Difference]: Start difference. First operand has 72 places, 83 transitions, 789 flow. Second operand 4 states and 579 transitions. [2023-11-06 22:56:46,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 171 transitions, 1989 flow [2023-11-06 22:56:47,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 171 transitions, 1871 flow, removed 47 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:47,589 INFO L231 Difference]: Finished difference. Result has 75 places, 86 transitions, 792 flow [2023-11-06 22:56:47,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=792, PETRI_PLACES=75, PETRI_TRANSITIONS=86} [2023-11-06 22:56:47,590 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 25 predicate places. [2023-11-06 22:56:47,590 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 86 transitions, 792 flow [2023-11-06 22:56:47,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 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-06 22:56:47,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:47,591 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] [2023-11-06 22:56:47,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:56:47,591 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:47,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash 24849790, now seen corresponding path program 1 times [2023-11-06 22:56:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:47,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353341617] [2023-11-06 22:56:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:47,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:47,856 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-06 22:56:47,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:47,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353341617] [2023-11-06 22:56:47,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353341617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:47,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:47,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:56:47,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105100043] [2023-11-06 22:56:47,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:47,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:56:47,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:47,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:56:47,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:56:47,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 298 [2023-11-06 22:56:47,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 86 transitions, 792 flow. Second operand has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 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-06 22:56:47,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:47,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 298 [2023-11-06 22:56:47,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:49,356 INFO L124 PetriNetUnfolderBase]: 5038/8327 cut-off events. [2023-11-06 22:56:49,356 INFO L125 PetriNetUnfolderBase]: For 33445/34580 co-relation queries the response was YES. [2023-11-06 22:56:49,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37832 conditions, 8327 events. 5038/8327 cut-off events. For 33445/34580 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 60175 event pairs, 229 based on Foata normal form. 831/8794 useless extension candidates. Maximal degree in co-relation 37808. Up to 3020 conditions per place. [2023-11-06 22:56:49,427 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 173 selfloop transitions, 23 changer transitions 28/239 dead transitions. [2023-11-06 22:56:49,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 239 transitions, 2759 flow [2023-11-06 22:56:49,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:56:49,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:56:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1136 transitions. [2023-11-06 22:56:49,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47651006711409394 [2023-11-06 22:56:49,434 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1136 transitions. [2023-11-06 22:56:49,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1136 transitions. [2023-11-06 22:56:49,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:49,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1136 transitions. [2023-11-06 22:56:49,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 142.0) internal successors, (1136), 8 states have internal predecessors, (1136), 0 states have call successors, (0), 0 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-06 22:56:49,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 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-06 22:56:49,446 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 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-06 22:56:49,446 INFO L175 Difference]: Start difference. First operand has 75 places, 86 transitions, 792 flow. Second operand 8 states and 1136 transitions. [2023-11-06 22:56:49,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 239 transitions, 2759 flow [2023-11-06 22:56:49,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 239 transitions, 2676 flow, removed 38 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:49,802 INFO L231 Difference]: Finished difference. Result has 83 places, 90 transitions, 863 flow [2023-11-06 22:56:49,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=863, PETRI_PLACES=83, PETRI_TRANSITIONS=90} [2023-11-06 22:56:49,803 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2023-11-06 22:56:49,803 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 90 transitions, 863 flow [2023-11-06 22:56:49,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 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-06 22:56:49,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:49,803 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] [2023-11-06 22:56:49,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:56:49,804 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:49,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:49,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1488341209, now seen corresponding path program 1 times [2023-11-06 22:56:49,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:49,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168028273] [2023-11-06 22:56:49,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:49,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:50,037 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-06 22:56:50,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:50,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168028273] [2023-11-06 22:56:50,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168028273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:50,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:50,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:56:50,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732081712] [2023-11-06 22:56:50,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:50,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:56:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:50,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:56:50,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:56:50,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 298 [2023-11-06 22:56:50,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 90 transitions, 863 flow. Second operand has 7 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 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-06 22:56:50,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:50,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 298 [2023-11-06 22:56:50,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:51,710 INFO L124 PetriNetUnfolderBase]: 4865/8011 cut-off events. [2023-11-06 22:56:51,710 INFO L125 PetriNetUnfolderBase]: For 32202/33155 co-relation queries the response was YES. [2023-11-06 22:56:51,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40196 conditions, 8011 events. 4865/8011 cut-off events. For 32202/33155 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 57838 event pairs, 206 based on Foata normal form. 393/8040 useless extension candidates. Maximal degree in co-relation 40170. Up to 2878 conditions per place. [2023-11-06 22:56:51,776 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 72 selfloop transitions, 22 changer transitions 131/238 dead transitions. [2023-11-06 22:56:51,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 238 transitions, 2752 flow [2023-11-06 22:56:51,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:56:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:56:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1395 transitions. [2023-11-06 22:56:51,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46812080536912754 [2023-11-06 22:56:51,787 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1395 transitions. [2023-11-06 22:56:51,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1395 transitions. [2023-11-06 22:56:51,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:51,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1395 transitions. [2023-11-06 22:56:51,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 139.5) internal successors, (1395), 10 states have internal predecessors, (1395), 0 states have call successors, (0), 0 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-06 22:56:51,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 298.0) internal successors, (3278), 11 states have internal predecessors, (3278), 0 states have call successors, (0), 0 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-06 22:56:51,804 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 298.0) internal successors, (3278), 11 states have internal predecessors, (3278), 0 states have call successors, (0), 0 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-06 22:56:51,804 INFO L175 Difference]: Start difference. First operand has 83 places, 90 transitions, 863 flow. Second operand 10 states and 1395 transitions. [2023-11-06 22:56:51,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 238 transitions, 2752 flow [2023-11-06 22:56:52,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 238 transitions, 2615 flow, removed 28 selfloop flow, removed 5 redundant places. [2023-11-06 22:56:52,801 INFO L231 Difference]: Finished difference. Result has 90 places, 60 transitions, 507 flow [2023-11-06 22:56:52,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=507, PETRI_PLACES=90, PETRI_TRANSITIONS=60} [2023-11-06 22:56:52,802 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2023-11-06 22:56:52,802 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 60 transitions, 507 flow [2023-11-06 22:56:52,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 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-06 22:56:52,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:52,803 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-06 22:56:52,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:56:52,804 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:52,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash 620363937, now seen corresponding path program 1 times [2023-11-06 22:56:52,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:52,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256825742] [2023-11-06 22:56:52,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:52,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:53,044 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-06 22:56:53,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:53,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256825742] [2023-11-06 22:56:53,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256825742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:53,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:53,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:56:53,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063686298] [2023-11-06 22:56:53,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:53,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:53,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:53,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:53,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 298 [2023-11-06 22:56:53,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 60 transitions, 507 flow. Second operand has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 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-06 22:56:53,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:53,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 298 [2023-11-06 22:56:53,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:53,894 INFO L124 PetriNetUnfolderBase]: 3140/5530 cut-off events. [2023-11-06 22:56:53,894 INFO L125 PetriNetUnfolderBase]: For 19707/19913 co-relation queries the response was YES. [2023-11-06 22:56:53,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25664 conditions, 5530 events. 3140/5530 cut-off events. For 19707/19913 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 39223 event pairs, 680 based on Foata normal form. 31/5440 useless extension candidates. Maximal degree in co-relation 25636. Up to 2395 conditions per place. [2023-11-06 22:56:53,939 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 50 selfloop transitions, 1 changer transitions 59/116 dead transitions. [2023-11-06 22:56:53,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 116 transitions, 1173 flow [2023-11-06 22:56:53,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:56:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:56:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2023-11-06 22:56:53,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48573825503355705 [2023-11-06 22:56:53,944 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2023-11-06 22:56:53,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2023-11-06 22:56:53,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:53,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2023-11-06 22:56:53,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 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-06 22:56:53,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:53,951 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:53,951 INFO L175 Difference]: Start difference. First operand has 90 places, 60 transitions, 507 flow. Second operand 4 states and 579 transitions. [2023-11-06 22:56:53,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 116 transitions, 1173 flow [2023-11-06 22:56:54,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 116 transitions, 935 flow, removed 42 selfloop flow, removed 20 redundant places. [2023-11-06 22:56:54,178 INFO L231 Difference]: Finished difference. Result has 72 places, 49 transitions, 306 flow [2023-11-06 22:56:54,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=72, PETRI_TRANSITIONS=49} [2023-11-06 22:56:54,179 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2023-11-06 22:56:54,179 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 49 transitions, 306 flow [2023-11-06 22:56:54,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 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-06 22:56:54,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:54,180 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-06 22:56:54,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:56:54,180 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:54,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:54,180 INFO L85 PathProgramCache]: Analyzing trace with hash -872516279, now seen corresponding path program 2 times [2023-11-06 22:56:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:54,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948074306] [2023-11-06 22:56:54,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:54,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:54,442 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-06 22:56:54,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:54,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948074306] [2023-11-06 22:56:54,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948074306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:54,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:54,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:56:54,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425718306] [2023-11-06 22:56:54,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:54,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:54,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:54,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:54,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:54,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 298 [2023-11-06 22:56:54,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 49 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 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-06 22:56:54,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:54,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 298 [2023-11-06 22:56:54,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:54,895 INFO L124 PetriNetUnfolderBase]: 1839/3144 cut-off events. [2023-11-06 22:56:54,895 INFO L125 PetriNetUnfolderBase]: For 8200/8200 co-relation queries the response was YES. [2023-11-06 22:56:54,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12901 conditions, 3144 events. 1839/3144 cut-off events. For 8200/8200 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 18576 event pairs, 635 based on Foata normal form. 1/3145 useless extension candidates. Maximal degree in co-relation 12881. Up to 1627 conditions per place. [2023-11-06 22:56:54,909 INFO L140 encePairwiseOnDemand]: 293/298 looper letters, 39 selfloop transitions, 4 changer transitions 44/87 dead transitions. [2023-11-06 22:56:54,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 679 flow [2023-11-06 22:56:54,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:56:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:56:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2023-11-06 22:56:54,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639261744966443 [2023-11-06 22:56:54,912 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions. [2023-11-06 22:56:54,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions. [2023-11-06 22:56:54,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:54,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions. [2023-11-06 22:56:54,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-06 22:56:54,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:54,918 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:54,918 INFO L175 Difference]: Start difference. First operand has 72 places, 49 transitions, 306 flow. Second operand 4 states and 553 transitions. [2023-11-06 22:56:54,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 679 flow [2023-11-06 22:56:54,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 87 transitions, 658 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-11-06 22:56:54,973 INFO L231 Difference]: Finished difference. Result has 69 places, 38 transitions, 213 flow [2023-11-06 22:56:54,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=69, PETRI_TRANSITIONS=38} [2023-11-06 22:56:54,974 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2023-11-06 22:56:54,974 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 38 transitions, 213 flow [2023-11-06 22:56:54,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 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-06 22:56:54,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:54,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-06 22:56:54,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:56:54,975 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:54,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash -192240643, now seen corresponding path program 3 times [2023-11-06 22:56:54,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:54,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580382894] [2023-11-06 22:56:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:54,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:56,144 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-06 22:56:56,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:56,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580382894] [2023-11-06 22:56:56,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580382894] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:56,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:56,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:56:56,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435285230] [2023-11-06 22:56:56,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:56,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:56:56,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:56,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:56:56,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:56:56,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 298 [2023-11-06 22:56:56,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 38 transitions, 213 flow. Second operand has 7 states, 7 states have (on average 133.14285714285714) internal successors, (932), 7 states have internal predecessors, (932), 0 states have call successors, (0), 0 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-06 22:56:56,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:56,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 298 [2023-11-06 22:56:56,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:56,601 INFO L124 PetriNetUnfolderBase]: 227/439 cut-off events. [2023-11-06 22:56:56,601 INFO L125 PetriNetUnfolderBase]: For 881/893 co-relation queries the response was YES. [2023-11-06 22:56:56,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 439 events. 227/439 cut-off events. For 881/893 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1901 event pairs, 31 based on Foata normal form. 1/429 useless extension candidates. Maximal degree in co-relation 1689. Up to 168 conditions per place. [2023-11-06 22:56:56,603 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 34 selfloop transitions, 4 changer transitions 38/80 dead transitions. [2023-11-06 22:56:56,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 80 transitions, 607 flow [2023-11-06 22:56:56,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:56:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:56:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1085 transitions. [2023-11-06 22:56:56,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551174496644295 [2023-11-06 22:56:56,610 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1085 transitions. [2023-11-06 22:56:56,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1085 transitions. [2023-11-06 22:56:56,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:56,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1085 transitions. [2023-11-06 22:56:56,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 135.625) internal successors, (1085), 8 states have internal predecessors, (1085), 0 states have call successors, (0), 0 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-06 22:56:56,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 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-06 22:56:56,622 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 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-06 22:56:56,622 INFO L175 Difference]: Start difference. First operand has 69 places, 38 transitions, 213 flow. Second operand 8 states and 1085 transitions. [2023-11-06 22:56:56,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 80 transitions, 607 flow [2023-11-06 22:56:56,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 80 transitions, 554 flow, removed 10 selfloop flow, removed 12 redundant places. [2023-11-06 22:56:56,629 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 194 flow [2023-11-06 22:56:56,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=194, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2023-11-06 22:56:56,630 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2023-11-06 22:56:56,630 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 194 flow [2023-11-06 22:56:56,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 133.14285714285714) internal successors, (932), 7 states have internal predecessors, (932), 0 states have call successors, (0), 0 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-06 22:56:56,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:56,632 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-06 22:56:56,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:56:56,632 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:56:56,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:56,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1590554881, now seen corresponding path program 4 times [2023-11-06 22:56:56,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:56,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773233503] [2023-11-06 22:56:56,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:56,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:56:56,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:56:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:56:56,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:56:56,794 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:56:56,796 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:56:56,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:56:56,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:56:56,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:56:56,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:56:56,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:56:56,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:56:56,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:56:56,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:56:56,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:56:56,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:56:56,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:56:56,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:56:56,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:56:56,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:56:56,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:56:56,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:56:56,803 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:56,810 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:56:56,810 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:56:56,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:56:56 BasicIcfg [2023-11-06 22:56:56,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:56:56,945 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:56:56,946 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:56:56,946 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:56:56,946 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:56:14" (3/4) ... [2023-11-06 22:56:56,949 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:56:56,950 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:56:56,951 INFO L158 Benchmark]: Toolchain (without parser) took 43959.49ms. Allocated memory was 195.0MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 146.1MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-06 22:56:56,951 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 138.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:56:56,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 740.69ms. Allocated memory is still 195.0MB. Free memory was 145.6MB in the beginning and 121.6MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:56:56,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.13ms. Allocated memory is still 195.0MB. Free memory was 121.6MB in the beginning and 118.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:56:56,953 INFO L158 Benchmark]: Boogie Preprocessor took 63.35ms. Allocated memory is still 195.0MB. Free memory was 118.9MB in the beginning and 116.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:56:56,953 INFO L158 Benchmark]: RCFGBuilder took 1042.46ms. Allocated memory is still 195.0MB. Free memory was 116.8MB in the beginning and 74.9MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2023-11-06 22:56:56,953 INFO L158 Benchmark]: TraceAbstraction took 41978.36ms. Allocated memory was 195.0MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 74.3MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-06 22:56:56,954 INFO L158 Benchmark]: Witness Printer took 4.72ms. Allocated memory is still 5.5GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:56:56,956 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 138.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 740.69ms. Allocated memory is still 195.0MB. Free memory was 145.6MB in the beginning and 121.6MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.13ms. Allocated memory is still 195.0MB. Free memory was 121.6MB in the beginning and 118.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.35ms. Allocated memory is still 195.0MB. Free memory was 118.9MB in the beginning and 116.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1042.46ms. Allocated memory is still 195.0MB. Free memory was 116.8MB in the beginning and 74.9MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 41978.36ms. Allocated memory was 195.0MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 74.3MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 4.72ms. Allocated memory is still 5.5GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 156 PlacesBefore, 50 PlacesAfterwards, 146 TransitionsBefore, 38 TransitionsAfterwards, 3674 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 148 TotalNumberOfCompositions, 9403 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4681, independent: 4484, independent conditional: 0, independent unconditional: 4484, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2028, independent: 1987, independent conditional: 0, independent unconditional: 1987, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4681, independent: 2497, independent conditional: 0, independent unconditional: 2497, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 2028, unknown conditional: 0, unknown unconditional: 2028] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 136, Positive conditional cache size: 0, Positive unconditional cache size: 136, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t357; [L870] FCALL, FORK 0 pthread_create(&t357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t357, ((void *)0), P0, ((void *)0))=-4, t357={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t358; [L872] FCALL, FORK 0 pthread_create(&t358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t358, ((void *)0), P1, ((void *)0))=-3, t357={5:0}, t358={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t359; [L874] FCALL, FORK 0 pthread_create(&t359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t359, ((void *)0), P2, ((void *)0))=-2, t357={5:0}, t358={6:0}, t359={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t360; [L876] FCALL, FORK 0 pthread_create(&t360, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t360, ((void *)0), P3, ((void *)0))=-1, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix014.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 870]: 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: 874]: 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: 872]: 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: 876]: 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 9 procedures, 184 locations, 16 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: 41.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1088 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 835 mSDsluCounter, 399 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 302 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3390 IncrementalHoareTripleChecker+Invalid, 3493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 97 mSDtfsCounter, 3390 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=863occurred in iteration=11, InterpolantAutomatonStates: 85, 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.5s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 2554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-06 22:56:56,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix014.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 615dc0a4278e77a094a63ed4629507c6f8d1cda73abba57cd69e8912d83fe5fd --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:56:59,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:57:00,050 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:57:00,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:57:00,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:57:00,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:57:00,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:57:00,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:57:00,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:57:00,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:57:00,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:57:00,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:57:00,092 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:57:00,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:57:00,093 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:57:00,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:57:00,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:57:00,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:57:00,096 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:57:00,096 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:57:00,097 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:57:00,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:57:00,098 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:57:00,098 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:57:00,099 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:57:00,100 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:57:00,100 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:57:00,100 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:57:00,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:57:00,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:57:00,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:57:00,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:57:00,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:57:00,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:57:00,104 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:57:00,105 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:57:00,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:57:00,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:57:00,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:57:00,107 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:57:00,107 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:57:00,108 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_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 615dc0a4278e77a094a63ed4629507c6f8d1cda73abba57cd69e8912d83fe5fd [2023-11-06 22:57:00,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:57:00,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:57:00,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:57:00,529 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:57:00,530 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:57:00,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix014.opt.i [2023-11-06 22:57:03,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:57:04,056 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:57:04,057 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/sv-benchmarks/c/pthread-wmm/mix014.opt.i [2023-11-06 22:57:04,079 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/data/02faa55ad/eaee19580aec46748cbd42d23c545027/FLAGea97a1982 [2023-11-06 22:57:04,131 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/data/02faa55ad/eaee19580aec46748cbd42d23c545027 [2023-11-06 22:57:04,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:57:04,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:57:04,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:57:04,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:57:04,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:57:04,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:57:04" (1/1) ... [2023-11-06 22:57:04,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a1276ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:04, skipping insertion in model container [2023-11-06 22:57:04,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:57:04" (1/1) ... [2023-11-06 22:57:04,238 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:57:04,850 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:57:04,875 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:57:04,937 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:57:04,979 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:04,980 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:04,988 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:57:04,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:04 WrapperNode [2023-11-06 22:57:04,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:57:04,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:57:04,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:57:04,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:57:04,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:04" (1/1) ... [2023-11-06 22:57:05,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:04" (1/1) ... [2023-11-06 22:57:05,060 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 172 [2023-11-06 22:57:05,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:57:05,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:57:05,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:57:05,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:57:05,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:04" (1/1) ... [2023-11-06 22:57:05,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:04" (1/1) ... [2023-11-06 22:57:05,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:04" (1/1) ... [2023-11-06 22:57:05,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:04" (1/1) ... [2023-11-06 22:57:05,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:04" (1/1) ... [2023-11-06 22:57:05,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:04" (1/1) ... [2023-11-06 22:57:05,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:04" (1/1) ... [2023-11-06 22:57:05,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:04" (1/1) ... [2023-11-06 22:57:05,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:57:05,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:57:05,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:57:05,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:57:05,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:04" (1/1) ... [2023-11-06 22:57:05,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:57:05,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:57:05,225 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:57:05,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:57:05,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:57:05,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:57:05,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:57:05,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:57:05,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:57:05,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:57:05,261 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:57:05,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:57:05,261 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:57:05,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:57:05,261 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:57:05,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:57:05,262 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:57:05,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:57:05,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:57:05,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:57:05,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:57:05,264 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:57:05,435 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:57:05,437 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:57:06,043 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:57:06,283 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:57:06,284 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:57:06,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:57:06 BoogieIcfgContainer [2023-11-06 22:57:06,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:57:06,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:57:06,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:57:06,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:57:06,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:57:04" (1/3) ... [2023-11-06 22:57:06,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510e9430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:57:06, skipping insertion in model container [2023-11-06 22:57:06,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:04" (2/3) ... [2023-11-06 22:57:06,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510e9430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:57:06, skipping insertion in model container [2023-11-06 22:57:06,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:57:06" (3/3) ... [2023-11-06 22:57:06,305 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014.opt.i [2023-11-06 22:57:06,327 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:57:06,328 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:57:06,328 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:57:06,444 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:57:06,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 151 transitions, 318 flow [2023-11-06 22:57:06,593 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-06 22:57:06,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:57:06,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:57:06,600 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 151 transitions, 318 flow [2023-11-06 22:57:06,606 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 147 transitions, 306 flow [2023-11-06 22:57:06,610 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:57:06,631 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-06 22:57:06,635 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-06 22:57:06,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 147 transitions, 306 flow [2023-11-06 22:57:06,683 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-06 22:57:06,684 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:57:06,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:57:06,688 INFO L119 LiptonReduction]: Number of co-enabled transitions 3674 [2023-11-06 22:57:17,092 INFO L134 LiptonReduction]: Checked pairs total: 9635 [2023-11-06 22:57:17,093 INFO L136 LiptonReduction]: Total number of compositions: 148 [2023-11-06 22:57:17,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:57:17,115 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;@596c5a2d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:57:17,115 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:57:17,118 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:57:17,118 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:57:17,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:57:17,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:17,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:57:17,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:57:17,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:17,125 INFO L85 PathProgramCache]: Analyzing trace with hash 665, now seen corresponding path program 1 times [2023-11-06 22:57:17,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:57:17,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006019184] [2023-11-06 22:57:17,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:17,140 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-06 22:57:17,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:57:17,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:17,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:17,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:57:17,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:57:17,260 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-06 22:57:17,260 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:57:17,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:57:17,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006019184] [2023-11-06 22:57:17,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006019184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:17,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:17,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:57:17,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701580670] [2023-11-06 22:57:17,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:17,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:57:17,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:57:17,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:57:17,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:57:17,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 299 [2023-11-06 22:57:17,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 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-06 22:57:17,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:17,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 299 [2023-11-06 22:57:17,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:18,542 INFO L124 PetriNetUnfolderBase]: 4373/6061 cut-off events. [2023-11-06 22:57:18,542 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-06 22:57:18,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12147 conditions, 6061 events. 4373/6061 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 31860 event pairs, 4373 based on Foata normal form. 0/5334 useless extension candidates. Maximal degree in co-relation 12135. Up to 5983 conditions per place. [2023-11-06 22:57:18,613 INFO L140 encePairwiseOnDemand]: 290/299 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-11-06 22:57:18,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-11-06 22:57:18,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:57:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:57:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2023-11-06 22:57:18,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5167224080267558 [2023-11-06 22:57:18,633 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2023-11-06 22:57:18,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2023-11-06 22:57:18,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:18,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2023-11-06 22:57:18,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 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-06 22:57:18,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 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-06 22:57:18,652 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 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-06 22:57:18,654 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 309 transitions. [2023-11-06 22:57:18,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-11-06 22:57:18,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:57:18,662 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-11-06 22:57:18,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-11-06 22:57:18,669 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-11-06 22:57:18,670 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-11-06 22:57:18,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 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-06 22:57:18,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:18,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:18,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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)] Ended with exit code 0 [2023-11-06 22:57:18,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:18,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:57:18,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:18,885 INFO L85 PathProgramCache]: Analyzing trace with hash -711049964, now seen corresponding path program 1 times [2023-11-06 22:57:18,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:57:18,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168678229] [2023-11-06 22:57:18,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:18,887 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-06 22:57:18,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:57:18,889 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:18,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:19,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:57:19,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:57:19,078 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-06 22:57:19,078 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:57:19,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:57:19,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168678229] [2023-11-06 22:57:19,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168678229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:19,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:19,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:57:19,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038157141] [2023-11-06 22:57:19,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:19,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:57:19,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:57:19,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:57:19,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:57:19,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 299 [2023-11-06 22:57:19,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 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-06 22:57:19,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:19,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 299 [2023-11-06 22:57:19,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:20,063 INFO L124 PetriNetUnfolderBase]: 3632/5248 cut-off events. [2023-11-06 22:57:20,064 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:57:20,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10338 conditions, 5248 events. 3632/5248 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 29835 event pairs, 668 based on Foata normal form. 0/4881 useless extension candidates. Maximal degree in co-relation 10335. Up to 3973 conditions per place. [2023-11-06 22:57:20,117 INFO L140 encePairwiseOnDemand]: 296/299 looper letters, 34 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-06 22:57:20,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 168 flow [2023-11-06 22:57:20,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:57:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:57:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-11-06 22:57:20,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983277591973244 [2023-11-06 22:57:20,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-11-06 22:57:20,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-11-06 22:57:20,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:20,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-11-06 22:57:20,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 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-06 22:57:20,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 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-06 22:57:20,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 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-06 22:57:20,150 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 447 transitions. [2023-11-06 22:57:20,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 168 flow [2023-11-06 22:57:20,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:57:20,152 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-11-06 22:57:20,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-11-06 22:57:20,154 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-11-06 22:57:20,154 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-11-06 22:57:20,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 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-06 22:57:20,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:20,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:20,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:20,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:20,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:57:20,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:20,374 INFO L85 PathProgramCache]: Analyzing trace with hash -419148660, now seen corresponding path program 1 times [2023-11-06 22:57:20,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:57:20,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123452641] [2023-11-06 22:57:20,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:20,377 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-06 22:57:20,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:57:20,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:20,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:20,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:57:20,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:57:20,579 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-06 22:57:20,579 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:57:20,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:57:20,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123452641] [2023-11-06 22:57:20,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123452641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:20,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:20,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:57:20,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139075571] [2023-11-06 22:57:20,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:20,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:57:20,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:57:20,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:57:20,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:57:20,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 299 [2023-11-06 22:57:20,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 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-06 22:57:20,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:20,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 299 [2023-11-06 22:57:20,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:21,412 INFO L124 PetriNetUnfolderBase]: 2540/3674 cut-off events. [2023-11-06 22:57:21,412 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-06 22:57:21,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7626 conditions, 3674 events. 2540/3674 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 18912 event pairs, 492 based on Foata normal form. 180/3717 useless extension candidates. Maximal degree in co-relation 7622. Up to 2887 conditions per place. [2023-11-06 22:57:21,443 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 36 selfloop transitions, 5 changer transitions 23/68 dead transitions. [2023-11-06 22:57:21,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 288 flow [2023-11-06 22:57:21,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:57:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:57:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2023-11-06 22:57:21,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4688963210702341 [2023-11-06 22:57:21,448 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 701 transitions. [2023-11-06 22:57:21,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 701 transitions. [2023-11-06 22:57:21,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:21,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 701 transitions. [2023-11-06 22:57:21,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 0 states have call successors, (0), 0 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-06 22:57:21,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 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-06 22:57:21,458 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 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-06 22:57:21,458 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 701 transitions. [2023-11-06 22:57:21,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 288 flow [2023-11-06 22:57:21,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:57:21,462 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 109 flow [2023-11-06 22:57:21,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-11-06 22:57:21,464 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-11-06 22:57:21,464 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 109 flow [2023-11-06 22:57:21,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 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-06 22:57:21,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:21,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:21,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:21,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:21,677 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:57:21,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash 793971737, now seen corresponding path program 1 times [2023-11-06 22:57:21,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:57:21,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48668735] [2023-11-06 22:57:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:21,678 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-06 22:57:21,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:57:21,679 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:21,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:21,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:57:21,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:57:21,858 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-06 22:57:21,858 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:57:21,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:57:21,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48668735] [2023-11-06 22:57:21,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48668735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:21,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:21,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:57:21,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146821551] [2023-11-06 22:57:21,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:21,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:57:21,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:57:21,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:57:21,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:57:21,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 299 [2023-11-06 22:57:21,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-06 22:57:21,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:21,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 299 [2023-11-06 22:57:21,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:22,476 INFO L124 PetriNetUnfolderBase]: 1284/1990 cut-off events. [2023-11-06 22:57:22,476 INFO L125 PetriNetUnfolderBase]: For 868/872 co-relation queries the response was YES. [2023-11-06 22:57:22,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5495 conditions, 1990 events. 1284/1990 cut-off events. For 868/872 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9766 event pairs, 186 based on Foata normal form. 134/2063 useless extension candidates. Maximal degree in co-relation 5488. Up to 1027 conditions per place. [2023-11-06 22:57:22,496 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 47 selfloop transitions, 9 changer transitions 23/83 dead transitions. [2023-11-06 22:57:22,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 429 flow [2023-11-06 22:57:22,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:57:22,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:57:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 843 transitions. [2023-11-06 22:57:22,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4698996655518395 [2023-11-06 22:57:22,501 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 843 transitions. [2023-11-06 22:57:22,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 843 transitions. [2023-11-06 22:57:22,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:22,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 843 transitions. [2023-11-06 22:57:22,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 0 states have call successors, (0), 0 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-06 22:57:22,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 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-06 22:57:22,512 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 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-06 22:57:22,513 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 109 flow. Second operand 6 states and 843 transitions. [2023-11-06 22:57:22,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 429 flow [2023-11-06 22:57:22,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 83 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:57:22,523 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 174 flow [2023-11-06 22:57:22,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-11-06 22:57:22,526 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-11-06 22:57:22,526 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 174 flow [2023-11-06 22:57:22,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-06 22:57:22,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:22,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:22,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:22,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:22,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:57:22,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1922672863, now seen corresponding path program 1 times [2023-11-06 22:57:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:57:22,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124221061] [2023-11-06 22:57:22,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:22,740 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-06 22:57:22,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:57:22,742 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:22,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:22,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:57:22,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:57:22,983 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-06 22:57:22,984 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:57:22,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:57:22,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124221061] [2023-11-06 22:57:22,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124221061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:22,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:22,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:57:22,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423162694] [2023-11-06 22:57:22,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:22,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:57:22,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:57:22,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:57:22,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:57:23,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 299 [2023-11-06 22:57:23,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 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-06 22:57:23,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:23,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 299 [2023-11-06 22:57:23,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:23,682 INFO L124 PetriNetUnfolderBase]: 660/1070 cut-off events. [2023-11-06 22:57:23,683 INFO L125 PetriNetUnfolderBase]: For 1243/1251 co-relation queries the response was YES. [2023-11-06 22:57:23,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 1070 events. 660/1070 cut-off events. For 1243/1251 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4663 event pairs, 124 based on Foata normal form. 60/1113 useless extension candidates. Maximal degree in co-relation 3487. Up to 395 conditions per place. [2023-11-06 22:57:23,700 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 56 selfloop transitions, 13 changer transitions 23/96 dead transitions. [2023-11-06 22:57:23,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 590 flow [2023-11-06 22:57:23,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:57:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:57:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 983 transitions. [2023-11-06 22:57:23,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46966077400860007 [2023-11-06 22:57:23,706 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 983 transitions. [2023-11-06 22:57:23,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 983 transitions. [2023-11-06 22:57:23,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:23,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 983 transitions. [2023-11-06 22:57:23,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.42857142857142) internal successors, (983), 7 states have internal predecessors, (983), 0 states have call successors, (0), 0 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-06 22:57:23,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 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-06 22:57:23,721 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 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-06 22:57:23,722 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 174 flow. Second operand 7 states and 983 transitions. [2023-11-06 22:57:23,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 590 flow [2023-11-06 22:57:23,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 96 transitions, 528 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-11-06 22:57:23,745 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 224 flow [2023-11-06 22:57:23,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-11-06 22:57:23,748 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-11-06 22:57:23,748 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 224 flow [2023-11-06 22:57:23,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 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-06 22:57:23,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:23,749 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] [2023-11-06 22:57:23,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:23,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:23,964 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:57:23,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:23,964 INFO L85 PathProgramCache]: Analyzing trace with hash -631015089, now seen corresponding path program 1 times [2023-11-06 22:57:23,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:57:23,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143668049] [2023-11-06 22:57:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:23,968 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-06 22:57:23,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:57:23,970 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:23,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:24,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:57:24,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:57:24,211 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-06 22:57:24,212 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:57:24,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:57:24,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143668049] [2023-11-06 22:57:24,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143668049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:24,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:24,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:57:24,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944698094] [2023-11-06 22:57:24,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:24,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:57:24,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:57:24,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:57:24,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:57:24,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 299 [2023-11-06 22:57:24,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 129.57142857142858) internal successors, (907), 7 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:24,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:24,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 299 [2023-11-06 22:57:24,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:24,932 INFO L124 PetriNetUnfolderBase]: 528/839 cut-off events. [2023-11-06 22:57:24,932 INFO L125 PetriNetUnfolderBase]: For 940/948 co-relation queries the response was YES. [2023-11-06 22:57:24,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2639 conditions, 839 events. 528/839 cut-off events. For 940/948 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3488 event pairs, 119 based on Foata normal form. 16/849 useless extension candidates. Maximal degree in co-relation 2629. Up to 340 conditions per place. [2023-11-06 22:57:24,941 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 52 selfloop transitions, 17 changer transitions 12/85 dead transitions. [2023-11-06 22:57:24,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 534 flow [2023-11-06 22:57:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:57:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:57:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1099 transitions. [2023-11-06 22:57:24,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45944816053511706 [2023-11-06 22:57:24,948 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1099 transitions. [2023-11-06 22:57:24,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1099 transitions. [2023-11-06 22:57:24,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:24,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1099 transitions. [2023-11-06 22:57:24,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 137.375) internal successors, (1099), 8 states have internal predecessors, (1099), 0 states have call successors, (0), 0 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-06 22:57:24,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 299.0) internal successors, (2691), 9 states have internal predecessors, (2691), 0 states have call successors, (0), 0 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-06 22:57:24,961 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 299.0) internal successors, (2691), 9 states have internal predecessors, (2691), 0 states have call successors, (0), 0 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-06 22:57:24,962 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 224 flow. Second operand 8 states and 1099 transitions. [2023-11-06 22:57:24,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 534 flow [2023-11-06 22:57:24,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 472 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-06 22:57:24,975 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 218 flow [2023-11-06 22:57:24,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-11-06 22:57:24,976 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-11-06 22:57:24,977 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 218 flow [2023-11-06 22:57:24,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.57142857142858) internal successors, (907), 7 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:24,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:24,978 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-06 22:57:24,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:57:25,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:25,190 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:57:25,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:25,192 INFO L85 PathProgramCache]: Analyzing trace with hash -217289675, now seen corresponding path program 1 times [2023-11-06 22:57:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:57:25,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129667473] [2023-11-06 22:57:25,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:25,194 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-06 22:57:25,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:57:25,195 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:25,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:25,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:57:25,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:57:25,431 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-06 22:57:25,431 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:57:25,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:57:25,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129667473] [2023-11-06 22:57:25,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129667473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:25,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:25,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:57:25,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151989018] [2023-11-06 22:57:25,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:25,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:57:25,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:57:25,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:57:25,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:57:25,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 299 [2023-11-06 22:57:25,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 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-06 22:57:25,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:25,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 299 [2023-11-06 22:57:25,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:25,847 INFO L124 PetriNetUnfolderBase]: 707/1194 cut-off events. [2023-11-06 22:57:25,847 INFO L125 PetriNetUnfolderBase]: For 1792/1792 co-relation queries the response was YES. [2023-11-06 22:57:25,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3626 conditions, 1194 events. 707/1194 cut-off events. For 1792/1792 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6377 event pairs, 115 based on Foata normal form. 0/1190 useless extension candidates. Maximal degree in co-relation 3615. Up to 653 conditions per place. [2023-11-06 22:57:25,858 INFO L140 encePairwiseOnDemand]: 296/299 looper letters, 81 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2023-11-06 22:57:25,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 659 flow [2023-11-06 22:57:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:57:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:57:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2023-11-06 22:57:25,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4899665551839465 [2023-11-06 22:57:25,862 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2023-11-06 22:57:25,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2023-11-06 22:57:25,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:25,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2023-11-06 22:57:25,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 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-06 22:57:25,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 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-06 22:57:25,868 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 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-06 22:57:25,868 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 218 flow. Second operand 4 states and 586 transitions. [2023-11-06 22:57:25,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 659 flow [2023-11-06 22:57:25,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 86 transitions, 518 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-11-06 22:57:25,878 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 167 flow [2023-11-06 22:57:25,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-06 22:57:25,879 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-11-06 22:57:25,879 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 167 flow [2023-11-06 22:57:25,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 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-06 22:57:25,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:25,880 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-06 22:57:25,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:57:26,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:26,098 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:57:26,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:26,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1751524423, now seen corresponding path program 2 times [2023-11-06 22:57:26,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:57:26,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704184800] [2023-11-06 22:57:26,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:57:26,099 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-06 22:57:26,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:57:26,100 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:26,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:26,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:57:26,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:57:26,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:57:26,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:57:26,315 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-06 22:57:26,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:57:26,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:57:26,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704184800] [2023-11-06 22:57:26,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704184800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:26,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:26,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:57:26,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438170133] [2023-11-06 22:57:26,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:26,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:57:26,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:57:26,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:57:26,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:57:26,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 299 [2023-11-06 22:57:26,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 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-06 22:57:26,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:26,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 299 [2023-11-06 22:57:26,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:26,718 INFO L124 PetriNetUnfolderBase]: 1178/1926 cut-off events. [2023-11-06 22:57:26,719 INFO L125 PetriNetUnfolderBase]: For 1690/1696 co-relation queries the response was YES. [2023-11-06 22:57:26,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5551 conditions, 1926 events. 1178/1926 cut-off events. For 1690/1696 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10750 event pairs, 529 based on Foata normal form. 2/1909 useless extension candidates. Maximal degree in co-relation 5541. Up to 1105 conditions per place. [2023-11-06 22:57:26,734 INFO L140 encePairwiseOnDemand]: 296/299 looper letters, 67 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-11-06 22:57:26,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 439 flow [2023-11-06 22:57:26,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:57:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:57:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2023-11-06 22:57:26,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49944258639910816 [2023-11-06 22:57:26,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2023-11-06 22:57:26,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2023-11-06 22:57:26,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:26,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2023-11-06 22:57:26,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 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-06 22:57:26,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 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-06 22:57:26,743 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 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-06 22:57:26,743 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 167 flow. Second operand 3 states and 448 transitions. [2023-11-06 22:57:26,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 439 flow [2023-11-06 22:57:26,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:57:26,763 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 178 flow [2023-11-06 22:57:26,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-11-06 22:57:26,765 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2023-11-06 22:57:26,769 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 178 flow [2023-11-06 22:57:26,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 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-06 22:57:26,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:26,770 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-06 22:57:26,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:26,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:26,982 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:57:26,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:26,983 INFO L85 PathProgramCache]: Analyzing trace with hash 604200195, now seen corresponding path program 3 times [2023-11-06 22:57:26,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:57:26,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968806969] [2023-11-06 22:57:26,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:57:26,984 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-06 22:57:26,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:57:26,985 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:26,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:27,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:57:27,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:57:27,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:57:27,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:57:27,206 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-06 22:57:27,206 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:57:27,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:57:27,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968806969] [2023-11-06 22:57:27,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968806969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:27,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:27,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:57:27,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935025201] [2023-11-06 22:57:27,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:27,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:57:27,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:57:27,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:57:27,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:57:27,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 299 [2023-11-06 22:57:27,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 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-06 22:57:27,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:27,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 299 [2023-11-06 22:57:27,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:27,782 INFO L124 PetriNetUnfolderBase]: 1806/2867 cut-off events. [2023-11-06 22:57:27,783 INFO L125 PetriNetUnfolderBase]: For 2526/2527 co-relation queries the response was YES. [2023-11-06 22:57:27,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8824 conditions, 2867 events. 1806/2867 cut-off events. For 2526/2527 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15469 event pairs, 309 based on Foata normal form. 1/2849 useless extension candidates. Maximal degree in co-relation 8813. Up to 1487 conditions per place. [2023-11-06 22:57:27,807 INFO L140 encePairwiseOnDemand]: 296/299 looper letters, 81 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-11-06 22:57:27,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 87 transitions, 547 flow [2023-11-06 22:57:27,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:57:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:57:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 584 transitions. [2023-11-06 22:57:27,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4882943143812709 [2023-11-06 22:57:27,810 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 584 transitions. [2023-11-06 22:57:27,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 584 transitions. [2023-11-06 22:57:27,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:27,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 584 transitions. [2023-11-06 22:57:27,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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-06 22:57:27,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 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-06 22:57:27,816 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 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-06 22:57:27,816 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 178 flow. Second operand 4 states and 584 transitions. [2023-11-06 22:57:27,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 87 transitions, 547 flow [2023-11-06 22:57:27,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 87 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:57:27,853 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 189 flow [2023-11-06 22:57:27,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-11-06 22:57:27,854 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2023-11-06 22:57:27,855 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 189 flow [2023-11-06 22:57:27,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 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-06 22:57:27,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:27,856 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-06 22:57:27,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:28,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:28,069 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:57:28,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:28,069 INFO L85 PathProgramCache]: Analyzing trace with hash -435756203, now seen corresponding path program 4 times [2023-11-06 22:57:28,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:57:28,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985650995] [2023-11-06 22:57:28,070 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:57:28,070 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-06 22:57:28,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:57:28,071 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:28,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 22:57:28,272 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:57:28,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:57:28,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:57:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:57:28,502 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:57:28,502 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:57:28,503 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:57:28,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:57:28,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:57:28,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:57:28,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:57:28,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:57:28,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:57:28,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:57:28,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:57:28,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:57:28,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:57:28,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:57:28,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:57:28,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:57:28,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:57:28,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:57:28,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:57:28,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:57:28,707 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:28,713 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:57:28,713 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:57:28,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:57:28 BasicIcfg [2023-11-06 22:57:28,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:57:28,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:57:28,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:57:28,849 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:57:28,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:57:06" (3/4) ... [2023-11-06 22:57:28,854 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:57:28,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:57:28,856 INFO L158 Benchmark]: Toolchain (without parser) took 24713.55ms. Allocated memory was 92.3MB in the beginning and 574.6MB in the end (delta: 482.3MB). Free memory was 71.4MB in the beginning and 475.5MB in the end (delta: -404.1MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. [2023-11-06 22:57:28,856 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 92.3MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:57:28,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 843.36ms. Allocated memory is still 92.3MB. Free memory was 71.1MB in the beginning and 46.2MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:57:28,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.64ms. Allocated memory is still 92.3MB. Free memory was 46.2MB in the beginning and 43.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:57:28,857 INFO L158 Benchmark]: Boogie Preprocessor took 92.38ms. Allocated memory is still 92.3MB. Free memory was 43.3MB in the beginning and 68.8MB in the end (delta: -25.5MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2023-11-06 22:57:28,857 INFO L158 Benchmark]: RCFGBuilder took 1133.02ms. Allocated memory was 92.3MB in the beginning and 123.7MB in the end (delta: 31.5MB). Free memory was 68.8MB in the beginning and 84.0MB in the end (delta: -15.2MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2023-11-06 22:57:28,858 INFO L158 Benchmark]: TraceAbstraction took 22556.24ms. Allocated memory was 123.7MB in the beginning and 574.6MB in the end (delta: 450.9MB). Free memory was 83.3MB in the beginning and 476.6MB in the end (delta: -393.2MB). Peak memory consumption was 385.7MB. Max. memory is 16.1GB. [2023-11-06 22:57:28,858 INFO L158 Benchmark]: Witness Printer took 6.40ms. Allocated memory is still 574.6MB. Free memory was 476.6MB in the beginning and 475.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:57:28,860 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.35ms. Allocated memory is still 92.3MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 843.36ms. Allocated memory is still 92.3MB. Free memory was 71.1MB in the beginning and 46.2MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.64ms. Allocated memory is still 92.3MB. Free memory was 46.2MB in the beginning and 43.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.38ms. Allocated memory is still 92.3MB. Free memory was 43.3MB in the beginning and 68.8MB in the end (delta: -25.5MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1133.02ms. Allocated memory was 92.3MB in the beginning and 123.7MB in the end (delta: 31.5MB). Free memory was 68.8MB in the beginning and 84.0MB in the end (delta: -15.2MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22556.24ms. Allocated memory was 123.7MB in the beginning and 574.6MB in the end (delta: 450.9MB). Free memory was 83.3MB in the beginning and 476.6MB in the end (delta: -393.2MB). Peak memory consumption was 385.7MB. Max. memory is 16.1GB. * Witness Printer took 6.40ms. Allocated memory is still 574.6MB. Free memory was 476.6MB in the beginning and 475.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.5s, 157 PlacesBefore, 51 PlacesAfterwards, 147 TransitionsBefore, 39 TransitionsAfterwards, 3674 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 148 TotalNumberOfCompositions, 9635 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4849, independent: 4633, independent conditional: 0, independent unconditional: 4633, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2011, independent: 1967, independent conditional: 0, independent unconditional: 1967, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4849, independent: 2666, independent conditional: 0, independent unconditional: 2666, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 2011, unknown conditional: 0, unknown unconditional: 2011] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t357; [L870] FCALL, FORK 0 pthread_create(&t357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t357, ((void *)0), P0, ((void *)0))=-1, t357={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t358; [L872] FCALL, FORK 0 pthread_create(&t358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t358, ((void *)0), P1, ((void *)0))=0, t357={11:0}, t358={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t359; [L874] FCALL, FORK 0 pthread_create(&t359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t359, ((void *)0), P2, ((void *)0))=1, t357={11:0}, t358={15:0}, t359={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t360; [L876] FCALL, FORK 0 pthread_create(&t360, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t360, ((void *)0), P3, ((void *)0))=2, t357={11:0}, t358={15:0}, t359={7:0}, t360={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L787] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t357={11:0}, t358={15:0}, t359={7:0}, t360={-2147483637:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix014.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={8:6}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 870]: 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: 874]: 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: 872]: 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 9 procedures, 185 locations, 16 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: 22.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 327 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 287 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1416 IncrementalHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 11 mSDtfsCounter, 1416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=5, InterpolantAutomatonStates: 42, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 364 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1295 ConjunctsInSsa, 49 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-06 22:57:28,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb402e74-54a8-4367-9ea1-98a8af7ab75d/bin/uautomizer-verify-WvqO1wxjHP/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