./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018_tso.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_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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_14ac4c96-f843-4613-b7d4-09a068e6641d/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 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:16:19,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:16:19,743 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:16:19,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:16:19,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:16:19,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:16:19,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:16:19,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:16:19,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:16:19,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:16:19,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:16:19,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:16:19,779 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:16:19,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:16:19,781 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:16:19,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:16:19,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:16:19,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:16:19,782 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:16:19,783 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:16:19,783 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:16:19,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:16:19,784 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:16:19,785 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:16:19,785 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:16:19,786 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:16:19,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:16:19,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:16:19,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:16:19,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:16:19,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:16:19,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:16:19,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:16:19,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:16:19,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:16:19,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:16:19,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:16:19,790 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:16:19,790 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_14ac4c96-f843-4613-b7d4-09a068e6641d/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_14ac4c96-f843-4613-b7d4-09a068e6641d/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 -> 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf [2023-11-06 22:16:20,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:16:20,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:16:20,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:16:20,054 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:16:20,054 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:16:20,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2023-11-06 22:16:23,370 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:16:23,846 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:16:23,847 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2023-11-06 22:16:23,867 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/data/7b1a9bbdd/c14d4eecf7ee4c0f893f75d033f1acff/FLAG35fe014f0 [2023-11-06 22:16:23,883 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/data/7b1a9bbdd/c14d4eecf7ee4c0f893f75d033f1acff [2023-11-06 22:16:23,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:16:23,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:16:23,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:16:23,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:16:23,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:16:23,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:16:23" (1/1) ... [2023-11-06 22:16:23,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284e74a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:23, skipping insertion in model container [2023-11-06 22:16:23,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:16:23" (1/1) ... [2023-11-06 22:16:23,953 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:16:24,572 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:16:24,590 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:16:24,709 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:16:24,766 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:16:24,767 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:16:24,774 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:16:24,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:24 WrapperNode [2023-11-06 22:16:24,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:16:24,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:16:24,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:16:24,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:16:24,785 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:16:24" (1/1) ... [2023-11-06 22:16:24,827 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:16:24" (1/1) ... [2023-11-06 22:16:24,881 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 167 [2023-11-06 22:16:24,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:16:24,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:16:24,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:16:24,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:16:24,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:24" (1/1) ... [2023-11-06 22:16:24,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:24" (1/1) ... [2023-11-06 22:16:24,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:24" (1/1) ... [2023-11-06 22:16:24,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:24" (1/1) ... [2023-11-06 22:16:24,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:24" (1/1) ... [2023-11-06 22:16:24,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:24" (1/1) ... [2023-11-06 22:16:24,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:24" (1/1) ... [2023-11-06 22:16:24,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:24" (1/1) ... [2023-11-06 22:16:24,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:16:24,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:16:24,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:16:24,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:16:24,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:24" (1/1) ... [2023-11-06 22:16:24,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:16:24,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:16:25,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:16:25,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:16:25,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:16:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:16:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:16:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:16:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:16:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:16:25,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:16:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:16:25,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:16:25,047 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:16:25,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:16:25,047 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:16:25,048 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:16:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:16:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:16:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:16:25,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:16:25,052 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:16:25,225 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:16:25,228 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:16:25,688 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:16:26,015 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:16:26,015 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:16:26,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:16:26 BoogieIcfgContainer [2023-11-06 22:16:26,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:16:26,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:16:26,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:16:26,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:16:26,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:16:23" (1/3) ... [2023-11-06 22:16:26,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4e03cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:16:26, skipping insertion in model container [2023-11-06 22:16:26,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:24" (2/3) ... [2023-11-06 22:16:26,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4e03cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:16:26, skipping insertion in model container [2023-11-06 22:16:26,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:16:26" (3/3) ... [2023-11-06 22:16:26,039 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2023-11-06 22:16:26,063 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:16:26,064 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:16:26,064 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:16:26,164 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:16:26,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 151 transitions, 318 flow [2023-11-06 22:16:26,363 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-06 22:16:26,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:16:26,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 120 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-06 22:16:26,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 151 transitions, 318 flow [2023-11-06 22:16:26,390 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 147 transitions, 306 flow [2023-11-06 22:16:26,395 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:16:26,418 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-06 22:16:26,424 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-06 22:16:26,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 147 transitions, 306 flow [2023-11-06 22:16:26,524 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-06 22:16:26,528 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:16:26,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 121 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-06 22:16:26,539 INFO L119 LiptonReduction]: Number of co-enabled transitions 4046 [2023-11-06 22:16:34,873 INFO L134 LiptonReduction]: Checked pairs total: 12285 [2023-11-06 22:16:34,873 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-11-06 22:16:34,901 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:16:34,911 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;@108ff351, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:16:34,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:16:34,913 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:16:34,913 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:16:34,914 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:16:34,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:34,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:16:34,915 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:34,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash 650, now seen corresponding path program 1 times [2023-11-06 22:16:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:34,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353900042] [2023-11-06 22:16:34,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:34,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:35,054 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:16:35,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:35,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353900042] [2023-11-06 22:16:35,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353900042] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:35,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:35,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:16:35,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96933524] [2023-11-06 22:16:35,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:35,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:16:35,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:35,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:16:35,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:16:35,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 290 [2023-11-06 22:16:35,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:35,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:35,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 290 [2023-11-06 22:16:35,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:37,440 INFO L124 PetriNetUnfolderBase]: 7925/10854 cut-off events. [2023-11-06 22:16:37,441 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-06 22:16:37,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21764 conditions, 10854 events. 7925/10854 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 57916 event pairs, 7925 based on Foata normal form. 320/9402 useless extension candidates. Maximal degree in co-relation 21752. Up to 10695 conditions per place. [2023-11-06 22:16:37,559 INFO L140 encePairwiseOnDemand]: 281/290 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-11-06 22:16:37,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2023-11-06 22:16:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:16:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:16:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2023-11-06 22:16:37,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5293103448275862 [2023-11-06 22:16:37,587 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2023-11-06 22:16:37,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2023-11-06 22:16:37,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:37,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2023-11-06 22:16:37,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:37,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:37,612 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:37,615 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 307 transitions. [2023-11-06 22:16:37,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2023-11-06 22:16:37,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:16:37,627 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-11-06 22:16:37,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-06 22:16:37,636 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-11-06 22:16:37,636 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-11-06 22:16:37,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:37,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:37,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:16:37,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:16:37,638 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:37,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:37,651 INFO L85 PathProgramCache]: Analyzing trace with hash 617089746, now seen corresponding path program 1 times [2023-11-06 22:16:37,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:37,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309857833] [2023-11-06 22:16:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:37,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:38,150 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:16:38,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:38,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309857833] [2023-11-06 22:16:38,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309857833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:38,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:38,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:16:38,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774148318] [2023-11-06 22:16:38,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:38,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:16:38,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:38,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:16:38,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:16:38,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 290 [2023-11-06 22:16:38,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:38,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:38,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 290 [2023-11-06 22:16:38,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:39,919 INFO L124 PetriNetUnfolderBase]: 6231/9034 cut-off events. [2023-11-06 22:16:39,919 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:16:39,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17655 conditions, 9034 events. 6231/9034 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 55151 event pairs, 1149 based on Foata normal form. 0/8185 useless extension candidates. Maximal degree in co-relation 17652. Up to 6739 conditions per place. [2023-11-06 22:16:40,023 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 41 selfloop transitions, 2 changer transitions 4/52 dead transitions. [2023-11-06 22:16:40,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 210 flow [2023-11-06 22:16:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:16:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:16:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-11-06 22:16:40,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2023-11-06 22:16:40,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-11-06 22:16:40,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-11-06 22:16:40,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:40,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-11-06 22:16:40,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:40,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:40,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:40,045 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 450 transitions. [2023-11-06 22:16:40,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 210 flow [2023-11-06 22:16:40,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:16:40,050 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 72 flow [2023-11-06 22:16:40,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-11-06 22:16:40,053 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-11-06 22:16:40,053 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 72 flow [2023-11-06 22:16:40,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:40,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:40,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:40,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:16:40,063 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:40,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:40,064 INFO L85 PathProgramCache]: Analyzing trace with hash 995938044, now seen corresponding path program 1 times [2023-11-06 22:16:40,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:40,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917261028] [2023-11-06 22:16:40,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:40,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:40,968 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:16:40,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:40,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917261028] [2023-11-06 22:16:40,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917261028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:40,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:40,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:16:40,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606969018] [2023-11-06 22:16:40,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:40,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:16:40,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:40,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:16:40,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:16:41,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 290 [2023-11-06 22:16:41,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:41,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:41,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 290 [2023-11-06 22:16:41,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:43,927 INFO L124 PetriNetUnfolderBase]: 11969/16020 cut-off events. [2023-11-06 22:16:43,927 INFO L125 PetriNetUnfolderBase]: For 805/805 co-relation queries the response was YES. [2023-11-06 22:16:43,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33101 conditions, 16020 events. 11969/16020 cut-off events. For 805/805 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 78232 event pairs, 3219 based on Foata normal form. 0/15619 useless extension candidates. Maximal degree in co-relation 33097. Up to 10241 conditions per place. [2023-11-06 22:16:44,089 INFO L140 encePairwiseOnDemand]: 285/290 looper letters, 66 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2023-11-06 22:16:44,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 308 flow [2023-11-06 22:16:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:16:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:16:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-11-06 22:16:44,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4613793103448276 [2023-11-06 22:16:44,095 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-11-06 22:16:44,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-11-06 22:16:44,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:44,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-11-06 22:16:44,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:44,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:44,107 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:44,108 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 72 flow. Second operand 5 states and 669 transitions. [2023-11-06 22:16:44,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 308 flow [2023-11-06 22:16:44,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:16:44,114 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 105 flow [2023-11-06 22:16:44,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-11-06 22:16:44,116 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2023-11-06 22:16:44,116 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 105 flow [2023-11-06 22:16:44,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:44,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:44,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:44,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:16:44,123 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:44,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:44,125 INFO L85 PathProgramCache]: Analyzing trace with hash 995938060, now seen corresponding path program 1 times [2023-11-06 22:16:44,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:44,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437022017] [2023-11-06 22:16:44,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:44,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:45,353 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:16:45,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:45,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437022017] [2023-11-06 22:16:45,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437022017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:45,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:45,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:16:45,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210962406] [2023-11-06 22:16:45,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:45,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:16:45,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:45,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:16:45,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:16:45,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 290 [2023-11-06 22:16:45,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 105 flow. Second operand has 7 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:45,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:45,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 290 [2023-11-06 22:16:45,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:47,565 INFO L124 PetriNetUnfolderBase]: 4855/6963 cut-off events. [2023-11-06 22:16:47,566 INFO L125 PetriNetUnfolderBase]: For 960/960 co-relation queries the response was YES. [2023-11-06 22:16:47,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15173 conditions, 6963 events. 4855/6963 cut-off events. For 960/960 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 37973 event pairs, 456 based on Foata normal form. 512/7475 useless extension candidates. Maximal degree in co-relation 15166. Up to 4384 conditions per place. [2023-11-06 22:16:47,614 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 49 selfloop transitions, 5 changer transitions 2/60 dead transitions. [2023-11-06 22:16:47,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 260 flow [2023-11-06 22:16:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:16:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:16:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 869 transitions. [2023-11-06 22:16:47,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42807881773399015 [2023-11-06 22:16:47,620 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 869 transitions. [2023-11-06 22:16:47,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 869 transitions. [2023-11-06 22:16:47,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:47,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 869 transitions. [2023-11-06 22:16:47,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:47,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:47,634 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:47,634 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 105 flow. Second operand 7 states and 869 transitions. [2023-11-06 22:16:47,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 260 flow [2023-11-06 22:16:47,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:16:47,657 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 86 flow [2023-11-06 22:16:47,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=86, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2023-11-06 22:16:47,660 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2023-11-06 22:16:47,660 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 86 flow [2023-11-06 22:16:47,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:47,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:47,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:47,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:16:47,662 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:47,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:47,663 INFO L85 PathProgramCache]: Analyzing trace with hash 511923977, now seen corresponding path program 1 times [2023-11-06 22:16:47,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:47,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559359908] [2023-11-06 22:16:47,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:48,483 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:16:48,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:48,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559359908] [2023-11-06 22:16:48,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559359908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:48,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:48,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:16:48,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977352287] [2023-11-06 22:16:48,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:48,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:16:48,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:48,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:16:48,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:16:48,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2023-11-06 22:16:48,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 29 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:48,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:48,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2023-11-06 22:16:48,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:49,418 INFO L124 PetriNetUnfolderBase]: 3851/5465 cut-off events. [2023-11-06 22:16:49,418 INFO L125 PetriNetUnfolderBase]: For 1155/1155 co-relation queries the response was YES. [2023-11-06 22:16:49,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11660 conditions, 5465 events. 3851/5465 cut-off events. For 1155/1155 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 27837 event pairs, 1801 based on Foata normal form. 192/5638 useless extension candidates. Maximal degree in co-relation 11653. Up to 4711 conditions per place. [2023-11-06 22:16:49,459 INFO L140 encePairwiseOnDemand]: 283/290 looper letters, 34 selfloop transitions, 5 changer transitions 18/62 dead transitions. [2023-11-06 22:16:49,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 280 flow [2023-11-06 22:16:49,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:16:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:16:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 709 transitions. [2023-11-06 22:16:49,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4889655172413793 [2023-11-06 22:16:49,464 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 709 transitions. [2023-11-06 22:16:49,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 709 transitions. [2023-11-06 22:16:49,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:49,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 709 transitions. [2023-11-06 22:16:49,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:49,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:49,475 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:49,475 INFO L175 Difference]: Start difference. First operand has 51 places, 29 transitions, 86 flow. Second operand 5 states and 709 transitions. [2023-11-06 22:16:49,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 280 flow [2023-11-06 22:16:49,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 259 flow, removed 2 selfloop flow, removed 8 redundant places. [2023-11-06 22:16:49,497 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 116 flow [2023-11-06 22:16:49,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2023-11-06 22:16:49,498 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2023-11-06 22:16:49,498 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 116 flow [2023-11-06 22:16:49,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:49,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:49,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:49,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:16:49,500 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:49,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:49,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1309638995, now seen corresponding path program 1 times [2023-11-06 22:16:49,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:49,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591971096] [2023-11-06 22:16:49,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:49,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:50,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:50,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591971096] [2023-11-06 22:16:50,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591971096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:50,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:50,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:16:50,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902218404] [2023-11-06 22:16:50,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:50,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:16:50,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:50,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:16:50,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:16:50,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2023-11-06 22:16:50,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 132.33333333333334) internal successors, (794), 6 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:50,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:50,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2023-11-06 22:16:50,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:51,184 INFO L124 PetriNetUnfolderBase]: 3715/5214 cut-off events. [2023-11-06 22:16:51,184 INFO L125 PetriNetUnfolderBase]: For 3118/3202 co-relation queries the response was YES. [2023-11-06 22:16:51,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14065 conditions, 5214 events. 3715/5214 cut-off events. For 3118/3202 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 25190 event pairs, 1431 based on Foata normal form. 163/5361 useless extension candidates. Maximal degree in co-relation 14057. Up to 4561 conditions per place. [2023-11-06 22:16:51,242 INFO L140 encePairwiseOnDemand]: 282/290 looper letters, 43 selfloop transitions, 9 changer transitions 17/74 dead transitions. [2023-11-06 22:16:51,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 386 flow [2023-11-06 22:16:51,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:16:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:16:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 851 transitions. [2023-11-06 22:16:51,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48908045977011494 [2023-11-06 22:16:51,248 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 851 transitions. [2023-11-06 22:16:51,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 851 transitions. [2023-11-06 22:16:51,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:51,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 851 transitions. [2023-11-06 22:16:51,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:51,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:51,260 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:51,261 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 116 flow. Second operand 6 states and 851 transitions. [2023-11-06 22:16:51,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 386 flow [2023-11-06 22:16:51,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 379 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:16:51,304 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 174 flow [2023-11-06 22:16:51,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-11-06 22:16:51,308 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2023-11-06 22:16:51,308 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 174 flow [2023-11-06 22:16:51,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.33333333333334) internal successors, (794), 6 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:51,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:51,310 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:16:51,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:16:51,310 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:51,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:51,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1965410742, now seen corresponding path program 1 times [2023-11-06 22:16:51,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:51,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517111313] [2023-11-06 22:16:51,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:51,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:52,282 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:16:52,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:52,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517111313] [2023-11-06 22:16:52,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517111313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:52,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:52,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:16:52,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800831100] [2023-11-06 22:16:52,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:52,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:16:52,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:52,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:16:52,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:16:52,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2023-11-06 22:16:52,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 132.33333333333334) internal successors, (794), 6 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:52,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:52,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2023-11-06 22:16:52,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:53,450 INFO L124 PetriNetUnfolderBase]: 3543/5050 cut-off events. [2023-11-06 22:16:53,451 INFO L125 PetriNetUnfolderBase]: For 8482/8590 co-relation queries the response was YES. [2023-11-06 22:16:53,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16356 conditions, 5050 events. 3543/5050 cut-off events. For 8482/8590 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 25092 event pairs, 1437 based on Foata normal form. 208/5217 useless extension candidates. Maximal degree in co-relation 16346. Up to 3723 conditions per place. [2023-11-06 22:16:53,507 INFO L140 encePairwiseOnDemand]: 286/290 looper letters, 44 selfloop transitions, 3 changer transitions 20/72 dead transitions. [2023-11-06 22:16:53,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 468 flow [2023-11-06 22:16:53,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:16:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:16:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 711 transitions. [2023-11-06 22:16:53,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4903448275862069 [2023-11-06 22:16:53,513 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 711 transitions. [2023-11-06 22:16:53,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 711 transitions. [2023-11-06 22:16:53,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:53,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 711 transitions. [2023-11-06 22:16:53,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:53,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:53,528 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:53,528 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 174 flow. Second operand 5 states and 711 transitions. [2023-11-06 22:16:53,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 468 flow [2023-11-06 22:16:53,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 441 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-06 22:16:53,568 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 162 flow [2023-11-06 22:16:53,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2023-11-06 22:16:53,569 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2023-11-06 22:16:53,570 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 162 flow [2023-11-06 22:16:53,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.33333333333334) internal successors, (794), 6 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:53,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:53,571 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:16:53,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:16:53,572 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:53,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:53,572 INFO L85 PathProgramCache]: Analyzing trace with hash -154118356, now seen corresponding path program 1 times [2023-11-06 22:16:53,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:53,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934788960] [2023-11-06 22:16:53,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:53,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:53,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:53,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934788960] [2023-11-06 22:16:53,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934788960] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:53,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:53,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:16:53,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412259106] [2023-11-06 22:16:53,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:53,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:16:53,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:53,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:16:53,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:16:53,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2023-11-06 22:16:53,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:53,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:53,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2023-11-06 22:16:53,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:54,665 INFO L124 PetriNetUnfolderBase]: 2271/3336 cut-off events. [2023-11-06 22:16:54,665 INFO L125 PetriNetUnfolderBase]: For 7605/7605 co-relation queries the response was YES. [2023-11-06 22:16:54,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11306 conditions, 3336 events. 2271/3336 cut-off events. For 7605/7605 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 16592 event pairs, 762 based on Foata normal form. 81/3390 useless extension candidates. Maximal degree in co-relation 11294. Up to 2831 conditions per place. [2023-11-06 22:16:54,698 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 45 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2023-11-06 22:16:54,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 55 transitions, 339 flow [2023-11-06 22:16:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:16:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:16:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-11-06 22:16:54,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49770114942528737 [2023-11-06 22:16:54,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-11-06 22:16:54,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-11-06 22:16:54,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:54,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-11-06 22:16:54,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:54,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:54,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:54,711 INFO L175 Difference]: Start difference. First operand has 54 places, 37 transitions, 162 flow. Second operand 3 states and 433 transitions. [2023-11-06 22:16:54,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 55 transitions, 339 flow [2023-11-06 22:16:54,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 327 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-06 22:16:54,731 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 185 flow [2023-11-06 22:16:54,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-06 22:16:54,732 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2023-11-06 22:16:54,733 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 185 flow [2023-11-06 22:16:54,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:54,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:54,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:54,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:16:54,734 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:54,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:54,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2062370871, now seen corresponding path program 1 times [2023-11-06 22:16:54,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:54,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378000543] [2023-11-06 22:16:54,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:54,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:54,986 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:16:54,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:54,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378000543] [2023-11-06 22:16:54,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378000543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:54,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:54,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:16:54,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146711041] [2023-11-06 22:16:54,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:54,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:16:54,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:54,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:16:54,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:16:55,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2023-11-06 22:16:55,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 185 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:55,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:55,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2023-11-06 22:16:55,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:55,587 INFO L124 PetriNetUnfolderBase]: 1263/1992 cut-off events. [2023-11-06 22:16:55,587 INFO L125 PetriNetUnfolderBase]: For 3848/3848 co-relation queries the response was YES. [2023-11-06 22:16:55,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7198 conditions, 1992 events. 1263/1992 cut-off events. For 3848/3848 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9730 event pairs, 251 based on Foata normal form. 108/2087 useless extension candidates. Maximal degree in co-relation 7187. Up to 947 conditions per place. [2023-11-06 22:16:55,604 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 57 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-11-06 22:16:55,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 461 flow [2023-11-06 22:16:55,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:16:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:16:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2023-11-06 22:16:55,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4991379310344828 [2023-11-06 22:16:55,609 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2023-11-06 22:16:55,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2023-11-06 22:16:55,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:55,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2023-11-06 22:16:55,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:55,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:55,619 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:55,619 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 185 flow. Second operand 4 states and 579 transitions. [2023-11-06 22:16:55,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 461 flow [2023-11-06 22:16:55,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:16:55,627 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 232 flow [2023-11-06 22:16:55,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-06 22:16:55,628 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2023-11-06 22:16:55,629 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 232 flow [2023-11-06 22:16:55,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:55,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:55,630 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:16:55,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:16:55,631 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:55,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:55,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1654553356, now seen corresponding path program 1 times [2023-11-06 22:16:55,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:55,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946351917] [2023-11-06 22:16:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:55,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:55,966 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:16:55,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:55,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946351917] [2023-11-06 22:16:55,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946351917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:55,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:55,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:16:55,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622634474] [2023-11-06 22:16:55,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:55,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:16:55,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:55,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:16:55,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:16:55,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2023-11-06 22:16:55,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:55,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:55,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2023-11-06 22:16:55,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:56,489 INFO L124 PetriNetUnfolderBase]: 899/1446 cut-off events. [2023-11-06 22:16:56,490 INFO L125 PetriNetUnfolderBase]: For 3634/3634 co-relation queries the response was YES. [2023-11-06 22:16:56,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5557 conditions, 1446 events. 899/1446 cut-off events. For 3634/3634 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6930 event pairs, 196 based on Foata normal form. 54/1479 useless extension candidates. Maximal degree in co-relation 5545. Up to 540 conditions per place. [2023-11-06 22:16:56,508 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 67 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2023-11-06 22:16:56,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 85 transitions, 599 flow [2023-11-06 22:16:56,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:16:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:16:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2023-11-06 22:16:56,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4986206896551724 [2023-11-06 22:16:56,514 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2023-11-06 22:16:56,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2023-11-06 22:16:56,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:56,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2023-11-06 22:16:56,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:56,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:56,526 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:56,527 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 232 flow. Second operand 5 states and 723 transitions. [2023-11-06 22:16:56,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 85 transitions, 599 flow [2023-11-06 22:16:56,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 85 transitions, 581 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 22:16:56,538 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 282 flow [2023-11-06 22:16:56,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-11-06 22:16:56,540 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2023-11-06 22:16:56,541 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 282 flow [2023-11-06 22:16:56,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:56,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:56,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:56,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:16:56,542 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:56,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:56,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1049400037, now seen corresponding path program 1 times [2023-11-06 22:16:56,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:56,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595721886] [2023-11-06 22:16:56,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:56,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:56,876 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:16:56,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:56,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595721886] [2023-11-06 22:16:56,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595721886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:56,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:56,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:16:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512139577] [2023-11-06 22:16:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:56,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:16:56,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:56,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:16:56,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:16:56,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2023-11-06 22:16:56,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:56,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:56,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2023-11-06 22:16:56,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:57,505 INFO L124 PetriNetUnfolderBase]: 1341/2170 cut-off events. [2023-11-06 22:16:57,505 INFO L125 PetriNetUnfolderBase]: For 5960/5960 co-relation queries the response was YES. [2023-11-06 22:16:57,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8720 conditions, 2170 events. 1341/2170 cut-off events. For 5960/5960 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11207 event pairs, 208 based on Foata normal form. 10/2174 useless extension candidates. Maximal degree in co-relation 8707. Up to 1250 conditions per place. [2023-11-06 22:16:57,527 INFO L140 encePairwiseOnDemand]: 286/290 looper letters, 78 selfloop transitions, 2 changer transitions 40/124 dead transitions. [2023-11-06 22:16:57,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 124 transitions, 1008 flow [2023-11-06 22:16:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:16:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:16:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 704 transitions. [2023-11-06 22:16:57,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48551724137931035 [2023-11-06 22:16:57,533 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 704 transitions. [2023-11-06 22:16:57,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 704 transitions. [2023-11-06 22:16:57,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:57,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 704 transitions. [2023-11-06 22:16:57,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:57,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:57,542 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:57,542 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 282 flow. Second operand 5 states and 704 transitions. [2023-11-06 22:16:57,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 124 transitions, 1008 flow [2023-11-06 22:16:57,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 124 transitions, 918 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-11-06 22:16:57,564 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 263 flow [2023-11-06 22:16:57,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-06 22:16:57,565 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2023-11-06 22:16:57,566 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 263 flow [2023-11-06 22:16:57,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:57,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:57,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:57,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:16:57,567 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:57,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:57,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1384121473, now seen corresponding path program 2 times [2023-11-06 22:16:57,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:57,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206679626] [2023-11-06 22:16:57,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:57,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:59,151 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:16:59,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:59,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206679626] [2023-11-06 22:16:59,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206679626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:59,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:59,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:16:59,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025446247] [2023-11-06 22:16:59,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:59,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:16:59,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:59,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:16:59,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:16:59,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 290 [2023-11-06 22:16:59,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 263 flow. Second operand has 10 states, 10 states have (on average 128.2) internal successors, (1282), 10 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:59,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:59,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 290 [2023-11-06 22:16:59,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:00,582 INFO L124 PetriNetUnfolderBase]: 2695/4404 cut-off events. [2023-11-06 22:17:00,582 INFO L125 PetriNetUnfolderBase]: For 10196/10308 co-relation queries the response was YES. [2023-11-06 22:17:00,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16904 conditions, 4404 events. 2695/4404 cut-off events. For 10196/10308 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 26168 event pairs, 251 based on Foata normal form. 50/4430 useless extension candidates. Maximal degree in co-relation 16888. Up to 1242 conditions per place. [2023-11-06 22:17:00,616 INFO L140 encePairwiseOnDemand]: 281/290 looper letters, 126 selfloop transitions, 15 changer transitions 34/180 dead transitions. [2023-11-06 22:17:00,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 180 transitions, 1350 flow [2023-11-06 22:17:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:17:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:17:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1123 transitions. [2023-11-06 22:17:00,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484051724137931 [2023-11-06 22:17:00,626 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1123 transitions. [2023-11-06 22:17:00,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1123 transitions. [2023-11-06 22:17:00,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:00,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1123 transitions. [2023-11-06 22:17:00,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 140.375) internal successors, (1123), 8 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:00,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:00,638 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:00,638 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 263 flow. Second operand 8 states and 1123 transitions. [2023-11-06 22:17:00,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 180 transitions, 1350 flow [2023-11-06 22:17:00,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 180 transitions, 1340 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-06 22:17:00,724 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 386 flow [2023-11-06 22:17:00,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=386, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-06 22:17:00,725 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places. [2023-11-06 22:17:00,725 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 386 flow [2023-11-06 22:17:00,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.2) internal successors, (1282), 10 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:00,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:00,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:00,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:17:00,726 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:00,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:00,727 INFO L85 PathProgramCache]: Analyzing trace with hash 406807627, now seen corresponding path program 3 times [2023-11-06 22:17:00,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:00,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114688373] [2023-11-06 22:17:00,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:00,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:00,993 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:17:00,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:00,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114688373] [2023-11-06 22:17:00,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114688373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:00,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:00,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:17:00,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995195508] [2023-11-06 22:17:00,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:00,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:17:00,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:00,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:17:00,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:17:01,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2023-11-06 22:17:01,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:01,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:01,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2023-11-06 22:17:01,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:01,795 INFO L124 PetriNetUnfolderBase]: 2201/3565 cut-off events. [2023-11-06 22:17:01,795 INFO L125 PetriNetUnfolderBase]: For 13866/13960 co-relation queries the response was YES. [2023-11-06 22:17:01,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15342 conditions, 3565 events. 2201/3565 cut-off events. For 13866/13960 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 21330 event pairs, 349 based on Foata normal form. 66/3599 useless extension candidates. Maximal degree in co-relation 15322. Up to 1396 conditions per place. [2023-11-06 22:17:01,825 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 68 selfloop transitions, 17 changer transitions 11/102 dead transitions. [2023-11-06 22:17:01,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 102 transitions, 874 flow [2023-11-06 22:17:01,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:17:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:17:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 853 transitions. [2023-11-06 22:17:01,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4902298850574713 [2023-11-06 22:17:01,830 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 853 transitions. [2023-11-06 22:17:01,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 853 transitions. [2023-11-06 22:17:01,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:01,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 853 transitions. [2023-11-06 22:17:01,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.16666666666666) internal successors, (853), 6 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:01,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:01,840 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:01,840 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 386 flow. Second operand 6 states and 853 transitions. [2023-11-06 22:17:01,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 102 transitions, 874 flow [2023-11-06 22:17:01,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 835 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-11-06 22:17:01,948 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 368 flow [2023-11-06 22:17:01,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=368, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2023-11-06 22:17:01,949 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 17 predicate places. [2023-11-06 22:17:01,950 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 368 flow [2023-11-06 22:17:01,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:01,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:01,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:01,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:17:01,951 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:01,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:01,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1278676401, now seen corresponding path program 1 times [2023-11-06 22:17:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:01,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185219616] [2023-11-06 22:17:01,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:01,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:02,264 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:17:02,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:02,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185219616] [2023-11-06 22:17:02,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185219616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:02,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:02,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:17:02,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325720191] [2023-11-06 22:17:02,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:02,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:17:02,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:02,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:17:02,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:17:02,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2023-11-06 22:17:02,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 368 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:02,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:02,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2023-11-06 22:17:02,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:03,063 INFO L124 PetriNetUnfolderBase]: 2707/4425 cut-off events. [2023-11-06 22:17:03,064 INFO L125 PetriNetUnfolderBase]: For 16116/16117 co-relation queries the response was YES. [2023-11-06 22:17:03,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19057 conditions, 4425 events. 2707/4425 cut-off events. For 16116/16117 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 26303 event pairs, 441 based on Foata normal form. 2/4396 useless extension candidates. Maximal degree in co-relation 19039. Up to 2068 conditions per place. [2023-11-06 22:17:03,092 INFO L140 encePairwiseOnDemand]: 286/290 looper letters, 93 selfloop transitions, 2 changer transitions 17/117 dead transitions. [2023-11-06 22:17:03,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 117 transitions, 1057 flow [2023-11-06 22:17:03,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:17:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:17:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 688 transitions. [2023-11-06 22:17:03,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47448275862068967 [2023-11-06 22:17:03,097 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 688 transitions. [2023-11-06 22:17:03,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 688 transitions. [2023-11-06 22:17:03,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:03,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 688 transitions. [2023-11-06 22:17:03,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.6) internal successors, (688), 5 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:03,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:03,106 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:03,106 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 368 flow. Second operand 5 states and 688 transitions. [2023-11-06 22:17:03,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 117 transitions, 1057 flow [2023-11-06 22:17:03,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 117 transitions, 864 flow, removed 64 selfloop flow, removed 8 redundant places. [2023-11-06 22:17:03,211 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 301 flow [2023-11-06 22:17:03,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2023-11-06 22:17:03,211 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places. [2023-11-06 22:17:03,212 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 301 flow [2023-11-06 22:17:03,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:03,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:03,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:03,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:17:03,213 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:03,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:03,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1285441467, now seen corresponding path program 2 times [2023-11-06 22:17:03,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:03,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804896022] [2023-11-06 22:17:03,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:03,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:03,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:03,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804896022] [2023-11-06 22:17:03,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804896022] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:03,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:03,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:17:03,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955229263] [2023-11-06 22:17:03,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:03,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:17:03,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:03,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:17:03,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:17:03,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2023-11-06 22:17:03,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:03,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:03,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2023-11-06 22:17:03,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:04,492 INFO L124 PetriNetUnfolderBase]: 3805/6377 cut-off events. [2023-11-06 22:17:04,492 INFO L125 PetriNetUnfolderBase]: For 12827/12828 co-relation queries the response was YES. [2023-11-06 22:17:04,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23837 conditions, 6377 events. 3805/6377 cut-off events. For 12827/12828 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 42132 event pairs, 1429 based on Foata normal form. 2/6303 useless extension candidates. Maximal degree in co-relation 23820. Up to 2412 conditions per place. [2023-11-06 22:17:04,527 INFO L140 encePairwiseOnDemand]: 286/290 looper letters, 49 selfloop transitions, 1 changer transitions 66/120 dead transitions. [2023-11-06 22:17:04,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 120 transitions, 920 flow [2023-11-06 22:17:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:17:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:17:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 684 transitions. [2023-11-06 22:17:04,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47172413793103446 [2023-11-06 22:17:04,531 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 684 transitions. [2023-11-06 22:17:04,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 684 transitions. [2023-11-06 22:17:04,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:04,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 684 transitions. [2023-11-06 22:17:04,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:04,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:04,539 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:04,539 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 301 flow. Second operand 5 states and 684 transitions. [2023-11-06 22:17:04,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 120 transitions, 920 flow [2023-11-06 22:17:04,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 120 transitions, 916 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:17:04,702 INFO L231 Difference]: Finished difference. Result has 72 places, 48 transitions, 260 flow [2023-11-06 22:17:04,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2023-11-06 22:17:04,703 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 18 predicate places. [2023-11-06 22:17:04,703 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 260 flow [2023-11-06 22:17:04,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:04,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:04,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:04,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:17:04,704 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:04,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:04,705 INFO L85 PathProgramCache]: Analyzing trace with hash -275756499, now seen corresponding path program 3 times [2023-11-06 22:17:04,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:04,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315437966] [2023-11-06 22:17:04,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:04,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:06,136 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:17:06,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:06,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315437966] [2023-11-06 22:17:06,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315437966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:06,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:06,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:17:06,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332478901] [2023-11-06 22:17:06,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:06,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:17:06,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:06,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:17:06,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:17:06,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-11-06 22:17:06,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 48 transitions, 260 flow. Second operand has 9 states, 9 states have (on average 130.77777777777777) internal successors, (1177), 9 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:06,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:06,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-11-06 22:17:06,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:06,895 INFO L124 PetriNetUnfolderBase]: 1651/2798 cut-off events. [2023-11-06 22:17:06,895 INFO L125 PetriNetUnfolderBase]: For 5329/5351 co-relation queries the response was YES. [2023-11-06 22:17:06,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10589 conditions, 2798 events. 1651/2798 cut-off events. For 5329/5351 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15809 event pairs, 804 based on Foata normal form. 3/2725 useless extension candidates. Maximal degree in co-relation 10570. Up to 2003 conditions per place. [2023-11-06 22:17:06,912 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 54 selfloop transitions, 8 changer transitions 14/80 dead transitions. [2023-11-06 22:17:06,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 80 transitions, 587 flow [2023-11-06 22:17:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:17:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:17:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 683 transitions. [2023-11-06 22:17:06,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4710344827586207 [2023-11-06 22:17:06,917 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 683 transitions. [2023-11-06 22:17:06,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 683 transitions. [2023-11-06 22:17:06,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:06,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 683 transitions. [2023-11-06 22:17:06,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:06,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:06,926 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:06,926 INFO L175 Difference]: Start difference. First operand has 72 places, 48 transitions, 260 flow. Second operand 5 states and 683 transitions. [2023-11-06 22:17:06,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 80 transitions, 587 flow [2023-11-06 22:17:06,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 567 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-06 22:17:06,979 INFO L231 Difference]: Finished difference. Result has 68 places, 51 transitions, 298 flow [2023-11-06 22:17:06,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=68, PETRI_TRANSITIONS=51} [2023-11-06 22:17:06,980 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places. [2023-11-06 22:17:06,980 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 298 flow [2023-11-06 22:17:06,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 130.77777777777777) internal successors, (1177), 9 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:06,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:06,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:06,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:17:06,982 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:06,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:06,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1943756525, now seen corresponding path program 4 times [2023-11-06 22:17:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:06,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592196837] [2023-11-06 22:17:06,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:06,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:17:07,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:17:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:17:07,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:17:07,173 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:17:07,174 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:17:07,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:17:07,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:17:07,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:17:07,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:17:07,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:17:07,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:17:07,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:17:07,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:17:07,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:17:07,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:17:07,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:17:07,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:17:07,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:17:07,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:17:07,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:17:07,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:17:07,182 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:07,189 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:17:07,190 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:17:07,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:17:07 BasicIcfg [2023-11-06 22:17:07,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:17:07,316 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:17:07,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:17:07,317 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:17:07,318 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:16:26" (3/4) ... [2023-11-06 22:17:07,324 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:17:07,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:17:07,326 INFO L158 Benchmark]: Toolchain (without parser) took 43438.49ms. Allocated memory was 151.0MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 115.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-06 22:17:07,327 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 113.2MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:17:07,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 885.88ms. Allocated memory is still 151.0MB. Free memory was 115.2MB in the beginning and 91.0MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:17:07,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.06ms. Allocated memory is still 151.0MB. Free memory was 91.0MB in the beginning and 87.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:17:07,328 INFO L158 Benchmark]: Boogie Preprocessor took 83.61ms. Allocated memory is still 151.0MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:17:07,328 INFO L158 Benchmark]: RCFGBuilder took 1053.67ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 85.8MB in the beginning and 151.3MB in the end (delta: -65.4MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2023-11-06 22:17:07,329 INFO L158 Benchmark]: TraceAbstraction took 41289.55ms. Allocated memory was 197.1MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 150.2MB in the beginning and 1.1GB in the end (delta: -978.0MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-11-06 22:17:07,329 INFO L158 Benchmark]: Witness Printer took 9.14ms. Allocated memory is still 2.5GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:17:07,332 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.25ms. Allocated memory is still 113.2MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 885.88ms. Allocated memory is still 151.0MB. Free memory was 115.2MB in the beginning and 91.0MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.06ms. Allocated memory is still 151.0MB. Free memory was 91.0MB in the beginning and 87.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.61ms. Allocated memory is still 151.0MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1053.67ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 85.8MB in the beginning and 151.3MB in the end (delta: -65.4MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * TraceAbstraction took 41289.55ms. Allocated memory was 197.1MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 150.2MB in the beginning and 1.1GB in the end (delta: -978.0MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 9.14ms. Allocated memory is still 2.5GB. Free memory is still 1.1GB. 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: 8.4s, 157 PlacesBefore, 54 PlacesAfterwards, 147 TransitionsBefore, 42 TransitionsAfterwards, 4046 CoEnabledTransitionPairs, 8 FixpointIterations, 47 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 139 TotalNumberOfCompositions, 12285 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4513, independent: 4226, independent conditional: 0, independent unconditional: 4226, dependent: 287, dependent conditional: 0, dependent unconditional: 287, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2131, independent: 2090, independent conditional: 0, independent unconditional: 2090, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4513, independent: 2136, independent conditional: 0, independent unconditional: 2136, dependent: 246, dependent conditional: 0, dependent unconditional: 246, unknown: 2131, unknown conditional: 0, unknown unconditional: 2131] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t489, ((void *)0), P0, ((void *)0))=-3, t489={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t490, ((void *)0), P1, ((void *)0))=-2, t489={5:0}, t490={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t491; [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t491, ((void *)0), P2, ((void *)0))=-1, t489={5:0}, t490={6:0}, t491={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L859] 0 pthread_t t492; [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t492, ((void *)0), P3, ((void *)0))=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix018_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 856]: 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: 858]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 187 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 41.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1009 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 771 mSDsluCounter, 675 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 523 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3053 IncrementalHoareTripleChecker+Invalid, 3241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 152 mSDtfsCounter, 3053 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=12, InterpolantAutomatonStates: 79, 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.9s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 322 NumberOfCodeBlocks, 322 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 2428 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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:17:07,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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_14ac4c96-f843-4613-b7d4-09a068e6641d/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 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:17:10,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:17:10,568 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:17:10,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:17:10,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:17:10,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:17:10,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:17:10,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:17:10,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:17:10,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:17:10,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:17:10,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:17:10,614 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:17:10,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:17:10,616 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:17:10,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:17:10,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:17:10,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:17:10,619 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:17:10,619 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:17:10,620 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:17:10,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:17:10,621 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:17:10,622 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:17:10,622 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:17:10,623 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:17:10,623 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:17:10,624 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:17:10,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:17:10,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:17:10,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:17:10,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:17:10,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:17:10,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:17:10,627 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:17:10,628 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:17:10,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:17:10,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:17:10,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:17:10,629 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:17:10,629 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:17:10,630 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_14ac4c96-f843-4613-b7d4-09a068e6641d/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_14ac4c96-f843-4613-b7d4-09a068e6641d/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 -> 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf [2023-11-06 22:17:11,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:17:11,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:17:11,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:17:11,174 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:17:11,175 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:17:11,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2023-11-06 22:17:14,486 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:17:14,817 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:17:14,817 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2023-11-06 22:17:14,854 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/data/f4b6cd170/085b39439e9944e5926c60af1fd6ebdf/FLAG583bb6f91 [2023-11-06 22:17:14,870 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/data/f4b6cd170/085b39439e9944e5926c60af1fd6ebdf [2023-11-06 22:17:14,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:17:14,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:17:14,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:17:14,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:17:14,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:17:14,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:14" (1/1) ... [2023-11-06 22:17:14,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45157faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:14, skipping insertion in model container [2023-11-06 22:17:14,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:14" (1/1) ... [2023-11-06 22:17:14,972 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:17:15,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:17:15,508 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:17:15,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:17:15,712 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:17:15,712 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:17:15,721 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:17:15,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:15 WrapperNode [2023-11-06 22:17:15,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:17:15,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:17:15,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:17:15,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:17:15,733 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:17:15" (1/1) ... [2023-11-06 22:17:15,777 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:17:15" (1/1) ... [2023-11-06 22:17:15,828 INFO L138 Inliner]: procedures = 180, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 168 [2023-11-06 22:17:15,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:17:15,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:17:15,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:17:15,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:17:15,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:15" (1/1) ... [2023-11-06 22:17:15,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:15" (1/1) ... [2023-11-06 22:17:15,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:15" (1/1) ... [2023-11-06 22:17:15,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:15" (1/1) ... [2023-11-06 22:17:15,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:15" (1/1) ... [2023-11-06 22:17:15,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:15" (1/1) ... [2023-11-06 22:17:15,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:15" (1/1) ... [2023-11-06 22:17:15,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:15" (1/1) ... [2023-11-06 22:17:15,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:17:15,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:17:15,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:17:15,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:17:15,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:15" (1/1) ... [2023-11-06 22:17:15,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:17:15,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:17:15,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:15,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:15,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:17:15,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:17:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:17:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:17:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:17:15,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:17:15,965 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:17:15,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:17:15,965 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:17:15,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:17:15,966 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:17:15,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:17:15,968 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:17:15,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:17:15,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:17:15,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:17:15,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:17:15,971 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:17:16,151 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:17:16,154 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:17:16,645 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:17:16,882 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:17:16,883 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:17:16,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:16 BoogieIcfgContainer [2023-11-06 22:17:16,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:17:16,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:17:16,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:17:16,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:17:16,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:17:14" (1/3) ... [2023-11-06 22:17:16,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7eba64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:16, skipping insertion in model container [2023-11-06 22:17:16,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:15" (2/3) ... [2023-11-06 22:17:16,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7eba64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:16, skipping insertion in model container [2023-11-06 22:17:16,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:16" (3/3) ... [2023-11-06 22:17:16,900 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2023-11-06 22:17:16,921 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:17:16,922 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:17:16,922 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:17:17,047 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:17:17,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 152 transitions, 320 flow [2023-11-06 22:17:17,223 INFO L124 PetriNetUnfolderBase]: 3/148 cut-off events. [2023-11-06 22:17:17,223 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:17:17,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 3/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 120 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-06 22:17:17,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 152 transitions, 320 flow [2023-11-06 22:17:17,242 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 148 transitions, 308 flow [2023-11-06 22:17:17,248 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:17:17,272 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 148 transitions, 308 flow [2023-11-06 22:17:17,278 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 148 transitions, 308 flow [2023-11-06 22:17:17,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 148 transitions, 308 flow [2023-11-06 22:17:17,348 INFO L124 PetriNetUnfolderBase]: 3/148 cut-off events. [2023-11-06 22:17:17,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:17:17,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 3/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 121 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-06 22:17:17,357 INFO L119 LiptonReduction]: Number of co-enabled transitions 4046 [2023-11-06 22:17:31,028 INFO L134 LiptonReduction]: Checked pairs total: 12535 [2023-11-06 22:17:31,029 INFO L136 LiptonReduction]: Total number of compositions: 140 [2023-11-06 22:17:31,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:17:31,052 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;@748a2cda, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:17:31,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:17:31,055 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:17:31,055 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:17:31,055 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:17:31,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:31,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:17:31,057 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:31,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:31,061 INFO L85 PathProgramCache]: Analyzing trace with hash 653, now seen corresponding path program 1 times [2023-11-06 22:17:31,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:31,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331430939] [2023-11-06 22:17:31,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:31,075 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:17:31,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:31,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:31,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:31,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:17:31,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:31,235 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:17:31,235 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:17:31,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:31,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331430939] [2023-11-06 22:17:31,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331430939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:31,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:31,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:17:31,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459795245] [2023-11-06 22:17:31,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:31,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:17:31,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:31,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:17:31,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:17:31,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 292 [2023-11-06 22:17:31,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:31,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:31,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 292 [2023-11-06 22:17:31,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:33,362 INFO L124 PetriNetUnfolderBase]: 7925/10854 cut-off events. [2023-11-06 22:17:33,362 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-06 22:17:33,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21764 conditions, 10854 events. 7925/10854 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 57979 event pairs, 7925 based on Foata normal form. 320/9402 useless extension candidates. Maximal degree in co-relation 21752. Up to 10695 conditions per place. [2023-11-06 22:17:33,475 INFO L140 encePairwiseOnDemand]: 283/292 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-11-06 22:17:33,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2023-11-06 22:17:33,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:17:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:17:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2023-11-06 22:17:33,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5291095890410958 [2023-11-06 22:17:33,502 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2023-11-06 22:17:33,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2023-11-06 22:17:33,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:33,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2023-11-06 22:17:33,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:33,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:33,519 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:33,521 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 309 transitions. [2023-11-06 22:17:33,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2023-11-06 22:17:33,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:17:33,531 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-11-06 22:17:33,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-06 22:17:33,538 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-11-06 22:17:33,539 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-11-06 22:17:33,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:33,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:33,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:17:33,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:33,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:33,755 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:33,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:33,756 INFO L85 PathProgramCache]: Analyzing trace with hash 618982019, now seen corresponding path program 1 times [2023-11-06 22:17:33,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:33,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195561475] [2023-11-06 22:17:33,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:33,758 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:17:33,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:33,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:33,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:33,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:17:33,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:33,907 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:17:33,907 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:17:33,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:33,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195561475] [2023-11-06 22:17:33,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195561475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:33,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:33,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:17:33,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69045731] [2023-11-06 22:17:33,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:33,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:17:33,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:33,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:17:33,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:17:33,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 292 [2023-11-06 22:17:33,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:33,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:33,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 292 [2023-11-06 22:17:33,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:35,424 INFO L124 PetriNetUnfolderBase]: 6231/8634 cut-off events. [2023-11-06 22:17:35,425 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:17:35,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17255 conditions, 8634 events. 6231/8634 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 45178 event pairs, 2333 based on Foata normal form. 0/7797 useless extension candidates. Maximal degree in co-relation 17252. Up to 6739 conditions per place. [2023-11-06 22:17:35,506 INFO L140 encePairwiseOnDemand]: 289/292 looper letters, 41 selfloop transitions, 2 changer transitions 4/52 dead transitions. [2023-11-06 22:17:35,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 210 flow [2023-11-06 22:17:35,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:17:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:17:35,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-11-06 22:17:35,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171232876712328 [2023-11-06 22:17:35,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-11-06 22:17:35,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-11-06 22:17:35,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:35,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-11-06 22:17:35,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:35,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:35,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:35,530 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 453 transitions. [2023-11-06 22:17:35,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 210 flow [2023-11-06 22:17:35,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:17:35,532 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 72 flow [2023-11-06 22:17:35,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-11-06 22:17:35,534 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-11-06 22:17:35,534 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 72 flow [2023-11-06 22:17:35,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:35,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:35,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:35,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:35,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:35,748 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:35,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:35,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1791231872, now seen corresponding path program 1 times [2023-11-06 22:17:35,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:35,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382551099] [2023-11-06 22:17:35,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:35,750 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:17:35,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:35,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:35,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:35,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:17:35,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:35,945 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:17:35,945 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:17:35,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:35,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382551099] [2023-11-06 22:17:35,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382551099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:35,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:35,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:17:35,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046530819] [2023-11-06 22:17:35,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:35,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:17:35,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:35,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:17:35,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:17:35,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 292 [2023-11-06 22:17:35,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:35,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:35,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 292 [2023-11-06 22:17:35,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:36,767 INFO L124 PetriNetUnfolderBase]: 3075/4455 cut-off events. [2023-11-06 22:17:36,767 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2023-11-06 22:17:36,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9294 conditions, 4455 events. 3075/4455 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 23147 event pairs, 693 based on Foata normal form. 81/4313 useless extension candidates. Maximal degree in co-relation 9290. Up to 3944 conditions per place. [2023-11-06 22:17:36,801 INFO L140 encePairwiseOnDemand]: 286/292 looper letters, 38 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-11-06 22:17:36,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 202 flow [2023-11-06 22:17:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:17:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:17:36,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-11-06 22:17:36,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988584474885845 [2023-11-06 22:17:36,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-11-06 22:17:36,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-11-06 22:17:36,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:36,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-11-06 22:17:36,807 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:17:36,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:36,811 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:36,811 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 72 flow. Second operand 3 states and 437 transitions. [2023-11-06 22:17:36,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 202 flow [2023-11-06 22:17:36,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:17:36,815 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 101 flow [2023-11-06 22:17:36,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2023-11-06 22:17:36,817 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-11-06 22:17:36,817 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 101 flow [2023-11-06 22:17:36,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:36,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:36,818 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:17:36,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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)] Ended with exit code 0 [2023-11-06 22:17:37,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:37,030 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:37,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:37,031 INFO L85 PathProgramCache]: Analyzing trace with hash -519167640, now seen corresponding path program 1 times [2023-11-06 22:17:37,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:37,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490907744] [2023-11-06 22:17:37,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:37,033 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:17:37,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:37,034 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:37,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:37,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:17:37,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:37,282 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:17:37,282 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:17:37,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:37,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490907744] [2023-11-06 22:17:37,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490907744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:37,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:37,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:17:37,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033739729] [2023-11-06 22:17:37,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:37,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:17:37,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:37,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:17:37,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:17:37,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 292 [2023-11-06 22:17:37,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:37,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:37,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 292 [2023-11-06 22:17:37,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:37,805 INFO L124 PetriNetUnfolderBase]: 1455/2295 cut-off events. [2023-11-06 22:17:37,806 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2023-11-06 22:17:37,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5499 conditions, 2295 events. 1455/2295 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11714 event pairs, 343 based on Foata normal form. 108/2313 useless extension candidates. Maximal degree in co-relation 5494. Up to 1244 conditions per place. [2023-11-06 22:17:37,825 INFO L140 encePairwiseOnDemand]: 286/292 looper letters, 50 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2023-11-06 22:17:37,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 297 flow [2023-11-06 22:17:37,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:17:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:17:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 584 transitions. [2023-11-06 22:17:37,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-06 22:17:37,830 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 584 transitions. [2023-11-06 22:17:37,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 584 transitions. [2023-11-06 22:17:37,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:37,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 584 transitions. [2023-11-06 22:17:37,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:37,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:37,839 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:37,839 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 101 flow. Second operand 4 states and 584 transitions. [2023-11-06 22:17:37,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 64 transitions, 297 flow [2023-11-06 22:17:37,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:17:37,843 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 148 flow [2023-11-06 22:17:37,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-11-06 22:17:37,844 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -8 predicate places. [2023-11-06 22:17:37,845 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 148 flow [2023-11-06 22:17:37,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:37,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:37,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:37,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:17:38,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:38,065 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:38,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:38,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1203596454, now seen corresponding path program 1 times [2023-11-06 22:17:38,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:38,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464443876] [2023-11-06 22:17:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:38,067 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:17:38,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:38,069 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:38,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:38,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:17:38,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:38,322 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:17:38,322 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:17:38,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:38,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464443876] [2023-11-06 22:17:38,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464443876] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:38,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:38,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:17:38,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359753128] [2023-11-06 22:17:38,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:38,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:17:38,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:38,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:17:38,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:17:38,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 292 [2023-11-06 22:17:38,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:38,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:38,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 292 [2023-11-06 22:17:38,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:38,892 INFO L124 PetriNetUnfolderBase]: 915/1485 cut-off events. [2023-11-06 22:17:38,892 INFO L125 PetriNetUnfolderBase]: For 945/945 co-relation queries the response was YES. [2023-11-06 22:17:38,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4022 conditions, 1485 events. 915/1485 cut-off events. For 945/945 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7161 event pairs, 277 based on Foata normal form. 54/1503 useless extension candidates. Maximal degree in co-relation 4016. Up to 540 conditions per place. [2023-11-06 22:17:38,905 INFO L140 encePairwiseOnDemand]: 286/292 looper letters, 60 selfloop transitions, 13 changer transitions 0/78 dead transitions. [2023-11-06 22:17:38,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 78 transitions, 402 flow [2023-11-06 22:17:38,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:17:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:17:38,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 729 transitions. [2023-11-06 22:17:38,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49931506849315066 [2023-11-06 22:17:38,910 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 729 transitions. [2023-11-06 22:17:38,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 729 transitions. [2023-11-06 22:17:38,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:38,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 729 transitions. [2023-11-06 22:17:38,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:38,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:38,920 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:38,921 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 148 flow. Second operand 5 states and 729 transitions. [2023-11-06 22:17:38,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 78 transitions, 402 flow [2023-11-06 22:17:38,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 384 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 22:17:38,927 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 198 flow [2023-11-06 22:17:38,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-11-06 22:17:38,928 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2023-11-06 22:17:38,929 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 198 flow [2023-11-06 22:17:38,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:38,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:38,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:38,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:39,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:39,143 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:39,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1838005173, now seen corresponding path program 1 times [2023-11-06 22:17:39,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:39,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370875314] [2023-11-06 22:17:39,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:39,145 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:17:39,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:39,146 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:39,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:39,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:17:39,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:39,416 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:17:39,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:17:39,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:39,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370875314] [2023-11-06 22:17:39,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370875314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:39,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:39,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:17:39,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330436116] [2023-11-06 22:17:39,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:39,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:17:39,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:39,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:17:39,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:17:39,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 292 [2023-11-06 22:17:39,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:39,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:39,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 292 [2023-11-06 22:17:39,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:40,110 INFO L124 PetriNetUnfolderBase]: 855/1365 cut-off events. [2023-11-06 22:17:40,110 INFO L125 PetriNetUnfolderBase]: For 1087/1087 co-relation queries the response was YES. [2023-11-06 22:17:40,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3836 conditions, 1365 events. 855/1365 cut-off events. For 1087/1087 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6605 event pairs, 272 based on Foata normal form. 12/1353 useless extension candidates. Maximal degree in co-relation 3829. Up to 540 conditions per place. [2023-11-06 22:17:40,123 INFO L140 encePairwiseOnDemand]: 286/292 looper letters, 56 selfloop transitions, 17 changer transitions 0/78 dead transitions. [2023-11-06 22:17:40,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 428 flow [2023-11-06 22:17:40,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:17:40,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:17:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 860 transitions. [2023-11-06 22:17:40,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4908675799086758 [2023-11-06 22:17:40,129 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 860 transitions. [2023-11-06 22:17:40,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 860 transitions. [2023-11-06 22:17:40,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:40,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 860 transitions. [2023-11-06 22:17:40,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:40,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:40,139 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:40,140 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 198 flow. Second operand 6 states and 860 transitions. [2023-11-06 22:17:40,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 428 flow [2023-11-06 22:17:40,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 78 transitions, 394 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-06 22:17:40,155 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 208 flow [2023-11-06 22:17:40,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-06 22:17:40,156 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2023-11-06 22:17:40,156 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 208 flow [2023-11-06 22:17:40,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:40,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:40,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:40,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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)] Ended with exit code 0 [2023-11-06 22:17:40,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:40,370 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:40,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:40,370 INFO L85 PathProgramCache]: Analyzing trace with hash -2117251931, now seen corresponding path program 1 times [2023-11-06 22:17:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:40,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036099438] [2023-11-06 22:17:40,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:40,371 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:17:40,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:40,373 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:40,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:40,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:17:40,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:41,127 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:17:41,127 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:17:41,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:41,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036099438] [2023-11-06 22:17:41,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036099438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:41,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:41,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:17:41,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115071949] [2023-11-06 22:17:41,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:41,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:17:41,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:41,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:17:41,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:17:41,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 292 [2023-11-06 22:17:41,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:41,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:41,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 292 [2023-11-06 22:17:41,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:41,696 INFO L124 PetriNetUnfolderBase]: 1263/1959 cut-off events. [2023-11-06 22:17:41,696 INFO L125 PetriNetUnfolderBase]: For 2059/2059 co-relation queries the response was YES. [2023-11-06 22:17:41,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5751 conditions, 1959 events. 1263/1959 cut-off events. For 2059/2059 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9412 event pairs, 333 based on Foata normal form. 0/1954 useless extension candidates. Maximal degree in co-relation 5743. Up to 1163 conditions per place. [2023-11-06 22:17:41,720 INFO L140 encePairwiseOnDemand]: 287/292 looper letters, 82 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2023-11-06 22:17:41,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 90 transitions, 645 flow [2023-11-06 22:17:41,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:17:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:17:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-11-06 22:17:41,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4773972602739726 [2023-11-06 22:17:41,725 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-11-06 22:17:41,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-11-06 22:17:41,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:41,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-11-06 22:17:41,728 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:17:41,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:41,733 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:41,733 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 208 flow. Second operand 5 states and 697 transitions. [2023-11-06 22:17:41,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 90 transitions, 645 flow [2023-11-06 22:17:41,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 90 transitions, 532 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-11-06 22:17:41,756 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 187 flow [2023-11-06 22:17:41,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-11-06 22:17:41,757 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2023-11-06 22:17:41,757 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 187 flow [2023-11-06 22:17:41,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:41,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:41,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:41,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:41,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:41,981 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:41,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:41,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1981762640, now seen corresponding path program 1 times [2023-11-06 22:17:41,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:41,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237619448] [2023-11-06 22:17:41,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:41,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:17:41,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:41,989 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:42,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:42,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:17:42,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:43,215 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:17:43,215 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:17:43,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:43,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237619448] [2023-11-06 22:17:43,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237619448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:43,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:43,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:17:43,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399704561] [2023-11-06 22:17:43,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:43,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:17:43,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:43,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:17:43,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:17:43,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 292 [2023-11-06 22:17:43,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:43,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:43,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 292 [2023-11-06 22:17:43,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:44,502 INFO L124 PetriNetUnfolderBase]: 1135/1802 cut-off events. [2023-11-06 22:17:44,503 INFO L125 PetriNetUnfolderBase]: For 1315/1315 co-relation queries the response was YES. [2023-11-06 22:17:44,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4953 conditions, 1802 events. 1135/1802 cut-off events. For 1315/1315 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9075 event pairs, 251 based on Foata normal form. 1/1779 useless extension candidates. Maximal degree in co-relation 4942. Up to 1471 conditions per place. [2023-11-06 22:17:44,513 INFO L140 encePairwiseOnDemand]: 287/292 looper letters, 43 selfloop transitions, 4 changer transitions 17/69 dead transitions. [2023-11-06 22:17:44,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 420 flow [2023-11-06 22:17:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:17:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:17:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 733 transitions. [2023-11-06 22:17:44,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41837899543379 [2023-11-06 22:17:44,519 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 733 transitions. [2023-11-06 22:17:44,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 733 transitions. [2023-11-06 22:17:44,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:44,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 733 transitions. [2023-11-06 22:17:44,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:44,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:44,530 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:44,531 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 187 flow. Second operand 6 states and 733 transitions. [2023-11-06 22:17:44,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 420 flow [2023-11-06 22:17:44,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 416 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:17:44,548 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 172 flow [2023-11-06 22:17:44,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-11-06 22:17:44,549 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-11-06 22:17:44,549 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 172 flow [2023-11-06 22:17:44,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:44,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:44,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:44,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:44,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:44,764 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:44,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:44,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1325329045, now seen corresponding path program 2 times [2023-11-06 22:17:44,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:44,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364685862] [2023-11-06 22:17:44,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:17:44,766 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:17:44,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:44,767 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:44,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:17:44,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:17:44,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:17:44,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 22:17:44,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:46,003 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:17:46,003 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:17:46,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:46,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364685862] [2023-11-06 22:17:46,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364685862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:46,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:46,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:17:46,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136969455] [2023-11-06 22:17:46,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:46,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:17:46,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:46,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:17:46,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:17:46,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 292 [2023-11-06 22:17:46,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 172 flow. Second operand has 11 states, 11 states have (on average 129.27272727272728) internal successors, (1422), 11 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:46,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:46,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 292 [2023-11-06 22:17:46,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:46,806 INFO L124 PetriNetUnfolderBase]: 1479/2375 cut-off events. [2023-11-06 22:17:46,807 INFO L125 PetriNetUnfolderBase]: For 1530/1530 co-relation queries the response was YES. [2023-11-06 22:17:46,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 2375 events. 1479/2375 cut-off events. For 1530/1530 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12605 event pairs, 353 based on Foata normal form. 1/2353 useless extension candidates. Maximal degree in co-relation 6579. Up to 1021 conditions per place. [2023-11-06 22:17:46,818 INFO L140 encePairwiseOnDemand]: 286/292 looper letters, 66 selfloop transitions, 5 changer transitions 17/92 dead transitions. [2023-11-06 22:17:46,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 574 flow [2023-11-06 22:17:46,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:17:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:17:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 821 transitions. [2023-11-06 22:17:46,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4686073059360731 [2023-11-06 22:17:46,829 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 821 transitions. [2023-11-06 22:17:46,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 821 transitions. [2023-11-06 22:17:46,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:46,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 821 transitions. [2023-11-06 22:17:46,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.83333333333334) internal successors, (821), 6 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:46,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:46,838 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:46,838 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 172 flow. Second operand 6 states and 821 transitions. [2023-11-06 22:17:46,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 574 flow [2023-11-06 22:17:46,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 92 transitions, 553 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-11-06 22:17:46,867 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 187 flow [2023-11-06 22:17:46,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2023-11-06 22:17:46,869 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-11-06 22:17:46,869 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 187 flow [2023-11-06 22:17:46,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 129.27272727272728) internal successors, (1422), 11 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:46,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:46,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:46,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:17:47,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:47,077 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:47,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:47,077 INFO L85 PathProgramCache]: Analyzing trace with hash 622393743, now seen corresponding path program 3 times [2023-11-06 22:17:47,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:47,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508265980] [2023-11-06 22:17:47,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:17:47,078 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:17:47,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:47,078 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:47,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 22:17:47,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:17:47,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:17:47,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:17:47,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:47,330 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:17:47,330 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:17:47,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508265980] [2023-11-06 22:17:47,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508265980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:47,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:47,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:17:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945165815] [2023-11-06 22:17:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:47,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:17:47,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:47,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:17:47,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:17:47,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 292 [2023-11-06 22:17:47,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:47,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:47,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 292 [2023-11-06 22:17:47,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:48,014 INFO L124 PetriNetUnfolderBase]: 2268/3694 cut-off events. [2023-11-06 22:17:48,015 INFO L125 PetriNetUnfolderBase]: For 2944/2945 co-relation queries the response was YES. [2023-11-06 22:17:48,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10916 conditions, 3694 events. 2268/3694 cut-off events. For 2944/2945 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 21543 event pairs, 396 based on Foata normal form. 1/3676 useless extension candidates. Maximal degree in co-relation 10904. Up to 1746 conditions per place. [2023-11-06 22:17:48,031 INFO L140 encePairwiseOnDemand]: 288/292 looper letters, 64 selfloop transitions, 2 changer transitions 18/89 dead transitions. [2023-11-06 22:17:48,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 89 transitions, 571 flow [2023-11-06 22:17:48,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:17:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:17:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2023-11-06 22:17:48,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47465753424657536 [2023-11-06 22:17:48,035 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2023-11-06 22:17:48,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2023-11-06 22:17:48,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:48,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2023-11-06 22:17:48,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:48,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:48,043 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:48,044 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 187 flow. Second operand 5 states and 693 transitions. [2023-11-06 22:17:48,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 89 transitions, 571 flow [2023-11-06 22:17:48,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 561 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-06 22:17:48,100 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 196 flow [2023-11-06 22:17:48,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2023-11-06 22:17:48,102 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2023-11-06 22:17:48,103 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 196 flow [2023-11-06 22:17:48,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:48,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:48,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:48,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:17:48,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:48,316 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:48,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:48,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1075961809, now seen corresponding path program 4 times [2023-11-06 22:17:48,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:48,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494892934] [2023-11-06 22:17:48,317 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:17:48,317 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:17:48,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:48,318 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:48,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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 (12)] Waiting until timeout for monitored process [2023-11-06 22:17:48,486 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:17:48,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:17:48,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:17:48,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:48,648 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:17:48,648 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:17:48,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:48,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494892934] [2023-11-06 22:17:48,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494892934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:48,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:48,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:17:48,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991028399] [2023-11-06 22:17:48,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:48,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:17:48,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:48,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:17:48,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:17:48,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 292 [2023-11-06 22:17:48,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:48,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:48,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 292 [2023-11-06 22:17:48,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:49,458 INFO L124 PetriNetUnfolderBase]: 3384/5515 cut-off events. [2023-11-06 22:17:49,458 INFO L125 PetriNetUnfolderBase]: For 5096/5101 co-relation queries the response was YES. [2023-11-06 22:17:49,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16434 conditions, 5515 events. 3384/5515 cut-off events. For 5096/5101 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 34457 event pairs, 1397 based on Foata normal form. 1/5447 useless extension candidates. Maximal degree in co-relation 16420. Up to 2037 conditions per place. [2023-11-06 22:17:49,478 INFO L140 encePairwiseOnDemand]: 288/292 looper letters, 38 selfloop transitions, 1 changer transitions 44/87 dead transitions. [2023-11-06 22:17:49,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 87 transitions, 567 flow [2023-11-06 22:17:49,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:17:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:17:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2023-11-06 22:17:49,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47191780821917806 [2023-11-06 22:17:49,483 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2023-11-06 22:17:49,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2023-11-06 22:17:49,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:49,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2023-11-06 22:17:49,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:49,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:49,490 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:49,491 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 196 flow. Second operand 5 states and 689 transitions. [2023-11-06 22:17:49,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 87 transitions, 567 flow [2023-11-06 22:17:49,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 87 transitions, 563 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:17:49,609 INFO L231 Difference]: Finished difference. Result has 65 places, 41 transitions, 186 flow [2023-11-06 22:17:49,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=65, PETRI_TRANSITIONS=41} [2023-11-06 22:17:49,610 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2023-11-06 22:17:49,610 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 186 flow [2023-11-06 22:17:49,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:49,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:49,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:49,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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 (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:17:49,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:49,818 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:49,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:49,819 INFO L85 PathProgramCache]: Analyzing trace with hash 777995827, now seen corresponding path program 5 times [2023-11-06 22:17:49,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:49,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17397178] [2023-11-06 22:17:49,820 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:17:49,820 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:17:49,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:49,821 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:49,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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 (13)] Waiting until timeout for monitored process [2023-11-06 22:17:50,011 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:17:50,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:17:50,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:17:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:17:50,228 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:17:50,228 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:17:50,229 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:17:50,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:17:50,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:17:50,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:17:50,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:17:50,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:17:50,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:17:50,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:17:50,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:17:50,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:17:50,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:17:50,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:17:50,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:17:50,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:17:50,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:17:50,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:17:50,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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 (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:17:50,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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:17:50,454 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:50,461 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:17:50,461 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:17:50,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:17:50 BasicIcfg [2023-11-06 22:17:50,600 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:17:50,600 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:17:50,602 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:17:50,602 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:17:50,603 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:16" (3/4) ... [2023-11-06 22:17:50,605 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:17:50,606 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:17:50,606 INFO L158 Benchmark]: Toolchain (without parser) took 35729.48ms. Allocated memory was 90.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 64.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 275.5MB. Max. memory is 16.1GB. [2023-11-06 22:17:50,606 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 65.0MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:17:50,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 840.48ms. Allocated memory is still 90.2MB. Free memory was 64.3MB in the beginning and 63.2MB in the end (delta: 1.1MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2023-11-06 22:17:50,607 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.15ms. Allocated memory is still 90.2MB. Free memory was 63.2MB in the beginning and 60.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:17:50,608 INFO L158 Benchmark]: Boogie Preprocessor took 46.02ms. Allocated memory is still 90.2MB. Free memory was 60.2MB in the beginning and 58.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:17:50,608 INFO L158 Benchmark]: RCFGBuilder took 1010.66ms. Allocated memory is still 90.2MB. Free memory was 57.6MB in the beginning and 38.3MB in the end (delta: 19.3MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2023-11-06 22:17:50,608 INFO L158 Benchmark]: TraceAbstraction took 33709.84ms. Allocated memory was 90.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 37.3MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 245.9MB. Max. memory is 16.1GB. [2023-11-06 22:17:50,609 INFO L158 Benchmark]: Witness Printer took 5.66ms. Allocated memory is still 1.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:17:50,611 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 65.0MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 840.48ms. Allocated memory is still 90.2MB. Free memory was 64.3MB in the beginning and 63.2MB in the end (delta: 1.1MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.15ms. Allocated memory is still 90.2MB. Free memory was 63.2MB in the beginning and 60.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.02ms. Allocated memory is still 90.2MB. Free memory was 60.2MB in the beginning and 58.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1010.66ms. Allocated memory is still 90.2MB. Free memory was 57.6MB in the beginning and 38.3MB in the end (delta: 19.3MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 33709.84ms. Allocated memory was 90.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 37.3MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 245.9MB. Max. memory is 16.1GB. * Witness Printer took 5.66ms. Allocated memory is still 1.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.8s, 158 PlacesBefore, 54 PlacesAfterwards, 148 TransitionsBefore, 42 TransitionsAfterwards, 4046 CoEnabledTransitionPairs, 8 FixpointIterations, 48 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 140 TotalNumberOfCompositions, 12535 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4675, independent: 4389, independent conditional: 0, independent unconditional: 4389, dependent: 286, dependent conditional: 0, dependent unconditional: 286, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2159, independent: 2118, independent conditional: 0, independent unconditional: 2118, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4675, independent: 2271, independent conditional: 0, independent unconditional: 2271, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 2159, unknown conditional: 0, unknown unconditional: 2159] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 146, Positive conditional cache size: 0, Positive unconditional cache size: 146, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t489, ((void *)0), P0, ((void *)0))=0, t489={11:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t490, ((void *)0), P1, ((void *)0))=1, t489={11:0}, t490={15:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t491; [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t491, ((void *)0), P2, ((void *)0))=2, t489={11:0}, t490={15:0}, t491={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L859] 0 pthread_t t492; [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t492, ((void *)0), P3, ((void *)0))=3, t489={11:0}, t490={15:0}, t491={7:0}, t492={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L822] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L828] 4 __unbuffered_p3_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L755] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489={11:0}, t490={15:0}, t491={7:0}, t492={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix018_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={6:8}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 856]: 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: 858]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 188 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 33.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 513 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 423 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1995 IncrementalHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 10 mSDtfsCounter, 1995 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=6, InterpolantAutomatonStates: 50, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 2365 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1724 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:17:50,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14ac4c96-f843-4613-b7d4-09a068e6641d/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