./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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 bb32390c6e08fa980f308e05dcc5f75aadd246c70ded8fbe4d875fa3ae4239fa --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:47:57,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:47:57,816 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:47:57,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:47:57,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:47:57,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:47:57,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:47:57,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:47:57,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:47:57,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:47:57,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:47:57,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:47:57,857 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:47:57,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:47:57,859 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:47:57,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:47:57,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:47:57,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:47:57,861 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:47:57,861 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:47:57,862 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:47:57,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:47:57,863 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:47:57,864 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:47:57,864 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:47:57,865 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:47:57,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:47:57,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:47:57,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:47:57,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:57,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:47:57,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:47:57,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:47:57,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:47:57,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:47:57,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:47:57,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:47:57,869 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:47:57,870 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_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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 -> bb32390c6e08fa980f308e05dcc5f75aadd246c70ded8fbe4d875fa3ae4239fa [2023-11-06 22:47:58,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:47:58,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:47:58,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:47:58,171 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:47:58,172 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:47:58,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i [2023-11-06 22:48:01,348 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:48:01,681 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:48:01,683 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i [2023-11-06 22:48:01,707 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/data/0fb2608ec/da8bb86b0dab47f6aa6fda452276895e/FLAG2ac2afbe1 [2023-11-06 22:48:01,918 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/data/0fb2608ec/da8bb86b0dab47f6aa6fda452276895e [2023-11-06 22:48:01,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:48:01,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:48:01,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:48:01,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:48:01,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:48:01,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:01" (1/1) ... [2023-11-06 22:48:01,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@594b1763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:01, skipping insertion in model container [2023-11-06 22:48:01,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:01" (1/1) ... [2023-11-06 22:48:01,995 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:48:02,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:48:02,420 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:48:02,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:48:02,528 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:48:02,528 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:48:02,536 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:48:02,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:02 WrapperNode [2023-11-06 22:48:02,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:48:02,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:48:02,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:48:02,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:48:02,546 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:48:02" (1/1) ... [2023-11-06 22:48:02,569 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:48:02" (1/1) ... [2023-11-06 22:48:02,601 INFO L138 Inliner]: procedures = 176, calls = 68, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-11-06 22:48:02,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:48:02,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:48:02,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:48:02,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:48:02,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:02" (1/1) ... [2023-11-06 22:48:02,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:02" (1/1) ... [2023-11-06 22:48:02,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:02" (1/1) ... [2023-11-06 22:48:02,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:02" (1/1) ... [2023-11-06 22:48:02,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:02" (1/1) ... [2023-11-06 22:48:02,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:02" (1/1) ... [2023-11-06 22:48:02,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:02" (1/1) ... [2023-11-06 22:48:02,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:02" (1/1) ... [2023-11-06 22:48:02,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:48:02,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:48:02,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:48:02,646 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:48:02,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:02" (1/1) ... [2023-11-06 22:48:02,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:48:02,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:48:02,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:48:02,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:48:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:48:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:48:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:48:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:48:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:48:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:48:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:48:02,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:48:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:48:02,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:48:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:48:02,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:48:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:48:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:48:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:48:02,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:48:02,749 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:48:02,901 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:48:02,903 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:48:03,437 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:48:03,829 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:48:03,830 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:48:03,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:03 BoogieIcfgContainer [2023-11-06 22:48:03,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:48:03,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:48:03,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:48:03,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:48:03,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:48:01" (1/3) ... [2023-11-06 22:48:03,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129632d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:03, skipping insertion in model container [2023-11-06 22:48:03,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:02" (2/3) ... [2023-11-06 22:48:03,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129632d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:03, skipping insertion in model container [2023-11-06 22:48:03,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:03" (3/3) ... [2023-11-06 22:48:03,848 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_rmo.oepc.i [2023-11-06 22:48:03,868 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:48:03,869 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-11-06 22:48:03,871 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:48:04,003 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:48:04,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 166 transitions, 344 flow [2023-11-06 22:48:04,153 INFO L124 PetriNetUnfolderBase]: 3/163 cut-off events. [2023-11-06 22:48:04,153 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:48:04,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 163 events. 3/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 197 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-06 22:48:04,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 166 transitions, 344 flow [2023-11-06 22:48:04,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 163 transitions, 335 flow [2023-11-06 22:48:04,184 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:48:04,204 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 163 transitions, 335 flow [2023-11-06 22:48:04,206 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 163 transitions, 335 flow [2023-11-06 22:48:04,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 163 transitions, 335 flow [2023-11-06 22:48:04,282 INFO L124 PetriNetUnfolderBase]: 3/163 cut-off events. [2023-11-06 22:48:04,282 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:48:04,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 163 events. 3/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 195 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-06 22:48:04,291 INFO L119 LiptonReduction]: Number of co-enabled transitions 5074 [2023-11-06 22:48:17,119 INFO L134 LiptonReduction]: Checked pairs total: 21033 [2023-11-06 22:48:17,120 INFO L136 LiptonReduction]: Total number of compositions: 156 [2023-11-06 22:48:17,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:48:17,144 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;@7d62a0e4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:48:17,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-11-06 22:48:17,146 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:48:17,146 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:48:17,147 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:48:17,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:17,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:48:17,148 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:17,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:17,154 INFO L85 PathProgramCache]: Analyzing trace with hash 823, now seen corresponding path program 1 times [2023-11-06 22:48:17,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:17,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241177995] [2023-11-06 22:48:17,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:17,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:48:17,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:17,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241177995] [2023-11-06 22:48:17,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241177995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:17,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:17,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:48:17,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645778381] [2023-11-06 22:48:17,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:17,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:48:17,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:17,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:48:17,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:48:17,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 322 [2023-11-06 22:48:17,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 129 flow. Second operand has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:48:17,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:17,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 322 [2023-11-06 22:48:17,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:18,846 INFO L124 PetriNetUnfolderBase]: 4692/6844 cut-off events. [2023-11-06 22:48:18,846 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-06 22:48:18,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13654 conditions, 6844 events. 4692/6844 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 42121 event pairs, 4692 based on Foata normal form. 0/3700 useless extension candidates. Maximal degree in co-relation 13643. Up to 6764 conditions per place. [2023-11-06 22:48:18,918 INFO L140 encePairwiseOnDemand]: 304/322 looper letters, 35 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2023-11-06 22:48:18,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 159 flow [2023-11-06 22:48:18,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:48:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:48:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 319 transitions. [2023-11-06 22:48:18,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4953416149068323 [2023-11-06 22:48:18,941 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 319 transitions. [2023-11-06 22:48:18,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 319 transitions. [2023-11-06 22:48:18,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:18,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 319 transitions. [2023-11-06 22:48:18,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 159.5) internal successors, (319), 2 states have internal predecessors, (319), 0 states have call successors, (0), 0 states 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:48:18,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 322.0) internal successors, (966), 3 states have internal predecessors, (966), 0 states have call successors, (0), 0 states 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:48:18,961 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 322.0) internal successors, (966), 3 states have internal predecessors, (966), 0 states have call successors, (0), 0 states 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:48:18,963 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 129 flow. Second operand 2 states and 319 transitions. [2023-11-06 22:48:18,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 159 flow [2023-11-06 22:48:18,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:48:18,971 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2023-11-06 22:48:18,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-11-06 22:48:18,976 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -20 predicate places. [2023-11-06 22:48:18,977 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2023-11-06 22:48:18,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:48:18,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:18,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:48:18,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:48:18,978 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:18,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:18,979 INFO L85 PathProgramCache]: Analyzing trace with hash 810282, now seen corresponding path program 1 times [2023-11-06 22:48:18,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:18,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107524826] [2023-11-06 22:48:18,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:18,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:19,290 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:48:19,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:19,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107524826] [2023-11-06 22:48:19,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107524826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:19,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:19,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:48:19,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044983329] [2023-11-06 22:48:19,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:19,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:19,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:19,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:19,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:19,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 322 [2023-11-06 22:48:19,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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:48:19,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:19,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 322 [2023-11-06 22:48:19,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:20,592 INFO L124 PetriNetUnfolderBase]: 4176/6270 cut-off events. [2023-11-06 22:48:20,593 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:48:20,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12488 conditions, 6270 events. 4176/6270 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 37604 event pairs, 2695 based on Foata normal form. 0/4132 useless extension candidates. Maximal degree in co-relation 12485. Up to 3941 conditions per place. [2023-11-06 22:48:20,646 INFO L140 encePairwiseOnDemand]: 308/322 looper letters, 42 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2023-11-06 22:48:20,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 212 flow [2023-11-06 22:48:20,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-11-06 22:48:20,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2023-11-06 22:48:20,652 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-11-06 22:48:20,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-11-06 22:48:20,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:20,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-11-06 22:48:20,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states 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:48:20,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:48:20,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:48:20,663 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 437 transitions. [2023-11-06 22:48:20,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 212 flow [2023-11-06 22:48:20,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:48:20,666 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 146 flow [2023-11-06 22:48:20,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-11-06 22:48:20,668 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -18 predicate places. [2023-11-06 22:48:20,669 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 146 flow [2023-11-06 22:48:20,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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:48:20,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:20,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:48:20,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:48:20,678 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:20,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:20,681 INFO L85 PathProgramCache]: Analyzing trace with hash 810283, now seen corresponding path program 1 times [2023-11-06 22:48:20,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:20,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790890353] [2023-11-06 22:48:20,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:20,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:20,829 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:48:20,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:20,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790890353] [2023-11-06 22:48:20,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790890353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:20,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:20,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:48:20,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793227256] [2023-11-06 22:48:20,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:20,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:20,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:20,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:20,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:20,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 322 [2023-11-06 22:48:20,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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:48:20,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:20,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 322 [2023-11-06 22:48:20,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:21,406 INFO L124 PetriNetUnfolderBase]: 1743/2796 cut-off events. [2023-11-06 22:48:21,406 INFO L125 PetriNetUnfolderBase]: For 671/707 co-relation queries the response was YES. [2023-11-06 22:48:21,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7153 conditions, 2796 events. 1743/2796 cut-off events. For 671/707 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 16329 event pairs, 1449 based on Foata normal form. 387/2810 useless extension candidates. Maximal degree in co-relation 7148. Up to 2593 conditions per place. [2023-11-06 22:48:21,430 INFO L140 encePairwiseOnDemand]: 315/322 looper letters, 31 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2023-11-06 22:48:21,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 198 flow [2023-11-06 22:48:21,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-11-06 22:48:21,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4409937888198758 [2023-11-06 22:48:21,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-11-06 22:48:21,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-11-06 22:48:21,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:21,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-11-06 22:48:21,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states 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:48:21,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:48:21,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:48:21,439 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 146 flow. Second operand 3 states and 426 transitions. [2023-11-06 22:48:21,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 198 flow [2023-11-06 22:48:21,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:21,448 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 120 flow [2023-11-06 22:48:21,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2023-11-06 22:48:21,449 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -24 predicate places. [2023-11-06 22:48:21,449 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 120 flow [2023-11-06 22:48:21,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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:48:21,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:21,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:21,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:48:21,451 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:21,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:21,451 INFO L85 PathProgramCache]: Analyzing trace with hash 136836961, now seen corresponding path program 1 times [2023-11-06 22:48:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:21,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775685338] [2023-11-06 22:48:21,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:21,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:21,854 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:48:21,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:21,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775685338] [2023-11-06 22:48:21,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775685338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:21,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:21,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:48:21,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624304962] [2023-11-06 22:48:21,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:21,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:21,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:21,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:21,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:21,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 322 [2023-11-06 22:48:21,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states 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:48:21,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:21,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 322 [2023-11-06 22:48:21,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:22,421 INFO L124 PetriNetUnfolderBase]: 1654/2698 cut-off events. [2023-11-06 22:48:22,421 INFO L125 PetriNetUnfolderBase]: For 311/320 co-relation queries the response was YES. [2023-11-06 22:48:22,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6495 conditions, 2698 events. 1654/2698 cut-off events. For 311/320 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 16051 event pairs, 352 based on Foata normal form. 0/2190 useless extension candidates. Maximal degree in co-relation 6490. Up to 2125 conditions per place. [2023-11-06 22:48:22,441 INFO L140 encePairwiseOnDemand]: 319/322 looper letters, 48 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-06 22:48:22,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 276 flow [2023-11-06 22:48:22,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:22,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-11-06 22:48:22,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4503105590062112 [2023-11-06 22:48:22,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-11-06 22:48:22,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-11-06 22:48:22,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:22,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-11-06 22:48:22,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states 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:48:22,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:48:22,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:48:22,452 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 120 flow. Second operand 3 states and 435 transitions. [2023-11-06 22:48:22,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 276 flow [2023-11-06 22:48:22,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:22,454 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 127 flow [2023-11-06 22:48:22,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-11-06 22:48:22,456 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -22 predicate places. [2023-11-06 22:48:22,456 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 127 flow [2023-11-06 22:48:22,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states 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:48:22,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:22,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:22,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:48:22,458 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:22,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:22,458 INFO L85 PathProgramCache]: Analyzing trace with hash 136836770, now seen corresponding path program 1 times [2023-11-06 22:48:22,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:22,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159251725] [2023-11-06 22:48:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,693 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:48:22,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:22,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159251725] [2023-11-06 22:48:22,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159251725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:22,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:22,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:48:22,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12756483] [2023-11-06 22:48:22,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:22,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:22,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:22,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:22,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:22,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 322 [2023-11-06 22:48:22,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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:48:22,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:22,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 322 [2023-11-06 22:48:22,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:23,332 INFO L124 PetriNetUnfolderBase]: 1654/2654 cut-off events. [2023-11-06 22:48:23,332 INFO L125 PetriNetUnfolderBase]: For 427/463 co-relation queries the response was YES. [2023-11-06 22:48:23,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6684 conditions, 2654 events. 1654/2654 cut-off events. For 427/463 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 15277 event pairs, 972 based on Foata normal form. 0/2170 useless extension candidates. Maximal degree in co-relation 6678. Up to 1707 conditions per place. [2023-11-06 22:48:23,348 INFO L140 encePairwiseOnDemand]: 318/322 looper letters, 53 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2023-11-06 22:48:23,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 318 flow [2023-11-06 22:48:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-11-06 22:48:23,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4606625258799172 [2023-11-06 22:48:23,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-11-06 22:48:23,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-11-06 22:48:23,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:23,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-11-06 22:48:23,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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:48:23,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:48:23,358 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:48:23,358 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 127 flow. Second operand 3 states and 445 transitions. [2023-11-06 22:48:23,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 318 flow [2023-11-06 22:48:23,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:23,363 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 136 flow [2023-11-06 22:48:23,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-11-06 22:48:23,366 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -21 predicate places. [2023-11-06 22:48:23,366 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 136 flow [2023-11-06 22:48:23,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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:48:23,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:23,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:23,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:48:23,367 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:23,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:23,368 INFO L85 PathProgramCache]: Analyzing trace with hash 883332, now seen corresponding path program 1 times [2023-11-06 22:48:23,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:23,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953179134] [2023-11-06 22:48:23,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:23,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,506 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:48:23,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:23,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953179134] [2023-11-06 22:48:23,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953179134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:23,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:23,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:23,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772430838] [2023-11-06 22:48:23,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:23,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:23,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:23,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:23,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 322 [2023-11-06 22:48:23,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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:48:23,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:23,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 322 [2023-11-06 22:48:23,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:24,129 INFO L124 PetriNetUnfolderBase]: 1833/2902 cut-off events. [2023-11-06 22:48:24,129 INFO L125 PetriNetUnfolderBase]: For 610/610 co-relation queries the response was YES. [2023-11-06 22:48:24,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7703 conditions, 2902 events. 1833/2902 cut-off events. For 610/610 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 16711 event pairs, 889 based on Foata normal form. 0/2577 useless extension candidates. Maximal degree in co-relation 7696. Up to 1775 conditions per place. [2023-11-06 22:48:24,149 INFO L140 encePairwiseOnDemand]: 316/322 looper letters, 48 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2023-11-06 22:48:24,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 299 flow [2023-11-06 22:48:24,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-11-06 22:48:24,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420289855072464 [2023-11-06 22:48:24,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-11-06 22:48:24,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-11-06 22:48:24,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:24,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-11-06 22:48:24,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states 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:48:24,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:48:24,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:48:24,159 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 136 flow. Second operand 3 states and 427 transitions. [2023-11-06 22:48:24,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 299 flow [2023-11-06 22:48:24,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:24,165 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 168 flow [2023-11-06 22:48:24,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2023-11-06 22:48:24,167 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -21 predicate places. [2023-11-06 22:48:24,171 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 168 flow [2023-11-06 22:48:24,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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:48:24,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:24,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:24,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:48:24,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:24,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:24,173 INFO L85 PathProgramCache]: Analyzing trace with hash -720057693, now seen corresponding path program 1 times [2023-11-06 22:48:24,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:24,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635774583] [2023-11-06 22:48:24,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:24,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:24,544 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:48:24,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:24,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635774583] [2023-11-06 22:48:24,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635774583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:24,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:24,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:24,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246700129] [2023-11-06 22:48:24,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:24,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:24,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:24,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:24,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:24,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 322 [2023-11-06 22:48:24,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:48:24,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:24,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 322 [2023-11-06 22:48:24,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:25,457 INFO L124 PetriNetUnfolderBase]: 2305/3755 cut-off events. [2023-11-06 22:48:25,458 INFO L125 PetriNetUnfolderBase]: For 1664/1706 co-relation queries the response was YES. [2023-11-06 22:48:25,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10236 conditions, 3755 events. 2305/3755 cut-off events. For 1664/1706 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 23710 event pairs, 1070 based on Foata normal form. 54/3319 useless extension candidates. Maximal degree in co-relation 10228. Up to 1706 conditions per place. [2023-11-06 22:48:25,483 INFO L140 encePairwiseOnDemand]: 317/322 looper letters, 76 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2023-11-06 22:48:25,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 87 transitions, 491 flow [2023-11-06 22:48:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:48:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-11-06 22:48:25,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329192546583851 [2023-11-06 22:48:25,487 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-11-06 22:48:25,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-11-06 22:48:25,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:25,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-11-06 22:48:25,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states 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:48:25,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 322.0) internal successors, (1932), 6 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states 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:48:25,494 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 322.0) internal successors, (1932), 6 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states 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:48:25,494 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 168 flow. Second operand 5 states and 697 transitions. [2023-11-06 22:48:25,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 87 transitions, 491 flow [2023-11-06 22:48:25,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 87 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:25,502 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 177 flow [2023-11-06 22:48:25,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-11-06 22:48:25,503 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -19 predicate places. [2023-11-06 22:48:25,503 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 177 flow [2023-11-06 22:48:25,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:48:25,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:25,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:25,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:48:25,504 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:25,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:25,505 INFO L85 PathProgramCache]: Analyzing trace with hash -53058368, now seen corresponding path program 1 times [2023-11-06 22:48:25,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:25,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606632932] [2023-11-06 22:48:25,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:25,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:25,674 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:48:25,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:25,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606632932] [2023-11-06 22:48:25,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606632932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:25,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:25,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:48:25,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108274507] [2023-11-06 22:48:25,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:25,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:25,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:25,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:25,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:25,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 322 [2023-11-06 22:48:25,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states 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:48:25,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:25,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 322 [2023-11-06 22:48:25,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:27,111 INFO L124 PetriNetUnfolderBase]: 4935/7840 cut-off events. [2023-11-06 22:48:27,112 INFO L125 PetriNetUnfolderBase]: For 6386/6528 co-relation queries the response was YES. [2023-11-06 22:48:27,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21143 conditions, 7840 events. 4935/7840 cut-off events. For 6386/6528 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 55949 event pairs, 649 based on Foata normal form. 116/6881 useless extension candidates. Maximal degree in co-relation 21135. Up to 3640 conditions per place. [2023-11-06 22:48:27,186 INFO L140 encePairwiseOnDemand]: 318/322 looper letters, 86 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2023-11-06 22:48:27,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 94 transitions, 591 flow [2023-11-06 22:48:27,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:27,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 573 transitions. [2023-11-06 22:48:27,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4448757763975155 [2023-11-06 22:48:27,191 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 573 transitions. [2023-11-06 22:48:27,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 573 transitions. [2023-11-06 22:48:27,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:27,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 573 transitions. [2023-11-06 22:48:27,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states 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:48:27,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:48:27,199 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:48:27,199 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 177 flow. Second operand 4 states and 573 transitions. [2023-11-06 22:48:27,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 94 transitions, 591 flow [2023-11-06 22:48:27,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 583 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:27,213 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 192 flow [2023-11-06 22:48:27,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-06 22:48:27,214 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -16 predicate places. [2023-11-06 22:48:27,214 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 192 flow [2023-11-06 22:48:27,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states 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:48:27,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:27,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:27,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:48:27,216 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:27,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:27,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1643710617, now seen corresponding path program 1 times [2023-11-06 22:48:27,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:27,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264167591] [2023-11-06 22:48:27,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:27,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:27,418 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:48:27,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:27,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264167591] [2023-11-06 22:48:27,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264167591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:27,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:27,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:27,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798777092] [2023-11-06 22:48:27,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:27,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:27,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:27,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:27,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:27,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 322 [2023-11-06 22:48:27,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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:48:27,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:27,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 322 [2023-11-06 22:48:27,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:28,867 INFO L124 PetriNetUnfolderBase]: 6095/9794 cut-off events. [2023-11-06 22:48:28,867 INFO L125 PetriNetUnfolderBase]: For 7033/7212 co-relation queries the response was YES. [2023-11-06 22:48:28,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27574 conditions, 9794 events. 6095/9794 cut-off events. For 7033/7212 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 72592 event pairs, 2769 based on Foata normal form. 73/8471 useless extension candidates. Maximal degree in co-relation 27564. Up to 5173 conditions per place. [2023-11-06 22:48:28,934 INFO L140 encePairwiseOnDemand]: 318/322 looper letters, 109 selfloop transitions, 4 changer transitions 0/118 dead transitions. [2023-11-06 22:48:28,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 118 transitions, 759 flow [2023-11-06 22:48:28,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:48:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2023-11-06 22:48:28,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4440993788819876 [2023-11-06 22:48:28,938 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2023-11-06 22:48:28,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2023-11-06 22:48:28,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:28,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2023-11-06 22:48:28,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states 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:48:28,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 322.0) internal successors, (1932), 6 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states 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:48:28,945 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 322.0) internal successors, (1932), 6 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states 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:48:28,946 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 192 flow. Second operand 5 states and 715 transitions. [2023-11-06 22:48:28,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 118 transitions, 759 flow [2023-11-06 22:48:28,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 118 transitions, 754 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:28,960 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 215 flow [2023-11-06 22:48:28,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-11-06 22:48:28,962 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -11 predicate places. [2023-11-06 22:48:28,962 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 215 flow [2023-11-06 22:48:28,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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:48:28,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:28,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:28,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:48:28,964 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:28,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1643652484, now seen corresponding path program 1 times [2023-11-06 22:48:28,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:28,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896171015] [2023-11-06 22:48:28,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:28,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,251 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:48:29,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:29,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896171015] [2023-11-06 22:48:29,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896171015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:29,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:29,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:29,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251202423] [2023-11-06 22:48:29,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:29,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:29,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:29,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:29,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:29,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 322 [2023-11-06 22:48:29,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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:48:29,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:29,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 322 [2023-11-06 22:48:29,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:30,399 INFO L124 PetriNetUnfolderBase]: 4564/7438 cut-off events. [2023-11-06 22:48:30,399 INFO L125 PetriNetUnfolderBase]: For 6301/6316 co-relation queries the response was YES. [2023-11-06 22:48:30,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21837 conditions, 7438 events. 4564/7438 cut-off events. For 6301/6316 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 53172 event pairs, 1939 based on Foata normal form. 46/6543 useless extension candidates. Maximal degree in co-relation 21824. Up to 2991 conditions per place. [2023-11-06 22:48:30,446 INFO L140 encePairwiseOnDemand]: 311/322 looper letters, 50 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2023-11-06 22:48:30,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 439 flow [2023-11-06 22:48:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2023-11-06 22:48:30,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4138198757763975 [2023-11-06 22:48:30,454 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2023-11-06 22:48:30,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2023-11-06 22:48:30,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:30,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2023-11-06 22:48:30,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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:48:30,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:48:30,465 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:48:30,465 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 215 flow. Second operand 4 states and 533 transitions. [2023-11-06 22:48:30,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 439 flow [2023-11-06 22:48:30,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:30,482 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 277 flow [2023-11-06 22:48:30,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-11-06 22:48:30,484 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2023-11-06 22:48:30,484 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 277 flow [2023-11-06 22:48:30,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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:48:30,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:30,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:30,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:48:30,485 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:30,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:30,486 INFO L85 PathProgramCache]: Analyzing trace with hash -900571501, now seen corresponding path program 1 times [2023-11-06 22:48:30,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:30,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293327310] [2023-11-06 22:48:30,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:30,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,931 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:48:30,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:30,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293327310] [2023-11-06 22:48:30,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293327310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:30,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:30,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:48:30,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870161590] [2023-11-06 22:48:30,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:30,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:30,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:30,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:30,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:30,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 322 [2023-11-06 22:48:30,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 277 flow. Second operand has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states 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:48:30,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:30,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 322 [2023-11-06 22:48:30,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:32,022 INFO L124 PetriNetUnfolderBase]: 4007/6857 cut-off events. [2023-11-06 22:48:32,023 INFO L125 PetriNetUnfolderBase]: For 7764/7851 co-relation queries the response was YES. [2023-11-06 22:48:32,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22005 conditions, 6857 events. 4007/6857 cut-off events. For 7764/7851 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 52223 event pairs, 1903 based on Foata normal form. 18/6147 useless extension candidates. Maximal degree in co-relation 21991. Up to 4897 conditions per place. [2023-11-06 22:48:32,071 INFO L140 encePairwiseOnDemand]: 319/322 looper letters, 60 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2023-11-06 22:48:32,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 529 flow [2023-11-06 22:48:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-11-06 22:48:32,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45652173913043476 [2023-11-06 22:48:32,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-11-06 22:48:32,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-11-06 22:48:32,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:32,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-11-06 22:48:32,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:48:32,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:48:32,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:48:32,080 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 277 flow. Second operand 3 states and 441 transitions. [2023-11-06 22:48:32,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 529 flow [2023-11-06 22:48:32,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 72 transitions, 523 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:32,147 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 287 flow [2023-11-06 22:48:32,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2023-11-06 22:48:32,148 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2023-11-06 22:48:32,148 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 287 flow [2023-11-06 22:48:32,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states 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:48:32,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:32,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:32,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:48:32,150 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:32,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:32,150 INFO L85 PathProgramCache]: Analyzing trace with hash 997903082, now seen corresponding path program 1 times [2023-11-06 22:48:32,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:32,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794135197] [2023-11-06 22:48:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:32,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:33,028 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:48:33,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:33,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794135197] [2023-11-06 22:48:33,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794135197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:33,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:33,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:48:33,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338055728] [2023-11-06 22:48:33,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:33,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:48:33,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:33,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:48:33,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:48:33,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 322 [2023-11-06 22:48:33,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 287 flow. Second operand has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states 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:48:33,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:33,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 322 [2023-11-06 22:48:33,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:34,751 INFO L124 PetriNetUnfolderBase]: 3260/5649 cut-off events. [2023-11-06 22:48:34,751 INFO L125 PetriNetUnfolderBase]: For 7619/7798 co-relation queries the response was YES. [2023-11-06 22:48:34,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18596 conditions, 5649 events. 3260/5649 cut-off events. For 7619/7798 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 42368 event pairs, 1254 based on Foata normal form. 41/5358 useless extension candidates. Maximal degree in co-relation 18580. Up to 2911 conditions per place. [2023-11-06 22:48:34,790 INFO L140 encePairwiseOnDemand]: 314/322 looper letters, 88 selfloop transitions, 18 changer transitions 4/118 dead transitions. [2023-11-06 22:48:34,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 118 transitions, 888 flow [2023-11-06 22:48:34,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:48:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:48:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1117 transitions. [2023-11-06 22:48:34,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854382332643202 [2023-11-06 22:48:34,804 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1117 transitions. [2023-11-06 22:48:34,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1117 transitions. [2023-11-06 22:48:34,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:34,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1117 transitions. [2023-11-06 22:48:34,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.11111111111111) internal successors, (1117), 9 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states 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:48:34,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 322.0) internal successors, (3220), 10 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states 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:48:34,824 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 322.0) internal successors, (3220), 10 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states 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:48:34,824 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 287 flow. Second operand 9 states and 1117 transitions. [2023-11-06 22:48:34,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 118 transitions, 888 flow [2023-11-06 22:48:34,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 118 transitions, 868 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:34,878 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 428 flow [2023-11-06 22:48:34,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=428, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2023-11-06 22:48:34,881 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-11-06 22:48:34,882 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 428 flow [2023-11-06 22:48:34,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states 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:48:34,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:34,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:34,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:48:34,883 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:34,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:34,884 INFO L85 PathProgramCache]: Analyzing trace with hash 586379715, now seen corresponding path program 1 times [2023-11-06 22:48:34,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:34,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329230994] [2023-11-06 22:48:34,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:34,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:48:35,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:35,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329230994] [2023-11-06 22:48:35,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329230994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:35,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:35,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:48:35,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311101236] [2023-11-06 22:48:35,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:35,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:48:35,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:35,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:48:35,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:48:35,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 322 [2023-11-06 22:48:35,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 428 flow. Second operand has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 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:48:35,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:35,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 322 [2023-11-06 22:48:35,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:36,487 INFO L124 PetriNetUnfolderBase]: 3288/5474 cut-off events. [2023-11-06 22:48:36,487 INFO L125 PetriNetUnfolderBase]: For 8590/8602 co-relation queries the response was YES. [2023-11-06 22:48:36,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18945 conditions, 5474 events. 3288/5474 cut-off events. For 8590/8602 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 38536 event pairs, 1398 based on Foata normal form. 113/5406 useless extension candidates. Maximal degree in co-relation 18926. Up to 2645 conditions per place. [2023-11-06 22:48:36,527 INFO L140 encePairwiseOnDemand]: 310/322 looper letters, 60 selfloop transitions, 20 changer transitions 4/88 dead transitions. [2023-11-06 22:48:36,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 88 transitions, 739 flow [2023-11-06 22:48:36,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:48:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:48:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 776 transitions. [2023-11-06 22:48:36,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40165631469979296 [2023-11-06 22:48:36,533 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 776 transitions. [2023-11-06 22:48:36,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 776 transitions. [2023-11-06 22:48:36,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:36,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 776 transitions. [2023-11-06 22:48:36,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 0 states have call successors, (0), 0 states 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:48:36,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 322.0) internal successors, (2254), 7 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states 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:48:36,543 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 322.0) internal successors, (2254), 7 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states 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:48:36,544 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 428 flow. Second operand 6 states and 776 transitions. [2023-11-06 22:48:36,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 88 transitions, 739 flow [2023-11-06 22:48:36,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 88 transitions, 727 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-11-06 22:48:36,629 INFO L231 Difference]: Finished difference. Result has 78 places, 62 transitions, 521 flow [2023-11-06 22:48:36,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=521, PETRI_PLACES=78, PETRI_TRANSITIONS=62} [2023-11-06 22:48:36,630 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2023-11-06 22:48:36,631 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 62 transitions, 521 flow [2023-11-06 22:48:36,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 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:48:36,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:36,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:36,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:48:36,632 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:36,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:36,633 INFO L85 PathProgramCache]: Analyzing trace with hash 848107157, now seen corresponding path program 1 times [2023-11-06 22:48:36,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:36,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739172668] [2023-11-06 22:48:36,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:36,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,971 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:48:37,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:37,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739172668] [2023-11-06 22:48:37,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739172668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:37,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:37,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:48:37,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981407150] [2023-11-06 22:48:37,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:37,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:48:37,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:37,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:48:37,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:48:38,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 322 [2023-11-06 22:48:38,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 62 transitions, 521 flow. Second operand has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states 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:48:38,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:38,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 322 [2023-11-06 22:48:38,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:39,317 INFO L124 PetriNetUnfolderBase]: 3683/6093 cut-off events. [2023-11-06 22:48:39,317 INFO L125 PetriNetUnfolderBase]: For 13363/13375 co-relation queries the response was YES. [2023-11-06 22:48:39,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22956 conditions, 6093 events. 3683/6093 cut-off events. For 13363/13375 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 43320 event pairs, 2420 based on Foata normal form. 16/5912 useless extension candidates. Maximal degree in co-relation 22935. Up to 5435 conditions per place. [2023-11-06 22:48:39,349 INFO L140 encePairwiseOnDemand]: 312/322 looper letters, 85 selfloop transitions, 14 changer transitions 0/102 dead transitions. [2023-11-06 22:48:39,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 102 transitions, 931 flow [2023-11-06 22:48:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:48:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:48:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 976 transitions. [2023-11-06 22:48:39,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37888198757763975 [2023-11-06 22:48:39,354 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 976 transitions. [2023-11-06 22:48:39,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 976 transitions. [2023-11-06 22:48:39,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:39,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 976 transitions. [2023-11-06 22:48:39,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states 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:48:39,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 322.0) internal successors, (2898), 9 states have internal predecessors, (2898), 0 states have call successors, (0), 0 states 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:48:39,364 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 322.0) internal successors, (2898), 9 states have internal predecessors, (2898), 0 states have call successors, (0), 0 states 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:48:39,365 INFO L175 Difference]: Start difference. First operand has 78 places, 62 transitions, 521 flow. Second operand 8 states and 976 transitions. [2023-11-06 22:48:39,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 102 transitions, 931 flow [2023-11-06 22:48:39,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 102 transitions, 901 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:48:39,488 INFO L231 Difference]: Finished difference. Result has 86 places, 72 transitions, 627 flow [2023-11-06 22:48:39,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=627, PETRI_PLACES=86, PETRI_TRANSITIONS=72} [2023-11-06 22:48:39,489 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 18 predicate places. [2023-11-06 22:48:39,489 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 72 transitions, 627 flow [2023-11-06 22:48:39,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states 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:48:39,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:39,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:39,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:48:39,491 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:39,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1801203232, now seen corresponding path program 2 times [2023-11-06 22:48:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:39,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308945572] [2023-11-06 22:48:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:39,925 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:48:39,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:39,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308945572] [2023-11-06 22:48:39,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308945572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:39,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:39,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:48:39,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408780037] [2023-11-06 22:48:39,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:39,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:48:39,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:39,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:48:39,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:48:40,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 322 [2023-11-06 22:48:40,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 72 transitions, 627 flow. Second operand has 9 states, 9 states have (on average 114.55555555555556) internal successors, (1031), 9 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states 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:48:40,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:40,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 322 [2023-11-06 22:48:40,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:41,195 INFO L124 PetriNetUnfolderBase]: 3363/5568 cut-off events. [2023-11-06 22:48:41,195 INFO L125 PetriNetUnfolderBase]: For 11905/11917 co-relation queries the response was YES. [2023-11-06 22:48:41,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21210 conditions, 5568 events. 3363/5568 cut-off events. For 11905/11917 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 38844 event pairs, 1081 based on Foata normal form. 12/5521 useless extension candidates. Maximal degree in co-relation 21184. Up to 2083 conditions per place. [2023-11-06 22:48:41,229 INFO L140 encePairwiseOnDemand]: 315/322 looper letters, 71 selfloop transitions, 23 changer transitions 2/100 dead transitions. [2023-11-06 22:48:41,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 100 transitions, 922 flow [2023-11-06 22:48:41,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:48:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 848 transitions. [2023-11-06 22:48:41,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3762200532386868 [2023-11-06 22:48:41,234 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 848 transitions. [2023-11-06 22:48:41,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 848 transitions. [2023-11-06 22:48:41,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:41,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 848 transitions. [2023-11-06 22:48:41,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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:48:41,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 322.0) internal successors, (2576), 8 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states 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:48:41,243 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 322.0) internal successors, (2576), 8 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states 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:48:41,243 INFO L175 Difference]: Start difference. First operand has 86 places, 72 transitions, 627 flow. Second operand 7 states and 848 transitions. [2023-11-06 22:48:41,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 100 transitions, 922 flow [2023-11-06 22:48:41,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 100 transitions, 888 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-06 22:48:41,391 INFO L231 Difference]: Finished difference. Result has 88 places, 68 transitions, 589 flow [2023-11-06 22:48:41,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=589, PETRI_PLACES=88, PETRI_TRANSITIONS=68} [2023-11-06 22:48:41,392 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 20 predicate places. [2023-11-06 22:48:41,392 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 68 transitions, 589 flow [2023-11-06 22:48:41,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.55555555555556) internal successors, (1031), 9 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states 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:48:41,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:41,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:41,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:48:41,394 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:41,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1248279651, now seen corresponding path program 2 times [2023-11-06 22:48:41,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:41,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945650572] [2023-11-06 22:48:41,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:41,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:42,493 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:48:42,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:42,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945650572] [2023-11-06 22:48:42,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945650572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:42,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:42,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:48:42,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257777702] [2023-11-06 22:48:42,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:42,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:48:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:42,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:48:42,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:48:42,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 322 [2023-11-06 22:48:42,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 68 transitions, 589 flow. Second operand has 9 states, 9 states have (on average 114.55555555555556) internal successors, (1031), 9 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states 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:48:42,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:42,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 322 [2023-11-06 22:48:42,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:43,899 INFO L124 PetriNetUnfolderBase]: 3367/5578 cut-off events. [2023-11-06 22:48:43,899 INFO L125 PetriNetUnfolderBase]: For 12916/12928 co-relation queries the response was YES. [2023-11-06 22:48:43,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21787 conditions, 5578 events. 3367/5578 cut-off events. For 12916/12928 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 39204 event pairs, 1253 based on Foata normal form. 16/5538 useless extension candidates. Maximal degree in co-relation 21763. Up to 4588 conditions per place. [2023-11-06 22:48:43,929 INFO L140 encePairwiseOnDemand]: 313/322 looper letters, 83 selfloop transitions, 21 changer transitions 1/108 dead transitions. [2023-11-06 22:48:43,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 108 transitions, 1023 flow [2023-11-06 22:48:43,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:48:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:48:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1082 transitions. [2023-11-06 22:48:43,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37336093857832986 [2023-11-06 22:48:43,933 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1082 transitions. [2023-11-06 22:48:43,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1082 transitions. [2023-11-06 22:48:43,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:43,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1082 transitions. [2023-11-06 22:48:43,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.22222222222223) internal successors, (1082), 9 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states 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:48:43,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 322.0) internal successors, (3220), 10 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states 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:48:43,944 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 322.0) internal successors, (3220), 10 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states 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:48:43,944 INFO L175 Difference]: Start difference. First operand has 88 places, 68 transitions, 589 flow. Second operand 9 states and 1082 transitions. [2023-11-06 22:48:43,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 108 transitions, 1023 flow [2023-11-06 22:48:44,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 108 transitions, 971 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-06 22:48:44,060 INFO L231 Difference]: Finished difference. Result has 94 places, 76 transitions, 685 flow [2023-11-06 22:48:44,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=685, PETRI_PLACES=94, PETRI_TRANSITIONS=76} [2023-11-06 22:48:44,061 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 26 predicate places. [2023-11-06 22:48:44,061 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 76 transitions, 685 flow [2023-11-06 22:48:44,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.55555555555556) internal successors, (1031), 9 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states 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:48:44,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:44,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:44,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:48:44,062 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:44,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash 444637727, now seen corresponding path program 3 times [2023-11-06 22:48:44,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:44,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282201321] [2023-11-06 22:48:44,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:44,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,997 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:48:44,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:44,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282201321] [2023-11-06 22:48:44,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282201321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:44,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:44,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:48:44,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495477066] [2023-11-06 22:48:44,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:44,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:48:44,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:45,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:48:45,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:48:45,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 322 [2023-11-06 22:48:45,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 76 transitions, 685 flow. Second operand has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states 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:48:45,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:45,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 322 [2023-11-06 22:48:45,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:46,385 INFO L124 PetriNetUnfolderBase]: 3330/5558 cut-off events. [2023-11-06 22:48:46,385 INFO L125 PetriNetUnfolderBase]: For 12953/12967 co-relation queries the response was YES. [2023-11-06 22:48:46,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21672 conditions, 5558 events. 3330/5558 cut-off events. For 12953/12967 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 39297 event pairs, 378 based on Foata normal form. 18/5529 useless extension candidates. Maximal degree in co-relation 21644. Up to 3874 conditions per place. [2023-11-06 22:48:46,413 INFO L140 encePairwiseOnDemand]: 314/322 looper letters, 97 selfloop transitions, 35 changer transitions 2/137 dead transitions. [2023-11-06 22:48:46,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 137 transitions, 1346 flow [2023-11-06 22:48:46,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:48:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:48:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1334 transitions. [2023-11-06 22:48:46,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37662337662337664 [2023-11-06 22:48:46,419 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1334 transitions. [2023-11-06 22:48:46,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1334 transitions. [2023-11-06 22:48:46,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:46,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1334 transitions. [2023-11-06 22:48:46,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.27272727272727) internal successors, (1334), 11 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states 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:48:46,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 322.0) internal successors, (3864), 12 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states 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:48:46,432 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 322.0) internal successors, (3864), 12 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states 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:48:46,432 INFO L175 Difference]: Start difference. First operand has 94 places, 76 transitions, 685 flow. Second operand 11 states and 1334 transitions. [2023-11-06 22:48:46,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 137 transitions, 1346 flow [2023-11-06 22:48:46,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 137 transitions, 1297 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-11-06 22:48:46,579 INFO L231 Difference]: Finished difference. Result has 106 places, 88 transitions, 896 flow [2023-11-06 22:48:46,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=896, PETRI_PLACES=106, PETRI_TRANSITIONS=88} [2023-11-06 22:48:46,580 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 38 predicate places. [2023-11-06 22:48:46,580 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 896 flow [2023-11-06 22:48:46,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states 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:48:46,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:46,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:46,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:48:46,581 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:46,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:46,582 INFO L85 PathProgramCache]: Analyzing trace with hash 997905023, now seen corresponding path program 1 times [2023-11-06 22:48:46,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:46,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921027753] [2023-11-06 22:48:46,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:46,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,664 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:48:46,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:46,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921027753] [2023-11-06 22:48:46,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921027753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:46,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:46,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:48:46,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888327807] [2023-11-06 22:48:46,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:46,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:46,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:46,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:46,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:46,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 322 [2023-11-06 22:48:46,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 88 transitions, 896 flow. Second operand has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states 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:48:46,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:46,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 322 [2023-11-06 22:48:46,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:47,442 INFO L124 PetriNetUnfolderBase]: 3046/4973 cut-off events. [2023-11-06 22:48:47,442 INFO L125 PetriNetUnfolderBase]: For 15006/15018 co-relation queries the response was YES. [2023-11-06 22:48:47,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20358 conditions, 4973 events. 3046/4973 cut-off events. For 15006/15018 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 33399 event pairs, 1916 based on Foata normal form. 127/5081 useless extension candidates. Maximal degree in co-relation 20326. Up to 3830 conditions per place. [2023-11-06 22:48:47,476 INFO L140 encePairwiseOnDemand]: 311/322 looper letters, 30 selfloop transitions, 1 changer transitions 55/91 dead transitions. [2023-11-06 22:48:47,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 91 transitions, 1067 flow [2023-11-06 22:48:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2023-11-06 22:48:47,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2023-11-06 22:48:47,479 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 532 transitions. [2023-11-06 22:48:47,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 532 transitions. [2023-11-06 22:48:47,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:47,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 532 transitions. [2023-11-06 22:48:47,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states 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:48:47,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:48:47,484 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:48:47,484 INFO L175 Difference]: Start difference. First operand has 106 places, 88 transitions, 896 flow. Second operand 4 states and 532 transitions. [2023-11-06 22:48:47,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 91 transitions, 1067 flow [2023-11-06 22:48:47,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 91 transitions, 1009 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-11-06 22:48:47,684 INFO L231 Difference]: Finished difference. Result has 99 places, 36 transitions, 262 flow [2023-11-06 22:48:47,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=99, PETRI_TRANSITIONS=36} [2023-11-06 22:48:47,684 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 31 predicate places. [2023-11-06 22:48:47,684 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 36 transitions, 262 flow [2023-11-06 22:48:47,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states 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:48:47,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:47,685 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:48:47,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:48:47,685 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:47,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash -487408973, now seen corresponding path program 1 times [2023-11-06 22:48:47,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:47,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247191696] [2023-11-06 22:48:47,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:47,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:47,883 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:48:47,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:47,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247191696] [2023-11-06 22:48:47,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247191696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:47,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:47,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:47,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42114484] [2023-11-06 22:48:47,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:47,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:47,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:47,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:47,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:47,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 322 [2023-11-06 22:48:47,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 36 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states 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:48:47,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:47,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 322 [2023-11-06 22:48:47,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:48,099 INFO L124 PetriNetUnfolderBase]: 321/623 cut-off events. [2023-11-06 22:48:48,100 INFO L125 PetriNetUnfolderBase]: For 2044/2047 co-relation queries the response was YES. [2023-11-06 22:48:48,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2156 conditions, 623 events. 321/623 cut-off events. For 2044/2047 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3237 event pairs, 66 based on Foata normal form. 59/676 useless extension candidates. Maximal degree in co-relation 2126. Up to 416 conditions per place. [2023-11-06 22:48:48,104 INFO L140 encePairwiseOnDemand]: 316/322 looper letters, 47 selfloop transitions, 7 changer transitions 8/71 dead transitions. [2023-11-06 22:48:48,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 71 transitions, 628 flow [2023-11-06 22:48:48,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:48:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 681 transitions. [2023-11-06 22:48:48,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229813664596273 [2023-11-06 22:48:48,108 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 681 transitions. [2023-11-06 22:48:48,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 681 transitions. [2023-11-06 22:48:48,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:48,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 681 transitions. [2023-11-06 22:48:48,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states 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:48:48,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 322.0) internal successors, (1932), 6 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states 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:48:48,114 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 322.0) internal successors, (1932), 6 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states 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:48:48,114 INFO L175 Difference]: Start difference. First operand has 99 places, 36 transitions, 262 flow. Second operand 5 states and 681 transitions. [2023-11-06 22:48:48,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 71 transitions, 628 flow [2023-11-06 22:48:48,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 71 transitions, 567 flow, removed 5 selfloop flow, removed 12 redundant places. [2023-11-06 22:48:48,119 INFO L231 Difference]: Finished difference. Result has 75 places, 42 transitions, 280 flow [2023-11-06 22:48:48,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=75, PETRI_TRANSITIONS=42} [2023-11-06 22:48:48,120 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2023-11-06 22:48:48,120 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 42 transitions, 280 flow [2023-11-06 22:48:48,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states 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:48:48,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:48,120 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:48:48,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:48:48,121 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:48,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:48,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1575811962, now seen corresponding path program 1 times [2023-11-06 22:48:48,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:48,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741146011] [2023-11-06 22:48:48,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:48,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,304 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:48:48,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:48,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741146011] [2023-11-06 22:48:48,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741146011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:48,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:48,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:48,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592041922] [2023-11-06 22:48:48,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:48,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:48,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:48,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:48,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:48,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 322 [2023-11-06 22:48:48,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 42 transitions, 280 flow. Second operand has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states 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:48:48,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:48,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 322 [2023-11-06 22:48:48,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:48,551 INFO L124 PetriNetUnfolderBase]: 241/512 cut-off events. [2023-11-06 22:48:48,551 INFO L125 PetriNetUnfolderBase]: For 1112/1112 co-relation queries the response was YES. [2023-11-06 22:48:48,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2140 conditions, 512 events. 241/512 cut-off events. For 1112/1112 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2687 event pairs, 14 based on Foata normal form. 42/548 useless extension candidates. Maximal degree in co-relation 2118. Up to 229 conditions per place. [2023-11-06 22:48:48,555 INFO L140 encePairwiseOnDemand]: 316/322 looper letters, 52 selfloop transitions, 13 changer transitions 12/86 dead transitions. [2023-11-06 22:48:48,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 86 transitions, 760 flow [2023-11-06 22:48:48,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:48:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 949 transitions. [2023-11-06 22:48:48,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4210292812777285 [2023-11-06 22:48:48,561 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 949 transitions. [2023-11-06 22:48:48,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 949 transitions. [2023-11-06 22:48:48,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:48,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 949 transitions. [2023-11-06 22:48:48,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.57142857142858) internal successors, (949), 7 states have internal predecessors, (949), 0 states have call successors, (0), 0 states 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:48:48,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 322.0) internal successors, (2576), 8 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states 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:48:48,570 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 322.0) internal successors, (2576), 8 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states 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:48:48,570 INFO L175 Difference]: Start difference. First operand has 75 places, 42 transitions, 280 flow. Second operand 7 states and 949 transitions. [2023-11-06 22:48:48,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 86 transitions, 760 flow [2023-11-06 22:48:48,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 86 transitions, 756 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:48,575 INFO L231 Difference]: Finished difference. Result has 83 places, 48 transitions, 364 flow [2023-11-06 22:48:48,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=364, PETRI_PLACES=83, PETRI_TRANSITIONS=48} [2023-11-06 22:48:48,576 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 15 predicate places. [2023-11-06 22:48:48,576 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 48 transitions, 364 flow [2023-11-06 22:48:48,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states 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:48:48,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:48,577 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:48:48,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:48:48,578 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:48,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:48,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1361571931, now seen corresponding path program 1 times [2023-11-06 22:48:48,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:48,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082312079] [2023-11-06 22:48:48,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:48,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,754 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:48:48,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:48,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082312079] [2023-11-06 22:48:48,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082312079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:48,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:48,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:48,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078073748] [2023-11-06 22:48:48,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:48,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:48,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:48,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:48,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:48,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 322 [2023-11-06 22:48:48,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 48 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states 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:48:48,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:48,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 322 [2023-11-06 22:48:48,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:49,054 INFO L124 PetriNetUnfolderBase]: 521/1081 cut-off events. [2023-11-06 22:48:49,054 INFO L125 PetriNetUnfolderBase]: For 3708/3708 co-relation queries the response was YES. [2023-11-06 22:48:49,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4820 conditions, 1081 events. 521/1081 cut-off events. For 3708/3708 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6427 event pairs, 147 based on Foata normal form. 10/1075 useless extension candidates. Maximal degree in co-relation 4795. Up to 493 conditions per place. [2023-11-06 22:48:49,061 INFO L140 encePairwiseOnDemand]: 319/322 looper letters, 59 selfloop transitions, 2 changer transitions 14/82 dead transitions. [2023-11-06 22:48:49,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 82 transitions, 797 flow [2023-11-06 22:48:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2023-11-06 22:48:49,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246894409937888 [2023-11-06 22:48:49,063 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 547 transitions. [2023-11-06 22:48:49,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions. [2023-11-06 22:48:49,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:49,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions. [2023-11-06 22:48:49,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states 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:48:49,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:48:49,067 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:48:49,068 INFO L175 Difference]: Start difference. First operand has 83 places, 48 transitions, 364 flow. Second operand 4 states and 547 transitions. [2023-11-06 22:48:49,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 82 transitions, 797 flow [2023-11-06 22:48:49,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 82 transitions, 732 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:49,087 INFO L231 Difference]: Finished difference. Result has 86 places, 47 transitions, 331 flow [2023-11-06 22:48:49,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=331, PETRI_PLACES=86, PETRI_TRANSITIONS=47} [2023-11-06 22:48:49,088 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 18 predicate places. [2023-11-06 22:48:49,088 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 47 transitions, 331 flow [2023-11-06 22:48:49,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states 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:48:49,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:49,089 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:48:49,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:48:49,089 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:49,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:49,090 INFO L85 PathProgramCache]: Analyzing trace with hash 99200545, now seen corresponding path program 2 times [2023-11-06 22:48:49,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:49,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315585880] [2023-11-06 22:48:49,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:49,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:49,317 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:48:49,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:49,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315585880] [2023-11-06 22:48:49,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315585880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:49,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:49,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:48:49,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518813399] [2023-11-06 22:48:49,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:49,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:48:49,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:49,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:48:49,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:48:49,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 322 [2023-11-06 22:48:49,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 47 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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:48:49,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:49,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 322 [2023-11-06 22:48:49,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:49,573 INFO L124 PetriNetUnfolderBase]: 256/582 cut-off events. [2023-11-06 22:48:49,573 INFO L125 PetriNetUnfolderBase]: For 1595/1611 co-relation queries the response was YES. [2023-11-06 22:48:49,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 582 events. 256/582 cut-off events. For 1595/1611 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3371 event pairs, 8 based on Foata normal form. 42/598 useless extension candidates. Maximal degree in co-relation 2465. Up to 159 conditions per place. [2023-11-06 22:48:49,577 INFO L140 encePairwiseOnDemand]: 316/322 looper letters, 42 selfloop transitions, 15 changer transitions 20/85 dead transitions. [2023-11-06 22:48:49,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 85 transitions, 781 flow [2023-11-06 22:48:49,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:48:49,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:48:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1201 transitions. [2023-11-06 22:48:49,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.414423740510697 [2023-11-06 22:48:49,582 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1201 transitions. [2023-11-06 22:48:49,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1201 transitions. [2023-11-06 22:48:49,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:49,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1201 transitions. [2023-11-06 22:48:49,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 133.44444444444446) internal successors, (1201), 9 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states 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:48:49,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 322.0) internal successors, (3220), 10 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states 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:48:49,590 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 322.0) internal successors, (3220), 10 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states 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:48:49,590 INFO L175 Difference]: Start difference. First operand has 86 places, 47 transitions, 331 flow. Second operand 9 states and 1201 transitions. [2023-11-06 22:48:49,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 85 transitions, 781 flow [2023-11-06 22:48:49,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 85 transitions, 733 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-06 22:48:49,599 INFO L231 Difference]: Finished difference. Result has 91 places, 45 transitions, 336 flow [2023-11-06 22:48:49,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=336, PETRI_PLACES=91, PETRI_TRANSITIONS=45} [2023-11-06 22:48:49,599 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 23 predicate places. [2023-11-06 22:48:49,600 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 45 transitions, 336 flow [2023-11-06 22:48:49,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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:48:49,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:49,600 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:48:49,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:48:49,601 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:49,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1293488098, now seen corresponding path program 1 times [2023-11-06 22:48:49,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:49,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646152856] [2023-11-06 22:48:49,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:49,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:49,802 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:48:49,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:49,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646152856] [2023-11-06 22:48:49,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646152856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:49,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196827863] [2023-11-06 22:48:49,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:49,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:49,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:49,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:49,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:49,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 322 [2023-11-06 22:48:49,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 45 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states 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:48:49,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:49,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 322 [2023-11-06 22:48:49,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:50,030 INFO L124 PetriNetUnfolderBase]: 359/827 cut-off events. [2023-11-06 22:48:50,031 INFO L125 PetriNetUnfolderBase]: For 2644/2644 co-relation queries the response was YES. [2023-11-06 22:48:50,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3651 conditions, 827 events. 359/827 cut-off events. For 2644/2644 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4993 event pairs, 173 based on Foata normal form. 2/823 useless extension candidates. Maximal degree in co-relation 3624. Up to 430 conditions per place. [2023-11-06 22:48:50,036 INFO L140 encePairwiseOnDemand]: 318/322 looper letters, 49 selfloop transitions, 4 changer transitions 25/84 dead transitions. [2023-11-06 22:48:50,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 84 transitions, 814 flow [2023-11-06 22:48:50,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:48:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 680 transitions. [2023-11-06 22:48:50,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.422360248447205 [2023-11-06 22:48:50,038 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 680 transitions. [2023-11-06 22:48:50,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 680 transitions. [2023-11-06 22:48:50,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:50,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 680 transitions. [2023-11-06 22:48:50,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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:48:50,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 322.0) internal successors, (1932), 6 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states 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:48:50,043 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 322.0) internal successors, (1932), 6 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states 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:48:50,044 INFO L175 Difference]: Start difference. First operand has 91 places, 45 transitions, 336 flow. Second operand 5 states and 680 transitions. [2023-11-06 22:48:50,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 84 transitions, 814 flow [2023-11-06 22:48:50,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 84 transitions, 682 flow, removed 31 selfloop flow, removed 11 redundant places. [2023-11-06 22:48:50,057 INFO L231 Difference]: Finished difference. Result has 84 places, 47 transitions, 297 flow [2023-11-06 22:48:50,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=84, PETRI_TRANSITIONS=47} [2023-11-06 22:48:50,057 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 16 predicate places. [2023-11-06 22:48:50,057 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 47 transitions, 297 flow [2023-11-06 22:48:50,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states 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:48:50,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:50,058 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:48:50,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 22:48:50,058 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:48:50,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:50,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1581335424, now seen corresponding path program 2 times [2023-11-06 22:48:50,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:50,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869740345] [2023-11-06 22:48:50,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:48:50,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:48:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:48:50,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:48:50,240 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:48:50,241 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2023-11-06 22:48:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2023-11-06 22:48:50,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2023-11-06 22:48:50,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2023-11-06 22:48:50,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2023-11-06 22:48:50,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2023-11-06 22:48:50,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2023-11-06 22:48:50,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2023-11-06 22:48:50,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2023-11-06 22:48:50,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2023-11-06 22:48:50,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2023-11-06 22:48:50,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2023-11-06 22:48:50,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2023-11-06 22:48:50,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2023-11-06 22:48:50,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2023-11-06 22:48:50,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2023-11-06 22:48:50,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2023-11-06 22:48:50,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2023-11-06 22:48:50,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2023-11-06 22:48:50,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2023-11-06 22:48:50,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2023-11-06 22:48:50,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2023-11-06 22:48:50,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2023-11-06 22:48:50,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2023-11-06 22:48:50,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2023-11-06 22:48:50,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2023-11-06 22:48:50,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2023-11-06 22:48:50,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2023-11-06 22:48:50,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2023-11-06 22:48:50,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2023-11-06 22:48:50,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2023-11-06 22:48:50,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2023-11-06 22:48:50,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2023-11-06 22:48:50,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2023-11-06 22:48:50,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2023-11-06 22:48:50,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2023-11-06 22:48:50,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2023-11-06 22:48:50,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2023-11-06 22:48:50,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2023-11-06 22:48:50,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2023-11-06 22:48:50,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2023-11-06 22:48:50,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2023-11-06 22:48:50,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2023-11-06 22:48:50,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2023-11-06 22:48:50,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2023-11-06 22:48:50,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2023-11-06 22:48:50,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2023-11-06 22:48:50,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2023-11-06 22:48:50,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2023-11-06 22:48:50,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2023-11-06 22:48:50,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2023-11-06 22:48:50,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2023-11-06 22:48:50,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2023-11-06 22:48:50,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:48:50,254 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:50,261 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:48:50,262 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:48:50,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:48:50 BasicIcfg [2023-11-06 22:48:50,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:48:50,399 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:48:50,399 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:48:50,399 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:48:50,399 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:03" (3/4) ... [2023-11-06 22:48:50,401 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:48:50,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:48:50,405 INFO L158 Benchmark]: Toolchain (without parser) took 48480.18ms. Allocated memory was 188.7MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 148.2MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 417.6MB. Max. memory is 16.1GB. [2023-11-06 22:48:50,406 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 134.2MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:48:50,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.35ms. Allocated memory is still 188.7MB. Free memory was 148.2MB in the beginning and 125.0MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:48:50,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.12ms. Allocated memory is still 188.7MB. Free memory was 125.0MB in the beginning and 123.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:48:50,407 INFO L158 Benchmark]: Boogie Preprocessor took 41.93ms. Allocated memory is still 188.7MB. Free memory was 123.1MB in the beginning and 121.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:48:50,407 INFO L158 Benchmark]: RCFGBuilder took 1188.68ms. Allocated memory is still 188.7MB. Free memory was 121.0MB in the beginning and 122.7MB in the end (delta: -1.7MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2023-11-06 22:48:50,408 INFO L158 Benchmark]: TraceAbstraction took 46560.40ms. Allocated memory was 188.7MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 121.6MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 389.2MB. Max. memory is 16.1GB. [2023-11-06 22:48:50,408 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 2.1GB. Free memory is still 1.6GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:48:50,414 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.29ms. Allocated memory is still 134.2MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 612.35ms. Allocated memory is still 188.7MB. Free memory was 148.2MB in the beginning and 125.0MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.12ms. Allocated memory is still 188.7MB. Free memory was 125.0MB in the beginning and 123.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.93ms. Allocated memory is still 188.7MB. Free memory was 123.1MB in the beginning and 121.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1188.68ms. Allocated memory is still 188.7MB. Free memory was 121.0MB in the beginning and 122.7MB in the end (delta: -1.7MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * TraceAbstraction took 46560.40ms. Allocated memory was 188.7MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 121.6MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 389.2MB. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 2.1GB. Free memory is still 1.6GB. 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: 12.9s, 170 PlacesBefore, 68 PlacesAfterwards, 163 TransitionsBefore, 60 TransitionsAfterwards, 5074 CoEnabledTransitionPairs, 8 FixpointIterations, 63 TrivialSequentialCompositions, 82 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 156 TotalNumberOfCompositions, 21033 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8093, independent: 7610, independent conditional: 0, independent unconditional: 7610, dependent: 483, dependent conditional: 0, dependent unconditional: 483, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2595, independent: 2513, independent conditional: 0, independent unconditional: 2513, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8093, independent: 5097, independent conditional: 0, independent unconditional: 5097, dependent: 401, dependent conditional: 0, dependent unconditional: 401, unknown: 2595, unknown conditional: 0, unknown unconditional: 2595] , Statistics on independence cache: Total cache size (in pairs): 406, Positive cache size: 363, Positive conditional cache size: 0, Positive unconditional cache size: 363, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L834] 0 pthread_t t2109; [L835] FCALL, FORK 0 pthread_create(&t2109, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2109, ((void *)0), P0, ((void *)0))=1, t2109={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 \read(y) [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L836] 0 pthread_t t2110; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2109={5:0}, t2110={7:0}, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L837] FCALL, FORK 0 pthread_create(&t2110, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2110, ((void *)0), P1, ((void *)0))=2, t2109={5:0}, t2110={7:0}, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L838] 0 pthread_t t2111; [L839] FCALL, FORK 0 pthread_create(&t2111, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2111, ((void *)0), P2, ((void *)0))=3, t2109={5:0}, t2110={7:0}, t2111={6:0}, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L806] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 \read(y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L848] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L849] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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, t2109={5:0}, t2110={7:0}, t2111={6:0}, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L852] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L853] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L853] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe014_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: -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: -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: -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: 832]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 835]: 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: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 207 locations, 53 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: 46.2s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2259 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1726 mSDsluCounter, 674 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 589 mSDsCounter, 300 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4813 IncrementalHoareTripleChecker+Invalid, 5113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 300 mSolverCounterUnsat, 85 mSDtfsCounter, 4813 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=896occurred in iteration=17, InterpolantAutomatonStates: 122, 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.6s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 322 NumberOfCodeBlocks, 322 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 2872 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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:48:50,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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 bb32390c6e08fa980f308e05dcc5f75aadd246c70ded8fbe4d875fa3ae4239fa --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:48:53,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:48:53,225 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:48:53,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:48:53,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:48:53,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:48:53,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:48:53,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:48:53,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:48:53,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:48:53,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:48:53,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:48:53,263 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:48:53,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:48:53,264 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:48:53,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:48:53,265 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:48:53,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:48:53,266 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:48:53,267 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:48:53,267 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:48:53,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:48:53,268 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:48:53,268 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:48:53,269 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:48:53,269 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:48:53,270 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:48:53,270 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:48:53,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:48:53,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:48:53,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:48:53,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:48:53,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:48:53,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:48:53,273 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:48:53,274 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:48:53,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:48:53,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:48:53,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:48:53,275 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:48:53,276 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:48:53,276 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_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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 -> bb32390c6e08fa980f308e05dcc5f75aadd246c70ded8fbe4d875fa3ae4239fa [2023-11-06 22:48:53,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:48:53,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:48:53,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:48:53,701 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:48:53,701 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:48:53,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i [2023-11-06 22:48:56,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:48:57,209 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:48:57,211 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i [2023-11-06 22:48:57,231 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/data/acf4bdfd9/cd2226c8b17349b2b5212cc83c7da2f6/FLAG5c0eff008 [2023-11-06 22:48:57,251 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/data/acf4bdfd9/cd2226c8b17349b2b5212cc83c7da2f6 [2023-11-06 22:48:57,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:48:57,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:48:57,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:48:57,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:48:57,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:48:57,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:57" (1/1) ... [2023-11-06 22:48:57,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53bd749e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:57, skipping insertion in model container [2023-11-06 22:48:57,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:57" (1/1) ... [2023-11-06 22:48:57,361 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:48:57,943 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:48:57,969 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:48:58,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:48:58,132 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:48:58,132 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:48:58,139 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:48:58,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:58 WrapperNode [2023-11-06 22:48:58,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:48:58,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:48:58,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:48:58,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:48:58,150 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:48:58" (1/1) ... [2023-11-06 22:48:58,173 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:48:58" (1/1) ... [2023-11-06 22:48:58,202 INFO L138 Inliner]: procedures = 180, calls = 68, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-11-06 22:48:58,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:48:58,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:48:58,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:48:58,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:48:58,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:58" (1/1) ... [2023-11-06 22:48:58,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:58" (1/1) ... [2023-11-06 22:48:58,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:58" (1/1) ... [2023-11-06 22:48:58,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:58" (1/1) ... [2023-11-06 22:48:58,238 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:58" (1/1) ... [2023-11-06 22:48:58,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:58" (1/1) ... [2023-11-06 22:48:58,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:58" (1/1) ... [2023-11-06 22:48:58,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:58" (1/1) ... [2023-11-06 22:48:58,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:48:58,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:48:58,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:48:58,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:48:58,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:58" (1/1) ... [2023-11-06 22:48:58,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:48:58,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:48:58,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:48:58,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:48:58,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:48:58,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:48:58,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:48:58,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:48:58,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:48:58,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:48:58,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:48:58,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:48:58,366 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:48:58,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:48:58,367 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:48:58,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:48:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:48:58,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:48:58,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:48:58,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:48:58,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:48:58,372 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:48:58,621 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:48:58,623 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:48:59,226 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:48:59,671 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:48:59,672 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:48:59,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:59 BoogieIcfgContainer [2023-11-06 22:48:59,675 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:48:59,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:48:59,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:48:59,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:48:59,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:48:57" (1/3) ... [2023-11-06 22:48:59,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c5e084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:59, skipping insertion in model container [2023-11-06 22:48:59,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:58" (2/3) ... [2023-11-06 22:48:59,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c5e084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:59, skipping insertion in model container [2023-11-06 22:48:59,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:59" (3/3) ... [2023-11-06 22:48:59,688 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_rmo.oepc.i [2023-11-06 22:48:59,708 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:48:59,708 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-11-06 22:48:59,708 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:48:59,880 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:48:59,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 167 transitions, 346 flow [2023-11-06 22:49:00,005 INFO L124 PetriNetUnfolderBase]: 3/164 cut-off events. [2023-11-06 22:49:00,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:49:00,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 164 events. 3/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 197 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-06 22:49:00,014 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 167 transitions, 346 flow [2023-11-06 22:49:00,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 164 transitions, 337 flow [2023-11-06 22:49:00,024 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:49:00,034 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 164 transitions, 337 flow [2023-11-06 22:49:00,037 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 164 transitions, 337 flow [2023-11-06 22:49:00,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 164 transitions, 337 flow [2023-11-06 22:49:00,108 INFO L124 PetriNetUnfolderBase]: 3/164 cut-off events. [2023-11-06 22:49:00,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:49:00,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 164 events. 3/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 195 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-06 22:49:00,115 INFO L119 LiptonReduction]: Number of co-enabled transitions 5074 [2023-11-06 22:49:23,607 INFO L134 LiptonReduction]: Checked pairs total: 19017 [2023-11-06 22:49:23,608 INFO L136 LiptonReduction]: Total number of compositions: 163 [2023-11-06 22:49:23,625 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:49:23,632 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;@70fc8073, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:49:23,633 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-11-06 22:49:23,636 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:49:23,636 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:49:23,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:49:23,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:23,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:49:23,638 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:49:23,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:23,644 INFO L85 PathProgramCache]: Analyzing trace with hash 831, now seen corresponding path program 1 times [2023-11-06 22:49:23,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:49:23,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207388938] [2023-11-06 22:49:23,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:23,659 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:49:23,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:49:23,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:23,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:23,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:49:23,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:23,792 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:49:23,792 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:49:23,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:49:23,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207388938] [2023-11-06 22:49:23,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207388938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:23,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:23,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:49:23,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754246896] [2023-11-06 22:49:23,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:23,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:49:23,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:49:23,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:49:23,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:49:23,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 330 [2023-11-06 22:49:23,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 129 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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:49:23,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:49:23,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 330 [2023-11-06 22:49:23,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:49:25,422 INFO L124 PetriNetUnfolderBase]: 4692/6844 cut-off events. [2023-11-06 22:49:25,422 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-06 22:49:25,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13654 conditions, 6844 events. 4692/6844 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 42124 event pairs, 4692 based on Foata normal form. 0/3700 useless extension candidates. Maximal degree in co-relation 13643. Up to 6764 conditions per place. [2023-11-06 22:49:25,505 INFO L140 encePairwiseOnDemand]: 312/330 looper letters, 35 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2023-11-06 22:49:25,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 159 flow [2023-11-06 22:49:25,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:49:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:49:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 321 transitions. [2023-11-06 22:49:25,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4863636363636364 [2023-11-06 22:49:25,523 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 321 transitions. [2023-11-06 22:49:25,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 321 transitions. [2023-11-06 22:49:25,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:25,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 321 transitions. [2023-11-06 22:49:25,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:49:25,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 0 states have call successors, (0), 0 states 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:49:25,544 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 0 states have call successors, (0), 0 states 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:49:25,547 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 129 flow. Second operand 2 states and 321 transitions. [2023-11-06 22:49:25,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 159 flow [2023-11-06 22:49:25,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:49:25,554 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2023-11-06 22:49:25,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-11-06 22:49:25,561 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -20 predicate places. [2023-11-06 22:49:25,561 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2023-11-06 22:49:25,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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:49:25,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:25,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:49:25,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:25,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:25,775 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:49:25,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash 818035, now seen corresponding path program 1 times [2023-11-06 22:49:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:49:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811140988] [2023-11-06 22:49:25,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:25,778 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:49:25,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:49:25,779 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:25,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:25,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:49:25,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:26,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:26,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:49:26,099 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:49:26,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:49:26,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:49:26,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811140988] [2023-11-06 22:49:26,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811140988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:26,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:26,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:49:26,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205699164] [2023-11-06 22:49:26,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:26,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:49:26,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:49:26,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:49:26,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:26,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 330 [2023-11-06 22:49:26,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states 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:49:26,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:49:26,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 330 [2023-11-06 22:49:26,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:49:26,982 INFO L124 PetriNetUnfolderBase]: 2078/3116 cut-off events. [2023-11-06 22:49:26,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:49:26,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6204 conditions, 3116 events. 2078/3116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 17441 event pairs, 2078 based on Foata normal form. 0/2064 useless extension candidates. Maximal degree in co-relation 6201. Up to 3051 conditions per place. [2023-11-06 22:49:27,014 INFO L140 encePairwiseOnDemand]: 323/330 looper letters, 28 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-11-06 22:49:27,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 132 flow [2023-11-06 22:49:27,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:49:27,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:49:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-11-06 22:49:27,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4383838383838384 [2023-11-06 22:49:27,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-11-06 22:49:27,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-11-06 22:49:27,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:27,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-11-06 22:49:27,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states 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:49:27,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states 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:49:27,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states 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:49:27,030 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 434 transitions. [2023-11-06 22:49:27,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 132 flow [2023-11-06 22:49:27,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 132 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:49:27,032 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-11-06 22:49:27,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-11-06 22:49:27,034 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -24 predicate places. [2023-11-06 22:49:27,034 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-11-06 22:49:27,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states 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:49:27,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:27,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:49:27,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:27,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:27,247 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:49:27,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:27,248 INFO L85 PathProgramCache]: Analyzing trace with hash 818034, now seen corresponding path program 1 times [2023-11-06 22:49:27,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:49:27,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501390052] [2023-11-06 22:49:27,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:27,250 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:49:27,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:49:27,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:27,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:49:27,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:27,405 INFO L322 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-06 22:49:27,406 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-06 22:49:27,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:49:27,431 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:49:27,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:49:27,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501390052] [2023-11-06 22:49:27,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501390052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:27,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:27,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:49:27,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007196636] [2023-11-06 22:49:27,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:27,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:49:27,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:49:27,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:49:27,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:27,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 330 [2023-11-06 22:49:27,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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:49:27,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:49:27,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 330 [2023-11-06 22:49:27,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:49:28,005 INFO L124 PetriNetUnfolderBase]: 1236/1883 cut-off events. [2023-11-06 22:49:28,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:49:28,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3766 conditions, 1883 events. 1236/1883 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 9525 event pairs, 700 based on Foata normal form. 63/1561 useless extension candidates. Maximal degree in co-relation 3762. Up to 1053 conditions per place. [2023-11-06 22:49:28,021 INFO L140 encePairwiseOnDemand]: 322/330 looper letters, 33 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-11-06 22:49:28,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 156 flow [2023-11-06 22:49:28,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:49:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:49:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-11-06 22:49:28,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4353535353535353 [2023-11-06 22:49:28,024 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-11-06 22:49:28,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-11-06 22:49:28,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:28,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-11-06 22:49:28,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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:49:28,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states 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:49:28,031 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states 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:49:28,031 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 431 transitions. [2023-11-06 22:49:28,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 156 flow [2023-11-06 22:49:28,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 155 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:49:28,033 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 85 flow [2023-11-06 22:49:28,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-11-06 22:49:28,034 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -24 predicate places. [2023-11-06 22:49:28,034 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 85 flow [2023-11-06 22:49:28,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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:49:28,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:28,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:28,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:28,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:28,247 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:49:28,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:28,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1835609514, now seen corresponding path program 1 times [2023-11-06 22:49:28,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:49:28,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180610511] [2023-11-06 22:49:28,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:28,248 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:49:28,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:49:28,250 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:28,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:28,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:49:28,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:28,450 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:49:28,450 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:49:28,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:49:28,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180610511] [2023-11-06 22:49:28,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180610511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:28,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:28,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:49:28,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184995448] [2023-11-06 22:49:28,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:28,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:49:28,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:49:28,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:49:28,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:49:28,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 330 [2023-11-06 22:49:28,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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:49:28,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:49:28,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 330 [2023-11-06 22:49:28,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:49:28,916 INFO L124 PetriNetUnfolderBase]: 627/1059 cut-off events. [2023-11-06 22:49:28,916 INFO L125 PetriNetUnfolderBase]: For 48/60 co-relation queries the response was YES. [2023-11-06 22:49:28,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2272 conditions, 1059 events. 627/1059 cut-off events. For 48/60 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5380 event pairs, 188 based on Foata normal form. 36/951 useless extension candidates. Maximal degree in co-relation 2267. Up to 908 conditions per place. [2023-11-06 22:49:28,932 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 35 selfloop transitions, 4 changer transitions 15/59 dead transitions. [2023-11-06 22:49:28,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 251 flow [2023-11-06 22:49:28,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:49:28,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:49:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 696 transitions. [2023-11-06 22:49:28,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4218181818181818 [2023-11-06 22:49:28,941 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 696 transitions. [2023-11-06 22:49:28,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 696 transitions. [2023-11-06 22:49:28,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:28,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 696 transitions. [2023-11-06 22:49:28,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.2) internal successors, (696), 5 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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:49:28,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 330.0) internal successors, (1980), 6 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states 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:49:28,958 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 330.0) internal successors, (1980), 6 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states 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:49:28,958 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 85 flow. Second operand 5 states and 696 transitions. [2023-11-06 22:49:28,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 251 flow [2023-11-06 22:49:28,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:49:28,964 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 117 flow [2023-11-06 22:49:28,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2023-11-06 22:49:28,966 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -19 predicate places. [2023-11-06 22:49:28,967 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 117 flow [2023-11-06 22:49:28,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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:49:28,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:28,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:28,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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)] Ended with exit code 0 [2023-11-06 22:49:29,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:29,179 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:49:29,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1822718414, now seen corresponding path program 1 times [2023-11-06 22:49:29,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:49:29,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697270380] [2023-11-06 22:49:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:29,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:49:29,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:49:29,181 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:29,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:49:29,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:29,382 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:49:29,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:49:29,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:49:29,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697270380] [2023-11-06 22:49:29,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697270380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:29,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:29,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:49:29,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914663982] [2023-11-06 22:49:29,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:29,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:49:29,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:49:29,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:49:29,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:49:29,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 330 [2023-11-06 22:49:29,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states 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:49:29,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:49:29,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 330 [2023-11-06 22:49:29,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:49:29,760 INFO L124 PetriNetUnfolderBase]: 180/372 cut-off events. [2023-11-06 22:49:29,760 INFO L125 PetriNetUnfolderBase]: For 171/173 co-relation queries the response was YES. [2023-11-06 22:49:29,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 372 events. 180/372 cut-off events. For 171/173 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1524 event pairs, 39 based on Foata normal form. 24/354 useless extension candidates. Maximal degree in co-relation 1011. Up to 199 conditions per place. [2023-11-06 22:49:29,764 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 41 selfloop transitions, 7 changer transitions 15/68 dead transitions. [2023-11-06 22:49:29,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 353 flow [2023-11-06 22:49:29,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:49:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:49:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 833 transitions. [2023-11-06 22:49:29,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4207070707070707 [2023-11-06 22:49:29,769 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 833 transitions. [2023-11-06 22:49:29,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 833 transitions. [2023-11-06 22:49:29,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:29,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 833 transitions. [2023-11-06 22:49:29,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.83333333333334) internal successors, (833), 6 states have internal predecessors, (833), 0 states have call successors, (0), 0 states 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:49:29,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 330.0) internal successors, (2310), 7 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states 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:49:29,780 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 330.0) internal successors, (2310), 7 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states 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:49:29,780 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 117 flow. Second operand 6 states and 833 transitions. [2023-11-06 22:49:29,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 353 flow [2023-11-06 22:49:29,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 347 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:49:29,784 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 167 flow [2023-11-06 22:49:29,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-11-06 22:49:29,786 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -15 predicate places. [2023-11-06 22:49:29,786 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 167 flow [2023-11-06 22:49:29,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states 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:49:29,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:29,787 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:49:29,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:30,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:30,000 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:49:30,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:30,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1911435647, now seen corresponding path program 1 times [2023-11-06 22:49:30,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:49:30,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780076227] [2023-11-06 22:49:30,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:30,001 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:49:30,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:49:30,003 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:30,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:49:30,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:30,261 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:49:30,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:49:30,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:49:30,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780076227] [2023-11-06 22:49:30,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780076227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:30,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:30,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:49:30,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350725620] [2023-11-06 22:49:30,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:30,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:49:30,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:49:30,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:49:30,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:49:30,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 330 [2023-11-06 22:49:30,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states 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:49:30,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:49:30,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 330 [2023-11-06 22:49:30,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:49:30,723 INFO L124 PetriNetUnfolderBase]: 76/169 cut-off events. [2023-11-06 22:49:30,724 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2023-11-06 22:49:30,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 169 events. 76/169 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 512 event pairs, 20 based on Foata normal form. 8/170 useless extension candidates. Maximal degree in co-relation 526. Up to 60 conditions per place. [2023-11-06 22:49:30,726 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 34 selfloop transitions, 10 changer transitions 9/57 dead transitions. [2023-11-06 22:49:30,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 337 flow [2023-11-06 22:49:30,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:49:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:49:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 951 transitions. [2023-11-06 22:49:30,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4116883116883117 [2023-11-06 22:49:30,731 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 951 transitions. [2023-11-06 22:49:30,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 951 transitions. [2023-11-06 22:49:30,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:30,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 951 transitions. [2023-11-06 22:49:30,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.85714285714286) internal successors, (951), 7 states have internal predecessors, (951), 0 states have call successors, (0), 0 states 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:49:30,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states 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:49:30,746 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states 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:49:30,746 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 167 flow. Second operand 7 states and 951 transitions. [2023-11-06 22:49:30,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 337 flow [2023-11-06 22:49:30,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 299 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-11-06 22:49:30,754 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 149 flow [2023-11-06 22:49:30,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-11-06 22:49:30,758 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -17 predicate places. [2023-11-06 22:49:30,758 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 149 flow [2023-11-06 22:49:30,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states 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:49:30,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:30,760 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:49:30,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:30,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:30,973 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:49:30,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:30,974 INFO L85 PathProgramCache]: Analyzing trace with hash -438425570, now seen corresponding path program 1 times [2023-11-06 22:49:30,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:49:30,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917412908] [2023-11-06 22:49:30,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:30,974 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:49:30,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:49:30,976 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:30,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:31,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:49:31,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:31,221 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:49:31,221 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:49:31,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:49:31,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917412908] [2023-11-06 22:49:31,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917412908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:31,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:31,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:49:31,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072574646] [2023-11-06 22:49:31,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:31,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:49:31,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:49:31,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:49:31,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:49:31,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 330 [2023-11-06 22:49:31,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states 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:49:31,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:49:31,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 330 [2023-11-06 22:49:31,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:49:31,549 INFO L124 PetriNetUnfolderBase]: 124/268 cut-off events. [2023-11-06 22:49:31,549 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2023-11-06 22:49:31,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 268 events. 124/268 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1072 event pairs, 59 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 797. Up to 144 conditions per place. [2023-11-06 22:49:31,552 INFO L140 encePairwiseOnDemand]: 326/330 looper letters, 61 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2023-11-06 22:49:31,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 467 flow [2023-11-06 22:49:31,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:49:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:49:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 695 transitions. [2023-11-06 22:49:31,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2023-11-06 22:49:31,556 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 695 transitions. [2023-11-06 22:49:31,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 695 transitions. [2023-11-06 22:49:31,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:31,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 695 transitions. [2023-11-06 22:49:31,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 0 states have call successors, (0), 0 states 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:49:31,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 330.0) internal successors, (1980), 6 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states 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:49:31,563 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 330.0) internal successors, (1980), 6 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states 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:49:31,564 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 149 flow. Second operand 5 states and 695 transitions. [2023-11-06 22:49:31,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 467 flow [2023-11-06 22:49:31,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 381 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-11-06 22:49:31,567 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 131 flow [2023-11-06 22:49:31,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-11-06 22:49:31,568 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -20 predicate places. [2023-11-06 22:49:31,569 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 131 flow [2023-11-06 22:49:31,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states 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:49:31,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:31,569 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:49:31,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:31,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:31,782 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-06 22:49:31,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:31,783 INFO L85 PathProgramCache]: Analyzing trace with hash 707237510, now seen corresponding path program 2 times [2023-11-06 22:49:31,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:49:31,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970526702] [2023-11-06 22:49:31,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:49:31,785 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:49:31,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:49:31,787 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:31,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:32,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:49:32,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:49:32,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:32,291 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:49:32,292 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:49:32,293 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2023-11-06 22:49:32,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2023-11-06 22:49:32,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2023-11-06 22:49:32,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2023-11-06 22:49:32,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2023-11-06 22:49:32,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2023-11-06 22:49:32,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2023-11-06 22:49:32,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2023-11-06 22:49:32,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2023-11-06 22:49:32,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2023-11-06 22:49:32,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2023-11-06 22:49:32,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2023-11-06 22:49:32,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2023-11-06 22:49:32,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2023-11-06 22:49:32,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2023-11-06 22:49:32,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2023-11-06 22:49:32,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2023-11-06 22:49:32,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2023-11-06 22:49:32,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2023-11-06 22:49:32,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2023-11-06 22:49:32,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2023-11-06 22:49:32,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2023-11-06 22:49:32,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2023-11-06 22:49:32,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2023-11-06 22:49:32,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2023-11-06 22:49:32,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2023-11-06 22:49:32,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2023-11-06 22:49:32,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2023-11-06 22:49:32,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2023-11-06 22:49:32,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2023-11-06 22:49:32,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2023-11-06 22:49:32,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2023-11-06 22:49:32,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2023-11-06 22:49:32,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2023-11-06 22:49:32,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2023-11-06 22:49:32,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2023-11-06 22:49:32,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2023-11-06 22:49:32,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2023-11-06 22:49:32,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2023-11-06 22:49:32,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2023-11-06 22:49:32,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2023-11-06 22:49:32,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2023-11-06 22:49:32,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2023-11-06 22:49:32,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2023-11-06 22:49:32,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2023-11-06 22:49:32,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2023-11-06 22:49:32,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2023-11-06 22:49:32,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2023-11-06 22:49:32,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2023-11-06 22:49:32,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2023-11-06 22:49:32,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2023-11-06 22:49:32,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2023-11-06 22:49:32,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2023-11-06 22:49:32,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:32,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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:49:32,524 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:32,530 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:49:32,530 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:49:32,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:49:32 BasicIcfg [2023-11-06 22:49:32,645 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:49:32,645 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:49:32,645 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:49:32,646 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:49:32,646 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:59" (3/4) ... [2023-11-06 22:49:32,648 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:49:32,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:49:32,651 INFO L158 Benchmark]: Toolchain (without parser) took 35387.52ms. Allocated memory was 62.9MB in the beginning and 373.3MB in the end (delta: 310.4MB). Free memory was 37.6MB in the beginning and 216.5MB in the end (delta: -178.9MB). Peak memory consumption was 134.3MB. Max. memory is 16.1GB. [2023-11-06 22:49:32,651 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 62.9MB. Free memory was 38.6MB in the beginning and 38.5MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:49:32,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 873.70ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 37.4MB in the beginning and 46.3MB in the end (delta: -8.9MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2023-11-06 22:49:32,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.06ms. Allocated memory is still 81.8MB. Free memory was 46.3MB in the beginning and 43.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:49:32,653 INFO L158 Benchmark]: Boogie Preprocessor took 49.38ms. Allocated memory is still 81.8MB. Free memory was 43.9MB in the beginning and 41.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:49:32,654 INFO L158 Benchmark]: RCFGBuilder took 1421.96ms. Allocated memory is still 81.8MB. Free memory was 41.5MB in the beginning and 40.8MB in the end (delta: 755.4kB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2023-11-06 22:49:32,654 INFO L158 Benchmark]: TraceAbstraction took 32966.41ms. Allocated memory was 81.8MB in the beginning and 373.3MB in the end (delta: 291.5MB). Free memory was 40.1MB in the beginning and 216.5MB in the end (delta: -176.4MB). Peak memory consumption was 116.2MB. Max. memory is 16.1GB. [2023-11-06 22:49:32,654 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 373.3MB. Free memory is still 216.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:49:32,657 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.31ms. Allocated memory is still 62.9MB. Free memory was 38.6MB in the beginning and 38.5MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 873.70ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 37.4MB in the beginning and 46.3MB in the end (delta: -8.9MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.06ms. Allocated memory is still 81.8MB. Free memory was 46.3MB in the beginning and 43.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.38ms. Allocated memory is still 81.8MB. Free memory was 43.9MB in the beginning and 41.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1421.96ms. Allocated memory is still 81.8MB. Free memory was 41.5MB in the beginning and 40.8MB in the end (delta: 755.4kB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * TraceAbstraction took 32966.41ms. Allocated memory was 81.8MB in the beginning and 373.3MB in the end (delta: 291.5MB). Free memory was 40.1MB in the beginning and 216.5MB in the end (delta: -176.4MB). Peak memory consumption was 116.2MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 373.3MB. Free memory is still 216.5MB. 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: 23.6s, 171 PlacesBefore, 68 PlacesAfterwards, 164 TransitionsBefore, 60 TransitionsAfterwards, 5074 CoEnabledTransitionPairs, 7 FixpointIterations, 70 TrivialSequentialCompositions, 82 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 163 TotalNumberOfCompositions, 19017 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7723, independent: 7304, independent conditional: 0, independent unconditional: 7304, dependent: 419, dependent conditional: 0, dependent unconditional: 419, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2575, independent: 2498, independent conditional: 0, independent unconditional: 2498, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7723, independent: 4806, independent conditional: 0, independent unconditional: 4806, dependent: 342, dependent conditional: 0, dependent unconditional: 342, unknown: 2575, unknown conditional: 0, unknown unconditional: 2575] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 350, Positive conditional cache size: 0, Positive unconditional cache size: 350, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L834] 0 pthread_t t2109; [L835] FCALL, FORK 0 pthread_create(&t2109, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2109, ((void *)0), P0, ((void *)0))=0, t2109={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 \read(y) [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L836] 0 pthread_t t2110; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2109={7:0}, t2110={14:0}, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L837] FCALL, FORK 0 pthread_create(&t2110, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2110, ((void *)0), P1, ((void *)0))=1, t2109={7:0}, t2110={14:0}, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L838] 0 pthread_t t2111; [L839] FCALL, FORK 0 pthread_create(&t2111, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2111, ((void *)0), P2, ((void *)0))=2, t2109={7:0}, t2110={14:0}, t2111={15:0}, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L806] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 \read(y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L848] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L849] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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, t2109={7:0}, t2110={14:0}, t2111={15:0}, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L852] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L853] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L853] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe014_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=2, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: -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: -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: -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: 832]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 835]: 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: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 208 locations, 53 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: 32.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 23.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 839 IncrementalHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 10 mSDtfsCounter, 839 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=5, InterpolantAutomatonStates: 31, 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.5s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 205 SizeOfPredicates, 9 NumberOfNonLiveVariables, 798 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:49:32,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c32037d-f873-44dd-a4ac-7cc8ca9b4233/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