./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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_765a670f-3c56-41b5-9be6-a4dc875db599/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 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:20:24,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:20:25,088 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:20:25,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:20:25,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:20:25,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:20:25,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:20:25,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:20:25,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:20:25,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:20:25,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:20:25,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:20:25,134 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:20:25,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:20:25,137 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:20:25,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:20:25,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:20:25,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:20:25,139 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:20:25,140 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:20:25,140 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:20:25,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:20:25,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:20:25,142 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:20:25,142 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:20:25,143 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:20:25,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:20:25,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:20:25,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:20:25,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:20:25,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:20:25,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:20:25,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:20:25,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:20:25,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:20:25,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:20:25,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:20:25,150 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:20:25,150 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_765a670f-3c56-41b5-9be6-a4dc875db599/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_765a670f-3c56-41b5-9be6-a4dc875db599/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 -> 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f [2023-11-06 22:20:25,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:20:25,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:20:25,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:20:25,490 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:20:25,491 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:20:25,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2023-11-06 22:20:28,688 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:20:29,084 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:20:29,090 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2023-11-06 22:20:29,113 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/data/3a6a85782/1d20f21e8e59436eb2830fdeada34f72/FLAG6bf6591f7 [2023-11-06 22:20:29,140 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/data/3a6a85782/1d20f21e8e59436eb2830fdeada34f72 [2023-11-06 22:20:29,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:20:29,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:20:29,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:20:29,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:20:29,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:20:29,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:20:29" (1/1) ... [2023-11-06 22:20:29,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b188ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:20:29, skipping insertion in model container [2023-11-06 22:20:29,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:20:29" (1/1) ... [2023-11-06 22:20:29,226 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:20:29,638 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:20:29,660 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:20:29,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:20:29,810 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:20:29,811 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:20:29,819 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:20:29,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:20:29 WrapperNode [2023-11-06 22:20:29,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:20:29,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:20:29,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:20:29,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:20:29,830 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:20:29" (1/1) ... [2023-11-06 22:20:29,869 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:20:29" (1/1) ... [2023-11-06 22:20:29,926 INFO L138 Inliner]: procedures = 176, calls = 70, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-11-06 22:20:29,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:20:29,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:20:29,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:20:29,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:20:29,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:20:29" (1/1) ... [2023-11-06 22:20:29,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:20:29" (1/1) ... [2023-11-06 22:20:29,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:20:29" (1/1) ... [2023-11-06 22:20:29,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:20:29" (1/1) ... [2023-11-06 22:20:29,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:20:29" (1/1) ... [2023-11-06 22:20:29,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:20:29" (1/1) ... [2023-11-06 22:20:30,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:20:29" (1/1) ... [2023-11-06 22:20:30,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:20:29" (1/1) ... [2023-11-06 22:20:30,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:20:30,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:20:30,010 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:20:30,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:20:30,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:20:29" (1/1) ... [2023-11-06 22:20:30,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:20:30,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:20:30,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:20:30,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:20:30,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:20:30,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:20:30,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:20:30,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:20:30,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:20:30,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:20:30,141 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:20:30,141 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:20:30,141 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:20:30,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:20:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:20:30,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:20:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:20:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:20:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:20:30,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:20:30,146 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:20:30,396 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:20:30,398 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:20:31,110 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:20:31,718 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:20:31,719 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:20:31,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:20:31 BoogieIcfgContainer [2023-11-06 22:20:31,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:20:31,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:20:31,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:20:31,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:20:31,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:20:29" (1/3) ... [2023-11-06 22:20:31,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9c0231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:20:31, skipping insertion in model container [2023-11-06 22:20:31,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:20:29" (2/3) ... [2023-11-06 22:20:31,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9c0231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:20:31, skipping insertion in model container [2023-11-06 22:20:31,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:20:31" (3/3) ... [2023-11-06 22:20:31,739 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.oepc-thin001_power.oepc.i [2023-11-06 22:20:31,765 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:20:31,766 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2023-11-06 22:20:31,767 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:20:31,964 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:20:32,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 171 transitions, 354 flow [2023-11-06 22:20:32,183 INFO L124 PetriNetUnfolderBase]: 3/168 cut-off events. [2023-11-06 22:20:32,183 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:20:32,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 3/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 215 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-11-06 22:20:32,192 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 171 transitions, 354 flow [2023-11-06 22:20:32,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 168 transitions, 345 flow [2023-11-06 22:20:32,210 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:20:32,233 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 168 transitions, 345 flow [2023-11-06 22:20:32,237 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 168 transitions, 345 flow [2023-11-06 22:20:32,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 168 transitions, 345 flow [2023-11-06 22:20:32,309 INFO L124 PetriNetUnfolderBase]: 3/168 cut-off events. [2023-11-06 22:20:32,309 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:20:32,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 3/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 214 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-11-06 22:20:32,316 INFO L119 LiptonReduction]: Number of co-enabled transitions 5746 [2023-11-06 22:20:47,411 INFO L134 LiptonReduction]: Checked pairs total: 19753 [2023-11-06 22:20:47,412 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-11-06 22:20:47,431 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:20:47,439 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;@68cbcd2a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:20:47,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2023-11-06 22:20:47,443 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:20:47,443 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:20:47,443 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:20:47,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:20:47,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:20:47,445 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:20:47,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:20:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash 964, now seen corresponding path program 1 times [2023-11-06 22:20:47,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:20:47,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528848268] [2023-11-06 22:20:47,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:20:47,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:20:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:20:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:20:47,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:20:47,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528848268] [2023-11-06 22:20:47,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528848268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:20:47,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:20:47,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:20:47,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737857773] [2023-11-06 22:20:47,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:20:47,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:20:47,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:20:47,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:20:47,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:20:47,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 335 [2023-11-06 22:20:47,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:47,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:20:47,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 335 [2023-11-06 22:20:47,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:20:49,459 INFO L124 PetriNetUnfolderBase]: 4714/6842 cut-off events. [2023-11-06 22:20:49,459 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:20:49,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13689 conditions, 6842 events. 4714/6842 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 41949 event pairs, 4714 based on Foata normal form. 0/3767 useless extension candidates. Maximal degree in co-relation 13678. Up to 6801 conditions per place. [2023-11-06 22:20:49,571 INFO L140 encePairwiseOnDemand]: 314/335 looper letters, 36 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2023-11-06 22:20:49,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 161 flow [2023-11-06 22:20:49,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:20:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:20:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 325 transitions. [2023-11-06 22:20:49,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48507462686567165 [2023-11-06 22:20:49,587 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 325 transitions. [2023-11-06 22:20:49,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 325 transitions. [2023-11-06 22:20:49,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:20:49,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 325 transitions. [2023-11-06 22:20:49,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 162.5) internal successors, (325), 2 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:49,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:49,608 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:49,610 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 2 states and 325 transitions. [2023-11-06 22:20:49,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 161 flow [2023-11-06 22:20:49,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:20:49,619 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2023-11-06 22:20:49,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-11-06 22:20:49,627 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2023-11-06 22:20:49,630 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2023-11-06 22:20:49,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:49,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:20:49,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:20:49,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:20:49,633 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:20:49,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:20:49,634 INFO L85 PathProgramCache]: Analyzing trace with hash 951944, now seen corresponding path program 1 times [2023-11-06 22:20:49,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:20:49,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239834206] [2023-11-06 22:20:49,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:20:49,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:20:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:20:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:20:50,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:20:50,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239834206] [2023-11-06 22:20:50,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239834206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:20:50,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:20:50,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:20:50,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196829833] [2023-11-06 22:20:50,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:20:50,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:20:50,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:20:50,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:20:50,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:20:50,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 335 [2023-11-06 22:20:50,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:50,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:20:50,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 335 [2023-11-06 22:20:50,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:20:51,211 INFO L124 PetriNetUnfolderBase]: 2095/3114 cut-off events. [2023-11-06 22:20:51,212 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:20:51,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6231 conditions, 3114 events. 2095/3114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 17237 event pairs, 2095 based on Foata normal form. 0/2095 useless extension candidates. Maximal degree in co-relation 6228. Up to 3080 conditions per place. [2023-11-06 22:20:51,246 INFO L140 encePairwiseOnDemand]: 328/335 looper letters, 29 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-11-06 22:20:51,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 134 flow [2023-11-06 22:20:51,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:20:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:20:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-11-06 22:20:51,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298507462686567 [2023-11-06 22:20:51,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-11-06 22:20:51,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-11-06 22:20:51,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:20:51,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-11-06 22:20:51,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:51,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:51,266 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:51,269 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 432 transitions. [2023-11-06 22:20:51,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 134 flow [2023-11-06 22:20:51,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:20:51,272 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-11-06 22:20:51,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-11-06 22:20:51,276 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-11-06 22:20:51,277 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-11-06 22:20:51,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:51,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:20:51,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:20:51,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:20:51,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:20:51,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:20:51,284 INFO L85 PathProgramCache]: Analyzing trace with hash 951943, now seen corresponding path program 1 times [2023-11-06 22:20:51,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:20:51,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372695819] [2023-11-06 22:20:51,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:20:51,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:20:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:20:51,407 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:20:51,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:20:51,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372695819] [2023-11-06 22:20:51,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372695819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:20:51,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:20:51,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:20:51,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033404090] [2023-11-06 22:20:51,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:20:51,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:20:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:20:51,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:20:51,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:20:51,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 335 [2023-11-06 22:20:51,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:51,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:20:51,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 335 [2023-11-06 22:20:51,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:20:52,472 INFO L124 PetriNetUnfolderBase]: 1885/2953 cut-off events. [2023-11-06 22:20:52,472 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:20:52,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5869 conditions, 2953 events. 1885/2953 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 16849 event pairs, 1131 based on Foata normal form. 0/2412 useless extension candidates. Maximal degree in co-relation 5865. Up to 1666 conditions per place. [2023-11-06 22:20:52,506 INFO L140 encePairwiseOnDemand]: 321/335 looper letters, 33 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2023-11-06 22:20:52,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 176 flow [2023-11-06 22:20:52,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:20:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:20:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-11-06 22:20:52,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42885572139303485 [2023-11-06 22:20:52,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-11-06 22:20:52,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-11-06 22:20:52,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:20:52,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-11-06 22:20:52,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:52,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:52,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:52,520 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 431 transitions. [2023-11-06 22:20:52,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 176 flow [2023-11-06 22:20:52,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 175 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:20:52,522 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 135 flow [2023-11-06 22:20:52,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-11-06 22:20:52,524 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -26 predicate places. [2023-11-06 22:20:52,525 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 135 flow [2023-11-06 22:20:52,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:52,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:20:52,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:20:52,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:20:52,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:20:52,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:20:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1282136612, now seen corresponding path program 1 times [2023-11-06 22:20:52,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:20:52,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776294496] [2023-11-06 22:20:52,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:20:52,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:20:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:20:52,889 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:20:52,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:20:52,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776294496] [2023-11-06 22:20:52,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776294496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:20:52,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:20:52,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:20:52,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368397660] [2023-11-06 22:20:52,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:20:52,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:20:52,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:20:52,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:20:52,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:20:52,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 335 [2023-11-06 22:20:52,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 135 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:20:52,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:20:52,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 335 [2023-11-06 22:20:52,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:20:53,687 INFO L124 PetriNetUnfolderBase]: 1671/2731 cut-off events. [2023-11-06 22:20:53,688 INFO L125 PetriNetUnfolderBase]: For 726/767 co-relation queries the response was YES. [2023-11-06 22:20:53,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6924 conditions, 2731 events. 1671/2731 cut-off events. For 726/767 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 16241 event pairs, 726 based on Foata normal form. 0/2408 useless extension candidates. Maximal degree in co-relation 6919. Up to 1713 conditions per place. [2023-11-06 22:20:53,716 INFO L140 encePairwiseOnDemand]: 331/335 looper letters, 55 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-11-06 22:20:53,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 337 flow [2023-11-06 22:20:53,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:20:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:20:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-11-06 22:20:53,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44776119402985076 [2023-11-06 22:20:53,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-11-06 22:20:53,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-11-06 22:20:53,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:20:53,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-11-06 22:20:53,725 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:20:53,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:53,730 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:53,730 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 135 flow. Second operand 3 states and 450 transitions. [2023-11-06 22:20:53,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 337 flow [2023-11-06 22:20:53,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:20:53,749 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 132 flow [2023-11-06 22:20:53,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-11-06 22:20:53,752 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2023-11-06 22:20:53,753 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 132 flow [2023-11-06 22:20:53,753 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:20:53,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:20:53,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:20:53,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:20:53,755 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:20:53,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:20:53,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1282136927, now seen corresponding path program 1 times [2023-11-06 22:20:53,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:20:53,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041870111] [2023-11-06 22:20:53,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:20:53,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:20:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:20:54,092 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:20:54,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:20:54,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041870111] [2023-11-06 22:20:54,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041870111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:20:54,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:20:54,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:20:54,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564691665] [2023-11-06 22:20:54,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:20:54,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:20:54,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:20:54,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:20:54,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:20:54,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 335 [2023-11-06 22:20:54,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 132 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:20:54,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:20:54,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 335 [2023-11-06 22:20:54,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:20:54,744 INFO L124 PetriNetUnfolderBase]: 1700/2928 cut-off events. [2023-11-06 22:20:54,744 INFO L125 PetriNetUnfolderBase]: For 1074/1143 co-relation queries the response was YES. [2023-11-06 22:20:54,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7256 conditions, 2928 events. 1700/2928 cut-off events. For 1074/1143 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 19621 event pairs, 302 based on Foata normal form. 16/2563 useless extension candidates. Maximal degree in co-relation 7250. Up to 1950 conditions per place. [2023-11-06 22:20:54,768 INFO L140 encePairwiseOnDemand]: 332/335 looper letters, 56 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-06 22:20:54,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 338 flow [2023-11-06 22:20:54,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:20:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:20:54,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-11-06 22:20:54,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4427860696517413 [2023-11-06 22:20:54,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-11-06 22:20:54,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-11-06 22:20:54,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:20:54,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-11-06 22:20:54,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:54,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:54,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:54,779 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 132 flow. Second operand 3 states and 445 transitions. [2023-11-06 22:20:54,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 338 flow [2023-11-06 22:20:54,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:20:54,782 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 134 flow [2023-11-06 22:20:54,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-11-06 22:20:54,784 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -24 predicate places. [2023-11-06 22:20:54,784 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 134 flow [2023-11-06 22:20:54,785 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:20:54,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:20:54,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:20:54,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:20:54,786 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:20:54,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:20:54,786 INFO L85 PathProgramCache]: Analyzing trace with hash -276903104, now seen corresponding path program 1 times [2023-11-06 22:20:54,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:20:54,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379836782] [2023-11-06 22:20:54,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:20:54,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:20:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:20:55,095 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:20:55,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:20:55,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379836782] [2023-11-06 22:20:55,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379836782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:20:55,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:20:55,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:20:55,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165391271] [2023-11-06 22:20:55,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:20:55,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:20:55,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:20:55,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:20:55,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:20:55,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 335 [2023-11-06 22:20:55,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:55,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:20:55,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 335 [2023-11-06 22:20:55,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:20:56,056 INFO L124 PetriNetUnfolderBase]: 1693/2738 cut-off events. [2023-11-06 22:20:56,057 INFO L125 PetriNetUnfolderBase]: For 638/638 co-relation queries the response was YES. [2023-11-06 22:20:56,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7441 conditions, 2738 events. 1693/2738 cut-off events. For 638/638 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 15876 event pairs, 733 based on Foata normal form. 0/2383 useless extension candidates. Maximal degree in co-relation 7434. Up to 1725 conditions per place. [2023-11-06 22:20:56,083 INFO L140 encePairwiseOnDemand]: 332/335 looper letters, 58 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2023-11-06 22:20:56,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 341 flow [2023-11-06 22:20:56,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:20:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:20:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2023-11-06 22:20:56,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42014925373134326 [2023-11-06 22:20:56,088 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2023-11-06 22:20:56,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2023-11-06 22:20:56,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:20:56,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2023-11-06 22:20:56,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:56,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:56,099 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:56,099 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 134 flow. Second operand 4 states and 563 transitions. [2023-11-06 22:20:56,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 341 flow [2023-11-06 22:20:56,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:20:56,104 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 132 flow [2023-11-06 22:20:56,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=4, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-11-06 22:20:56,105 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -24 predicate places. [2023-11-06 22:20:56,106 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 132 flow [2023-11-06 22:20:56,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:56,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:20:56,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:20:56,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:20:56,108 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:20:56,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:20:56,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1091537415, now seen corresponding path program 1 times [2023-11-06 22:20:56,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:20:56,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538193963] [2023-11-06 22:20:56,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:20:56,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:20:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:20:56,278 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:20:56,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:20:56,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538193963] [2023-11-06 22:20:56,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538193963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:20:56,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:20:56,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:20:56,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157645020] [2023-11-06 22:20:56,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:20:56,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:20:56,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:20:56,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:20:56,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:20:56,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 335 [2023-11-06 22:20:56,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:56,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:20:56,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 335 [2023-11-06 22:20:56,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:20:57,145 INFO L124 PetriNetUnfolderBase]: 1770/2917 cut-off events. [2023-11-06 22:20:57,145 INFO L125 PetriNetUnfolderBase]: For 570/570 co-relation queries the response was YES. [2023-11-06 22:20:57,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7772 conditions, 2917 events. 1770/2917 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 18082 event pairs, 378 based on Foata normal form. 30/2622 useless extension candidates. Maximal degree in co-relation 7765. Up to 1274 conditions per place. [2023-11-06 22:20:57,164 INFO L140 encePairwiseOnDemand]: 326/335 looper letters, 47 selfloop transitions, 13 changer transitions 0/62 dead transitions. [2023-11-06 22:20:57,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 320 flow [2023-11-06 22:20:57,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:20:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:20:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2023-11-06 22:20:57,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246268656716418 [2023-11-06 22:20:57,169 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2023-11-06 22:20:57,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2023-11-06 22:20:57,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:20:57,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2023-11-06 22:20:57,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:57,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:57,176 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:57,176 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 132 flow. Second operand 4 states and 569 transitions. [2023-11-06 22:20:57,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 320 flow [2023-11-06 22:20:57,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 313 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:20:57,179 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 163 flow [2023-11-06 22:20:57,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2023-11-06 22:20:57,181 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2023-11-06 22:20:57,181 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 163 flow [2023-11-06 22:20:57,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:57,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:20:57,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:20:57,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:20:57,182 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:20:57,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:20:57,183 INFO L85 PathProgramCache]: Analyzing trace with hash 804691445, now seen corresponding path program 1 times [2023-11-06 22:20:57,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:20:57,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983428623] [2023-11-06 22:20:57,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:20:57,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:20:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:20:57,406 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:20:57,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:20:57,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983428623] [2023-11-06 22:20:57,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983428623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:20:57,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:20:57,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:20:57,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634449694] [2023-11-06 22:20:57,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:20:57,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:20:57,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:20:57,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:20:57,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:20:57,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 335 [2023-11-06 22:20:57,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:57,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:20:57,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 335 [2023-11-06 22:20:57,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:20:58,122 INFO L124 PetriNetUnfolderBase]: 2792/4566 cut-off events. [2023-11-06 22:20:58,123 INFO L125 PetriNetUnfolderBase]: For 1899/2022 co-relation queries the response was YES. [2023-11-06 22:20:58,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12301 conditions, 4566 events. 2792/4566 cut-off events. For 1899/2022 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 30747 event pairs, 809 based on Foata normal form. 94/4214 useless extension candidates. Maximal degree in co-relation 12295. Up to 1575 conditions per place. [2023-11-06 22:20:58,158 INFO L140 encePairwiseOnDemand]: 331/335 looper letters, 84 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2023-11-06 22:20:58,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 91 transitions, 534 flow [2023-11-06 22:20:58,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:20:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:20:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2023-11-06 22:20:58,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4373134328358209 [2023-11-06 22:20:58,167 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2023-11-06 22:20:58,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2023-11-06 22:20:58,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:20:58,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2023-11-06 22:20:58,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:58,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:58,175 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:58,175 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 163 flow. Second operand 4 states and 586 transitions. [2023-11-06 22:20:58,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 91 transitions, 534 flow [2023-11-06 22:20:58,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 91 transitions, 506 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:20:58,182 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 170 flow [2023-11-06 22:20:58,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-06 22:20:58,183 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -21 predicate places. [2023-11-06 22:20:58,183 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 170 flow [2023-11-06 22:20:58,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:58,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:20:58,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:20:58,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:20:58,185 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:20:58,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:20:58,185 INFO L85 PathProgramCache]: Analyzing trace with hash -522021561, now seen corresponding path program 1 times [2023-11-06 22:20:58,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:20:58,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207951325] [2023-11-06 22:20:58,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:20:58,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:20:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:20:58,399 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:20:58,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:20:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207951325] [2023-11-06 22:20:58,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207951325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:20:58,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:20:58,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:20:58,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474820556] [2023-11-06 22:20:58,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:20:58,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:20:58,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:20:58,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:20:58,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:20:58,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 335 [2023-11-06 22:20:58,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:58,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:20:58,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 335 [2023-11-06 22:20:58,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:20:59,196 INFO L124 PetriNetUnfolderBase]: 2239/3617 cut-off events. [2023-11-06 22:20:59,196 INFO L125 PetriNetUnfolderBase]: For 1384/1394 co-relation queries the response was YES. [2023-11-06 22:20:59,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10354 conditions, 3617 events. 2239/3617 cut-off events. For 1384/1394 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 22411 event pairs, 962 based on Foata normal form. 10/3150 useless extension candidates. Maximal degree in co-relation 10346. Up to 1363 conditions per place. [2023-11-06 22:20:59,220 INFO L140 encePairwiseOnDemand]: 324/335 looper letters, 46 selfloop transitions, 11 changer transitions 0/59 dead transitions. [2023-11-06 22:20:59,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 353 flow [2023-11-06 22:20:59,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:20:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:20:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2023-11-06 22:20:59,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4044776119402985 [2023-11-06 22:20:59,224 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2023-11-06 22:20:59,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2023-11-06 22:20:59,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:20:59,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2023-11-06 22:20:59,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:59,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:59,231 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:59,232 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 170 flow. Second operand 4 states and 542 transitions. [2023-11-06 22:20:59,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 353 flow [2023-11-06 22:20:59,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:20:59,239 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 233 flow [2023-11-06 22:20:59,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-06 22:20:59,240 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -18 predicate places. [2023-11-06 22:20:59,241 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 233 flow [2023-11-06 22:20:59,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:59,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:20:59,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:20:59,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:20:59,242 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:20:59,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:20:59,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2062329523, now seen corresponding path program 1 times [2023-11-06 22:20:59,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:20:59,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620013654] [2023-11-06 22:20:59,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:20:59,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:20:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:20:59,621 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:20:59,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:20:59,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620013654] [2023-11-06 22:20:59,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620013654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:20:59,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:20:59,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:20:59,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230431217] [2023-11-06 22:20:59,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:20:59,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:20:59,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:20:59,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:20:59,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:20:59,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 335 [2023-11-06 22:20:59,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:20:59,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:20:59,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 335 [2023-11-06 22:20:59,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:21:00,308 INFO L124 PetriNetUnfolderBase]: 1994/3328 cut-off events. [2023-11-06 22:21:00,308 INFO L125 PetriNetUnfolderBase]: For 2720/2732 co-relation queries the response was YES. [2023-11-06 22:21:00,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10406 conditions, 3328 events. 1994/3328 cut-off events. For 2720/2732 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 21430 event pairs, 400 based on Foata normal form. 12/3031 useless extension candidates. Maximal degree in co-relation 10397. Up to 2604 conditions per place. [2023-11-06 22:21:00,334 INFO L140 encePairwiseOnDemand]: 332/335 looper letters, 55 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-06 22:21:00,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 448 flow [2023-11-06 22:21:00,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:21:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:21:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-11-06 22:21:00,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43283582089552236 [2023-11-06 22:21:00,337 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-11-06 22:21:00,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-11-06 22:21:00,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:21:00,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-11-06 22:21:00,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:00,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:00,343 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:00,343 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 233 flow. Second operand 3 states and 435 transitions. [2023-11-06 22:21:00,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 448 flow [2023-11-06 22:21:00,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 442 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:21:00,355 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 237 flow [2023-11-06 22:21:00,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-11-06 22:21:00,356 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -16 predicate places. [2023-11-06 22:21:00,356 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 237 flow [2023-11-06 22:21:00,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:00,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:21:00,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:00,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:21:00,358 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:21:00,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:00,358 INFO L85 PathProgramCache]: Analyzing trace with hash 997200323, now seen corresponding path program 1 times [2023-11-06 22:21:00,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:00,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41484238] [2023-11-06 22:21:00,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:00,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:00,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:21:00,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:00,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41484238] [2023-11-06 22:21:00,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41484238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:00,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:00,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:21:00,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427818140] [2023-11-06 22:21:00,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:00,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:21:00,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:00,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:21:00,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:21:00,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 335 [2023-11-06 22:21:00,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:00,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:21:00,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 335 [2023-11-06 22:21:00,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:21:01,623 INFO L124 PetriNetUnfolderBase]: 1930/3190 cut-off events. [2023-11-06 22:21:01,623 INFO L125 PetriNetUnfolderBase]: For 2100/2108 co-relation queries the response was YES. [2023-11-06 22:21:01,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10211 conditions, 3190 events. 1930/3190 cut-off events. For 2100/2108 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 19986 event pairs, 741 based on Foata normal form. 49/3049 useless extension candidates. Maximal degree in co-relation 10200. Up to 1269 conditions per place. [2023-11-06 22:21:01,645 INFO L140 encePairwiseOnDemand]: 323/335 looper letters, 57 selfloop transitions, 14 changer transitions 0/73 dead transitions. [2023-11-06 22:21:01,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 506 flow [2023-11-06 22:21:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:21:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:21:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions. [2023-11-06 22:21:01,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870646766169154 [2023-11-06 22:21:01,651 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 778 transitions. [2023-11-06 22:21:01,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions. [2023-11-06 22:21:01,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:21:01,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions. [2023-11-06 22:21:01,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:01,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 335.0) internal successors, (2345), 7 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:01,661 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 335.0) internal successors, (2345), 7 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:01,661 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 237 flow. Second operand 6 states and 778 transitions. [2023-11-06 22:21:01,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 506 flow [2023-11-06 22:21:01,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:21:01,672 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 319 flow [2023-11-06 22:21:01,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-11-06 22:21:01,673 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -11 predicate places. [2023-11-06 22:21:01,673 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 319 flow [2023-11-06 22:21:01,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:01,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:21:01,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:01,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:21:01,675 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:21:01,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:01,675 INFO L85 PathProgramCache]: Analyzing trace with hash 997200372, now seen corresponding path program 1 times [2023-11-06 22:21:01,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:01,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521841862] [2023-11-06 22:21:01,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:01,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:02,307 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:21:02,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:02,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521841862] [2023-11-06 22:21:02,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521841862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:02,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:02,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:21:02,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121029010] [2023-11-06 22:21:02,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:02,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:21:02,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:02,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:21:02,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:21:02,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 335 [2023-11-06 22:21:02,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 319 flow. Second operand has 9 states, 9 states have (on average 118.55555555555556) internal successors, (1067), 9 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:02,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:21:02,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 335 [2023-11-06 22:21:02,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:21:03,747 INFO L124 PetriNetUnfolderBase]: 1335/2298 cut-off events. [2023-11-06 22:21:03,748 INFO L125 PetriNetUnfolderBase]: For 3130/3140 co-relation queries the response was YES. [2023-11-06 22:21:03,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7852 conditions, 2298 events. 1335/2298 cut-off events. For 3130/3140 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 14109 event pairs, 67 based on Foata normal form. 6/2288 useless extension candidates. Maximal degree in co-relation 7840. Up to 594 conditions per place. [2023-11-06 22:21:03,759 INFO L140 encePairwiseOnDemand]: 327/335 looper letters, 67 selfloop transitions, 17 changer transitions 1/92 dead transitions. [2023-11-06 22:21:03,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 657 flow [2023-11-06 22:21:03,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:21:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:21:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1119 transitions. [2023-11-06 22:21:03,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3711442786069652 [2023-11-06 22:21:03,766 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1119 transitions. [2023-11-06 22:21:03,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1119 transitions. [2023-11-06 22:21:03,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:21:03,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1119 transitions. [2023-11-06 22:21:03,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:03,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:03,780 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:03,780 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 319 flow. Second operand 9 states and 1119 transitions. [2023-11-06 22:21:03,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 657 flow [2023-11-06 22:21:03,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 92 transitions, 641 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:21:03,802 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 355 flow [2023-11-06 22:21:03,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=355, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2023-11-06 22:21:03,803 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -5 predicate places. [2023-11-06 22:21:03,803 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 355 flow [2023-11-06 22:21:03,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.55555555555556) internal successors, (1067), 9 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:03,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:21:03,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:03,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:21:03,805 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:21:03,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:03,805 INFO L85 PathProgramCache]: Analyzing trace with hash 459414890, now seen corresponding path program 1 times [2023-11-06 22:21:03,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:03,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205091430] [2023-11-06 22:21:03,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:03,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:04,086 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:21:04,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:04,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205091430] [2023-11-06 22:21:04,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205091430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:04,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:04,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:21:04,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058543199] [2023-11-06 22:21:04,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:04,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:21:04,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:04,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:21:04,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:21:04,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 335 [2023-11-06 22:21:04,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:04,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:21:04,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 335 [2023-11-06 22:21:04,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:21:04,964 INFO L124 PetriNetUnfolderBase]: 2699/4445 cut-off events. [2023-11-06 22:21:04,964 INFO L125 PetriNetUnfolderBase]: For 9098/9280 co-relation queries the response was YES. [2023-11-06 22:21:04,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15627 conditions, 4445 events. 2699/4445 cut-off events. For 9098/9280 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 28672 event pairs, 636 based on Foata normal form. 84/4453 useless extension candidates. Maximal degree in co-relation 15612. Up to 1755 conditions per place. [2023-11-06 22:21:04,984 INFO L140 encePairwiseOnDemand]: 331/335 looper letters, 98 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2023-11-06 22:21:04,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 109 transitions, 1004 flow [2023-11-06 22:21:04,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:21:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:21:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2023-11-06 22:21:04,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43208955223880596 [2023-11-06 22:21:04,988 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2023-11-06 22:21:04,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2023-11-06 22:21:04,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:21:04,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2023-11-06 22:21:04,991 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:21:04,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:04,995 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:04,995 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 355 flow. Second operand 4 states and 579 transitions. [2023-11-06 22:21:04,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 109 transitions, 1004 flow [2023-11-06 22:21:05,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 109 transitions, 944 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-06 22:21:05,028 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 375 flow [2023-11-06 22:21:05,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=375, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2023-11-06 22:21:05,029 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -5 predicate places. [2023-11-06 22:21:05,030 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 375 flow [2023-11-06 22:21:05,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:05,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:21:05,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:05,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:21:05,031 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:21:05,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:05,031 INFO L85 PathProgramCache]: Analyzing trace with hash 848442067, now seen corresponding path program 1 times [2023-11-06 22:21:05,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:05,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449360057] [2023-11-06 22:21:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:05,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:05,138 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:21:05,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:05,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449360057] [2023-11-06 22:21:05,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449360057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:05,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:05,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:21:05,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681039311] [2023-11-06 22:21:05,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:05,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:21:05,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:05,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:21:05,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:21:05,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 335 [2023-11-06 22:21:05,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 375 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:05,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:21:05,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 335 [2023-11-06 22:21:05,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:21:05,946 INFO L124 PetriNetUnfolderBase]: 2212/3564 cut-off events. [2023-11-06 22:21:05,946 INFO L125 PetriNetUnfolderBase]: For 4740/4760 co-relation queries the response was YES. [2023-11-06 22:21:05,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12304 conditions, 3564 events. 2212/3564 cut-off events. For 4740/4760 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 21320 event pairs, 1376 based on Foata normal form. 89/3648 useless extension candidates. Maximal degree in co-relation 12287. Up to 2810 conditions per place. [2023-11-06 22:21:05,959 INFO L140 encePairwiseOnDemand]: 324/335 looper letters, 18 selfloop transitions, 1 changer transitions 37/58 dead transitions. [2023-11-06 22:21:05,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 58 transitions, 507 flow [2023-11-06 22:21:05,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:21:05,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:21:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-11-06 22:21:05,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4007462686567164 [2023-11-06 22:21:05,963 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-11-06 22:21:05,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-11-06 22:21:05,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:21:05,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-11-06 22:21:05,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:05,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:05,970 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:05,970 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 375 flow. Second operand 4 states and 537 transitions. [2023-11-06 22:21:05,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 58 transitions, 507 flow [2023-11-06 22:21:06,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 58 transitions, 478 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-11-06 22:21:06,010 INFO L231 Difference]: Finished difference. Result has 60 places, 21 transitions, 96 flow [2023-11-06 22:21:06,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=60, PETRI_TRANSITIONS=21} [2023-11-06 22:21:06,012 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -11 predicate places. [2023-11-06 22:21:06,012 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 21 transitions, 96 flow [2023-11-06 22:21:06,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:06,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:21:06,013 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:21:06,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:21:06,014 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:21:06,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1917847712, now seen corresponding path program 1 times [2023-11-06 22:21:06,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:06,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139448101] [2023-11-06 22:21:06,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:06,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:21:07,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:07,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139448101] [2023-11-06 22:21:07,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139448101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:07,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:07,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:21:07,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618392048] [2023-11-06 22:21:07,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:07,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:21:07,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:07,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:21:07,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:21:08,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 335 [2023-11-06 22:21:08,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 21 transitions, 96 flow. Second operand has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:08,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:21:08,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 335 [2023-11-06 22:21:08,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:21:08,561 INFO L124 PetriNetUnfolderBase]: 226/402 cut-off events. [2023-11-06 22:21:08,562 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2023-11-06 22:21:08,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 402 events. 226/402 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1499 event pairs, 104 based on Foata normal form. 4/404 useless extension candidates. Maximal degree in co-relation 1140. Up to 276 conditions per place. [2023-11-06 22:21:08,565 INFO L140 encePairwiseOnDemand]: 328/335 looper letters, 31 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2023-11-06 22:21:08,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 40 transitions, 233 flow [2023-11-06 22:21:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:21:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:21:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 723 transitions. [2023-11-06 22:21:08,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3597014925373134 [2023-11-06 22:21:08,569 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 723 transitions. [2023-11-06 22:21:08,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 723 transitions. [2023-11-06 22:21:08,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:21:08,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 723 transitions. [2023-11-06 22:21:08,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.5) internal successors, (723), 6 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:21:08,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 335.0) internal successors, (2345), 7 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:08,579 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 335.0) internal successors, (2345), 7 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:08,579 INFO L175 Difference]: Start difference. First operand has 60 places, 21 transitions, 96 flow. Second operand 6 states and 723 transitions. [2023-11-06 22:21:08,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 40 transitions, 233 flow [2023-11-06 22:21:08,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 188 flow, removed 9 selfloop flow, removed 12 redundant places. [2023-11-06 22:21:08,586 INFO L231 Difference]: Finished difference. Result has 49 places, 27 transitions, 113 flow [2023-11-06 22:21:08,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=113, PETRI_PLACES=49, PETRI_TRANSITIONS=27} [2023-11-06 22:21:08,589 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -22 predicate places. [2023-11-06 22:21:08,590 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 27 transitions, 113 flow [2023-11-06 22:21:08,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:08,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:21:08,591 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:21:08,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:21:08,591 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:21:08,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:08,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1211869952, now seen corresponding path program 2 times [2023-11-06 22:21:08,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:08,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423804825] [2023-11-06 22:21:08,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:08,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:21:10,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:10,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423804825] [2023-11-06 22:21:10,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423804825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:10,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:10,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:21:10,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565530156] [2023-11-06 22:21:10,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:10,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:21:10,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:10,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:21:10,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:21:10,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 335 [2023-11-06 22:21:10,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 27 transitions, 113 flow. Second operand has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:10,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:21:10,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 335 [2023-11-06 22:21:10,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:21:11,211 INFO L124 PetriNetUnfolderBase]: 287/508 cut-off events. [2023-11-06 22:21:11,211 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2023-11-06 22:21:11,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1298 conditions, 508 events. 287/508 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2039 event pairs, 92 based on Foata normal form. 4/512 useless extension candidates. Maximal degree in co-relation 1288. Up to 257 conditions per place. [2023-11-06 22:21:11,214 INFO L140 encePairwiseOnDemand]: 328/335 looper letters, 31 selfloop transitions, 12 changer transitions 0/45 dead transitions. [2023-11-06 22:21:11,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 258 flow [2023-11-06 22:21:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:21:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:21:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 845 transitions. [2023-11-06 22:21:11,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3603411513859275 [2023-11-06 22:21:11,218 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 845 transitions. [2023-11-06 22:21:11,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 845 transitions. [2023-11-06 22:21:11,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:21:11,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 845 transitions. [2023-11-06 22:21:11,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:11,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 335.0) internal successors, (2680), 8 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:11,229 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 335.0) internal successors, (2680), 8 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:11,229 INFO L175 Difference]: Start difference. First operand has 49 places, 27 transitions, 113 flow. Second operand 7 states and 845 transitions. [2023-11-06 22:21:11,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 258 flow [2023-11-06 22:21:11,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:21:11,232 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 183 flow [2023-11-06 22:21:11,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=183, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2023-11-06 22:21:11,233 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -14 predicate places. [2023-11-06 22:21:11,233 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 183 flow [2023-11-06 22:21:11,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:11,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:21:11,235 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:21:11,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:21:11,235 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:21:11,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:11,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1686301442, now seen corresponding path program 3 times [2023-11-06 22:21:11,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:11,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659531442] [2023-11-06 22:21:11,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:11,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:12,942 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:21:12,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:12,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659531442] [2023-11-06 22:21:12,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659531442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:12,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:12,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:21:12,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463915787] [2023-11-06 22:21:12,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:12,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:21:12,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:12,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:21:12,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:21:13,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 335 [2023-11-06 22:21:13,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 33 transitions, 183 flow. Second operand has 9 states, 9 states have (on average 113.55555555555556) internal successors, (1022), 9 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:13,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:21:13,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 335 [2023-11-06 22:21:13,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:21:13,968 INFO L124 PetriNetUnfolderBase]: 279/493 cut-off events. [2023-11-06 22:21:13,969 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2023-11-06 22:21:13,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 493 events. 279/493 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1977 event pairs, 110 based on Foata normal form. 4/495 useless extension candidates. Maximal degree in co-relation 1371. Up to 290 conditions per place. [2023-11-06 22:21:13,971 INFO L140 encePairwiseOnDemand]: 329/335 looper letters, 30 selfloop transitions, 14 changer transitions 0/46 dead transitions. [2023-11-06 22:21:13,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 46 transitions, 310 flow [2023-11-06 22:21:13,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:21:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:21:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 934 transitions. [2023-11-06 22:21:13,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3485074626865672 [2023-11-06 22:21:13,976 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 934 transitions. [2023-11-06 22:21:13,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 934 transitions. [2023-11-06 22:21:13,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:21:13,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 934 transitions. [2023-11-06 22:21:13,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.75) internal successors, (934), 8 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:13,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 335.0) internal successors, (3015), 9 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:13,988 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 335.0) internal successors, (3015), 9 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:13,988 INFO L175 Difference]: Start difference. First operand has 57 places, 33 transitions, 183 flow. Second operand 8 states and 934 transitions. [2023-11-06 22:21:13,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 46 transitions, 310 flow [2023-11-06 22:21:13,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 46 transitions, 293 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 22:21:13,992 INFO L231 Difference]: Finished difference. Result has 63 places, 34 transitions, 213 flow [2023-11-06 22:21:13,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=63, PETRI_TRANSITIONS=34} [2023-11-06 22:21:13,993 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -8 predicate places. [2023-11-06 22:21:13,993 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 34 transitions, 213 flow [2023-11-06 22:21:13,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.55555555555556) internal successors, (1022), 9 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:13,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:21:13,994 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:21:13,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:21:13,995 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:21:13,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash -887206626, now seen corresponding path program 1 times [2023-11-06 22:21:13,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:13,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902342323] [2023-11-06 22:21:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:14,238 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:21:14,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:14,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902342323] [2023-11-06 22:21:14,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902342323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:14,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:14,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:21:14,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100461811] [2023-11-06 22:21:14,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:14,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:21:14,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:14,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:21:14,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:21:14,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 335 [2023-11-06 22:21:14,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 34 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:14,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:21:14,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 335 [2023-11-06 22:21:14,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:21:14,380 INFO L124 PetriNetUnfolderBase]: 179/356 cut-off events. [2023-11-06 22:21:14,380 INFO L125 PetriNetUnfolderBase]: For 385/385 co-relation queries the response was YES. [2023-11-06 22:21:14,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 356 events. 179/356 cut-off events. For 385/385 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1546 event pairs, 37 based on Foata normal form. 11/362 useless extension candidates. Maximal degree in co-relation 994. Up to 297 conditions per place. [2023-11-06 22:21:14,383 INFO L140 encePairwiseOnDemand]: 330/335 looper letters, 40 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2023-11-06 22:21:14,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 49 transitions, 374 flow [2023-11-06 22:21:14,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:21:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:21:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-11-06 22:21:14,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41890547263681593 [2023-11-06 22:21:14,387 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-11-06 22:21:14,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-11-06 22:21:14,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:21:14,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-11-06 22:21:14,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:14,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:14,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:14,393 INFO L175 Difference]: Start difference. First operand has 63 places, 34 transitions, 213 flow. Second operand 3 states and 421 transitions. [2023-11-06 22:21:14,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 49 transitions, 374 flow [2023-11-06 22:21:14,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 49 transitions, 336 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-06 22:21:14,397 INFO L231 Difference]: Finished difference. Result has 61 places, 37 transitions, 208 flow [2023-11-06 22:21:14,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=61, PETRI_TRANSITIONS=37} [2023-11-06 22:21:14,398 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -10 predicate places. [2023-11-06 22:21:14,398 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 208 flow [2023-11-06 22:21:14,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:14,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:21:14,399 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:21:14,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:21:14,399 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:21:14,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:14,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1621833700, now seen corresponding path program 1 times [2023-11-06 22:21:14,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:14,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965414537] [2023-11-06 22:21:14,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:14,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:14,631 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:21:14,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:14,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965414537] [2023-11-06 22:21:14,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965414537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:14,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:14,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:21:14,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066759348] [2023-11-06 22:21:14,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:14,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:21:14,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:14,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:21:14,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:21:14,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 335 [2023-11-06 22:21:14,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 37 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:14,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:21:14,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 335 [2023-11-06 22:21:14,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:21:14,779 INFO L124 PetriNetUnfolderBase]: 111/247 cut-off events. [2023-11-06 22:21:14,779 INFO L125 PetriNetUnfolderBase]: For 350/359 co-relation queries the response was YES. [2023-11-06 22:21:14,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 247 events. 111/247 cut-off events. For 350/359 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1003 event pairs, 11 based on Foata normal form. 24/267 useless extension candidates. Maximal degree in co-relation 841. Up to 104 conditions per place. [2023-11-06 22:21:14,781 INFO L140 encePairwiseOnDemand]: 330/335 looper letters, 47 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2023-11-06 22:21:14,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 426 flow [2023-11-06 22:21:14,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:21:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:21:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2023-11-06 22:21:14,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4171641791044776 [2023-11-06 22:21:14,785 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2023-11-06 22:21:14,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2023-11-06 22:21:14,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:21:14,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2023-11-06 22:21:14,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:14,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:14,792 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:14,792 INFO L175 Difference]: Start difference. First operand has 61 places, 37 transitions, 208 flow. Second operand 4 states and 559 transitions. [2023-11-06 22:21:14,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 426 flow [2023-11-06 22:21:14,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:21:14,796 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 244 flow [2023-11-06 22:21:14,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2023-11-06 22:21:14,797 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -7 predicate places. [2023-11-06 22:21:14,797 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 244 flow [2023-11-06 22:21:14,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:14,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:21:14,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:14,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:21:14,798 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:21:14,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:14,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1181054401, now seen corresponding path program 1 times [2023-11-06 22:21:14,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:14,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103072562] [2023-11-06 22:21:14,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:14,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:15,089 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:21:15,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:15,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103072562] [2023-11-06 22:21:15,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103072562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:15,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:15,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:21:15,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574887545] [2023-11-06 22:21:15,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:15,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:21:15,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:15,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:21:15,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:21:15,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 335 [2023-11-06 22:21:15,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:15,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:21:15,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 335 [2023-11-06 22:21:15,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:21:15,256 INFO L124 PetriNetUnfolderBase]: 93/207 cut-off events. [2023-11-06 22:21:15,256 INFO L125 PetriNetUnfolderBase]: For 577/595 co-relation queries the response was YES. [2023-11-06 22:21:15,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 207 events. 93/207 cut-off events. For 577/595 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 857 event pairs, 8 based on Foata normal form. 21/224 useless extension candidates. Maximal degree in co-relation 796. Up to 95 conditions per place. [2023-11-06 22:21:15,258 INFO L140 encePairwiseOnDemand]: 330/335 looper letters, 44 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2023-11-06 22:21:15,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 59 transitions, 450 flow [2023-11-06 22:21:15,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:21:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:21:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2023-11-06 22:21:15,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41134328358208955 [2023-11-06 22:21:15,261 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2023-11-06 22:21:15,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2023-11-06 22:21:15,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:21:15,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2023-11-06 22:21:15,265 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:21:15,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 335.0) internal successors, (2010), 6 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:15,269 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 335.0) internal successors, (2010), 6 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:15,269 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 244 flow. Second operand 5 states and 689 transitions. [2023-11-06 22:21:15,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 59 transitions, 450 flow [2023-11-06 22:21:15,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 59 transitions, 417 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-06 22:21:15,273 INFO L231 Difference]: Finished difference. Result has 65 places, 40 transitions, 245 flow [2023-11-06 22:21:15,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2023-11-06 22:21:15,274 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -6 predicate places. [2023-11-06 22:21:15,275 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 40 transitions, 245 flow [2023-11-06 22:21:15,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:15,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:21:15,276 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:21:15,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:21:15,276 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:21:15,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:15,277 INFO L85 PathProgramCache]: Analyzing trace with hash -930664658, now seen corresponding path program 1 times [2023-11-06 22:21:15,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:15,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014567796] [2023-11-06 22:21:15,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:15,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:15,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:21:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:15,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:21:15,540 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:21:15,541 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2023-11-06 22:21:15,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2023-11-06 22:21:15,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2023-11-06 22:21:15,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2023-11-06 22:21:15,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2023-11-06 22:21:15,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2023-11-06 22:21:15,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2023-11-06 22:21:15,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2023-11-06 22:21:15,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2023-11-06 22:21:15,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2023-11-06 22:21:15,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2023-11-06 22:21:15,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2023-11-06 22:21:15,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2023-11-06 22:21:15,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2023-11-06 22:21:15,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2023-11-06 22:21:15,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2023-11-06 22:21:15,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2023-11-06 22:21:15,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2023-11-06 22:21:15,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2023-11-06 22:21:15,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2023-11-06 22:21:15,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2023-11-06 22:21:15,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2023-11-06 22:21:15,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2023-11-06 22:21:15,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2023-11-06 22:21:15,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2023-11-06 22:21:15,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2023-11-06 22:21:15,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2023-11-06 22:21:15,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2023-11-06 22:21:15,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2023-11-06 22:21:15,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2023-11-06 22:21:15,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2023-11-06 22:21:15,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2023-11-06 22:21:15,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2023-11-06 22:21:15,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2023-11-06 22:21:15,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2023-11-06 22:21:15,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2023-11-06 22:21:15,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2023-11-06 22:21:15,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2023-11-06 22:21:15,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2023-11-06 22:21:15,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2023-11-06 22:21:15,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2023-11-06 22:21:15,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2023-11-06 22:21:15,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2023-11-06 22:21:15,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2023-11-06 22:21:15,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2023-11-06 22:21:15,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2023-11-06 22:21:15,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2023-11-06 22:21:15,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2023-11-06 22:21:15,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2023-11-06 22:21:15,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2023-11-06 22:21:15,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2023-11-06 22:21:15,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2023-11-06 22:21:15,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2023-11-06 22:21:15,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2023-11-06 22:21:15,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2023-11-06 22:21:15,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2023-11-06 22:21:15,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2023-11-06 22:21:15,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2023-11-06 22:21:15,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2023-11-06 22:21:15,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2023-11-06 22:21:15,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2023-11-06 22:21:15,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:21:15,560 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:15,569 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:21:15,569 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:21:15,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:21:15 BasicIcfg [2023-11-06 22:21:15,705 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:21:15,705 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:21:15,706 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:21:15,706 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:21:15,707 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:20:31" (3/4) ... [2023-11-06 22:21:15,710 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:21:15,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:21:15,713 INFO L158 Benchmark]: Toolchain (without parser) took 46565.40ms. Allocated memory was 130.0MB in the beginning and 1.0GB in the end (delta: 908.1MB). Free memory was 83.5MB in the beginning and 876.5MB in the end (delta: -793.0MB). Peak memory consumption was 117.2MB. Max. memory is 16.1GB. [2023-11-06 22:21:15,713 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 107.0MB. Free memory was 49.3MB in the beginning and 49.2MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:21:15,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 670.26ms. Allocated memory is still 130.0MB. Free memory was 83.2MB in the beginning and 59.8MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:21:15,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.66ms. Allocated memory is still 130.0MB. Free memory was 59.8MB in the beginning and 57.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:21:15,715 INFO L158 Benchmark]: Boogie Preprocessor took 81.40ms. Allocated memory is still 130.0MB. Free memory was 57.2MB in the beginning and 100.2MB in the end (delta: -43.0MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2023-11-06 22:21:15,715 INFO L158 Benchmark]: RCFGBuilder took 1713.13ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 100.2MB in the beginning and 81.8MB in the end (delta: 18.4MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. [2023-11-06 22:21:15,716 INFO L158 Benchmark]: TraceAbstraction took 43977.96ms. Allocated memory was 161.5MB in the beginning and 1.0GB in the end (delta: 876.6MB). Free memory was 80.7MB in the beginning and 877.5MB in the end (delta: -796.8MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. [2023-11-06 22:21:15,716 INFO L158 Benchmark]: Witness Printer took 6.73ms. Allocated memory is still 1.0GB. Free memory was 877.5MB in the beginning and 876.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:21:15,723 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.34ms. Allocated memory is still 107.0MB. Free memory was 49.3MB in the beginning and 49.2MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 670.26ms. Allocated memory is still 130.0MB. Free memory was 83.2MB in the beginning and 59.8MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.66ms. Allocated memory is still 130.0MB. Free memory was 59.8MB in the beginning and 57.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.40ms. Allocated memory is still 130.0MB. Free memory was 57.2MB in the beginning and 100.2MB in the end (delta: -43.0MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1713.13ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 100.2MB in the beginning and 81.8MB in the end (delta: 18.4MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. * TraceAbstraction took 43977.96ms. Allocated memory was 161.5MB in the beginning and 1.0GB in the end (delta: 876.6MB). Free memory was 80.7MB in the beginning and 877.5MB in the end (delta: -796.8MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. * Witness Printer took 6.73ms. Allocated memory is still 1.0GB. Free memory was 877.5MB in the beginning and 876.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.2s, 175 PlacesBefore, 71 PlacesAfterwards, 168 TransitionsBefore, 62 TransitionsAfterwards, 5746 CoEnabledTransitionPairs, 7 FixpointIterations, 70 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 164 TotalNumberOfCompositions, 19753 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8487, independent: 8100, independent conditional: 0, independent unconditional: 8100, dependent: 387, dependent conditional: 0, dependent unconditional: 387, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2750, independent: 2683, independent conditional: 0, independent unconditional: 2683, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8487, independent: 5417, independent conditional: 0, independent unconditional: 5417, dependent: 320, dependent conditional: 0, dependent unconditional: 320, unknown: 2750, unknown conditional: 0, unknown unconditional: 2750] , Statistics on independence cache: Total cache size (in pairs): 407, Positive cache size: 372, Positive conditional cache size: 0, Positive unconditional cache size: 372, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1937; [L838] FCALL, FORK 0 pthread_create(&t1937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1937, ((void *)0), P0, ((void *)0))=9, t1937={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] 0 pthread_t t1938; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] EXPR 1 \read(z) [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L840] FCALL, FORK 0 pthread_create(&t1938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1938, ((void *)0), P1, ((void *)0))=10, t1937={7:0}, t1938={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L794] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] 0 pthread_t t1939; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1937={7:0}, t1938={5:0}, t1939={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L842] FCALL, FORK 0 pthread_create(&t1939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1939, ((void *)0), P2, ((void *)0))=11, t1937={7:0}, t1938={5:0}, t1939={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L797] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L812] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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, t1937={7:0}, t1938={5:0}, t1939={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L859] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe007_power.oepc-thin001_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 835]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: 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: 838]: 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: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 216 locations, 61 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: 43.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1915 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1418 mSDsluCounter, 609 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 488 mSDsCounter, 290 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4021 IncrementalHoareTripleChecker+Invalid, 4311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 290 mSolverCounterUnsat, 121 mSDtfsCounter, 4021 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=375occurred in iteration=13, InterpolantAutomatonStates: 89, 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.7s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 2675 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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:21:15,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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_765a670f-3c56-41b5-9be6-a4dc875db599/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 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:21:18,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:21:18,944 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:21:18,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:21:18,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:21:19,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:21:19,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:21:19,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:21:19,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:21:19,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:21:19,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:21:19,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:21:19,015 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:21:19,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:21:19,018 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:21:19,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:21:19,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:21:19,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:21:19,019 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:21:19,020 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:21:19,020 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:21:19,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:21:19,021 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:21:19,021 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:21:19,022 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:21:19,022 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:21:19,023 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:21:19,023 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:21:19,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:21:19,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:21:19,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:21:19,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:21:19,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:21:19,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:21:19,027 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:21:19,028 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:21:19,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:21:19,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:21:19,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:21:19,029 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:21:19,030 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:21:19,030 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_765a670f-3c56-41b5-9be6-a4dc875db599/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_765a670f-3c56-41b5-9be6-a4dc875db599/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 -> 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f [2023-11-06 22:21:19,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:21:19,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:21:19,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:21:19,451 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:21:19,451 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:21:19,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2023-11-06 22:21:22,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:21:23,498 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:21:23,504 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2023-11-06 22:21:23,531 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/data/635cea801/42286820e0704576bc48f3297c5bc327/FLAG1bc9644aa [2023-11-06 22:21:23,547 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/data/635cea801/42286820e0704576bc48f3297c5bc327 [2023-11-06 22:21:23,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:21:23,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:21:23,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:21:23,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:21:23,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:21:23,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:21:23" (1/1) ... [2023-11-06 22:21:23,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398f9275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:23, skipping insertion in model container [2023-11-06 22:21:23,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:21:23" (1/1) ... [2023-11-06 22:21:23,640 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:21:24,247 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:21:24,281 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:21:24,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:21:24,491 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:21:24,492 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:21:24,500 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:21:24,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:24 WrapperNode [2023-11-06 22:21:24,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:21:24,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:21:24,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:21:24,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:21:24,511 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:21:24" (1/1) ... [2023-11-06 22:21:24,550 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:21:24" (1/1) ... [2023-11-06 22:21:24,592 INFO L138 Inliner]: procedures = 180, calls = 70, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2023-11-06 22:21:24,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:21:24,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:21:24,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:21:24,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:21:24,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:24" (1/1) ... [2023-11-06 22:21:24,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:24" (1/1) ... [2023-11-06 22:21:24,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:24" (1/1) ... [2023-11-06 22:21:24,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:24" (1/1) ... [2023-11-06 22:21:24,626 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:24" (1/1) ... [2023-11-06 22:21:24,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:24" (1/1) ... [2023-11-06 22:21:24,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:24" (1/1) ... [2023-11-06 22:21:24,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:24" (1/1) ... [2023-11-06 22:21:24,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:21:24,642 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:21:24,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:21:24,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:21:24,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:24" (1/1) ... [2023-11-06 22:21:24,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:21:24,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:21:24,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:21:24,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:21:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:21:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:21:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:21:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:21:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:21:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:21:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:21:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:21:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:21:24,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:21:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:21:24,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:21:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:21:24,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:21:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:21:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:21:24,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:21:24,761 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:21:25,057 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:21:25,061 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:21:25,878 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:21:26,535 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:21:26,537 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:21:26,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:26 BoogieIcfgContainer [2023-11-06 22:21:26,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:21:26,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:21:26,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:21:26,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:21:26,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:21:23" (1/3) ... [2023-11-06 22:21:26,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb29c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:21:26, skipping insertion in model container [2023-11-06 22:21:26,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:24" (2/3) ... [2023-11-06 22:21:26,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb29c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:21:26, skipping insertion in model container [2023-11-06 22:21:26,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:26" (3/3) ... [2023-11-06 22:21:26,558 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.oepc-thin001_power.oepc.i [2023-11-06 22:21:26,584 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:21:26,585 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2023-11-06 22:21:26,585 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:21:26,845 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:21:26,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 172 transitions, 356 flow [2023-11-06 22:21:27,071 INFO L124 PetriNetUnfolderBase]: 3/169 cut-off events. [2023-11-06 22:21:27,072 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:21:27,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 3/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 215 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-11-06 22:21:27,080 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 172 transitions, 356 flow [2023-11-06 22:21:27,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 169 transitions, 347 flow [2023-11-06 22:21:27,094 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:21:27,107 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 169 transitions, 347 flow [2023-11-06 22:21:27,111 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 169 transitions, 347 flow [2023-11-06 22:21:27,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 169 transitions, 347 flow [2023-11-06 22:21:27,201 INFO L124 PetriNetUnfolderBase]: 3/169 cut-off events. [2023-11-06 22:21:27,202 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:21:27,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 3/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 214 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-11-06 22:21:27,213 INFO L119 LiptonReduction]: Number of co-enabled transitions 5746 [2023-11-06 22:22:00,366 INFO L134 LiptonReduction]: Checked pairs total: 21780 [2023-11-06 22:22:00,366 INFO L136 LiptonReduction]: Total number of compositions: 161 [2023-11-06 22:22:00,383 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:22:00,390 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;@65d60d87, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:22:00,390 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2023-11-06 22:22:00,393 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:22:00,393 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:22:00,394 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:22:00,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:00,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:22:00,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:22:00,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:00,401 INFO L85 PathProgramCache]: Analyzing trace with hash 964, now seen corresponding path program 1 times [2023-11-06 22:22:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:22:00,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823080497] [2023-11-06 22:22:00,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:00,415 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:22:00,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:22:00,417 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:00,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:00,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:22:00,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:00,712 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:22:00,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:00,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:22:00,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823080497] [2023-11-06 22:22:00,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823080497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:00,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:00,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:22:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821847586] [2023-11-06 22:22:00,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:00,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:22:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:22:00,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:22:00,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:22:00,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 333 [2023-11-06 22:22:00,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 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:22:00,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:22:00,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 333 [2023-11-06 22:22:00,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:22:02,667 INFO L124 PetriNetUnfolderBase]: 4714/6836 cut-off events. [2023-11-06 22:22:02,668 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:22:02,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13683 conditions, 6836 events. 4714/6836 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 41871 event pairs, 4714 based on Foata normal form. 0/3761 useless extension candidates. Maximal degree in co-relation 13672. Up to 6801 conditions per place. [2023-11-06 22:22:02,765 INFO L140 encePairwiseOnDemand]: 312/333 looper letters, 36 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2023-11-06 22:22:02,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 161 flow [2023-11-06 22:22:02,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:22:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:22:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 327 transitions. [2023-11-06 22:22:02,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49099099099099097 [2023-11-06 22:22:02,784 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 327 transitions. [2023-11-06 22:22:02,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 327 transitions. [2023-11-06 22:22:02,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:22:02,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 327 transitions. [2023-11-06 22:22:02,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 163.5) internal successors, (327), 2 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:02,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:02,802 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:02,804 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 2 states and 327 transitions. [2023-11-06 22:22:02,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 161 flow [2023-11-06 22:22:02,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:22:02,812 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2023-11-06 22:22:02,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-11-06 22:22:02,819 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2023-11-06 22:22:02,820 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2023-11-06 22:22:02,820 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:22:02,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:02,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:22:02,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:03,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:03,034 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:22:03,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:03,035 INFO L85 PathProgramCache]: Analyzing trace with hash 950086, now seen corresponding path program 1 times [2023-11-06 22:22:03,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:22:03,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009034915] [2023-11-06 22:22:03,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:03,037 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:22:03,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:22:03,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:03,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:03,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:22:03,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:03,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:22:03,338 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:22:03,377 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:22:03,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:03,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:22:03,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009034915] [2023-11-06 22:22:03,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009034915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:03,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:03,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:22:03,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838941629] [2023-11-06 22:22:03,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:03,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:22:03,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:22:03,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:22:03,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:22:03,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 333 [2023-11-06 22:22:03,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 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:22:03,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:22:03,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 333 [2023-11-06 22:22:03,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:22:04,456 INFO L124 PetriNetUnfolderBase]: 2095/3109 cut-off events. [2023-11-06 22:22:04,457 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:22:04,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6226 conditions, 3109 events. 2095/3109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 17208 event pairs, 2095 based on Foata normal form. 0/2090 useless extension candidates. Maximal degree in co-relation 6223. Up to 3080 conditions per place. [2023-11-06 22:22:04,492 INFO L140 encePairwiseOnDemand]: 326/333 looper letters, 29 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-11-06 22:22:04,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 134 flow [2023-11-06 22:22:04,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:22:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:22:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-11-06 22:22:04,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43843843843843844 [2023-11-06 22:22:04,498 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-11-06 22:22:04,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-11-06 22:22:04,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:22:04,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-11-06 22:22:04,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:04,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:04,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:04,509 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 438 transitions. [2023-11-06 22:22:04,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 134 flow [2023-11-06 22:22:04,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:22:04,512 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-11-06 22:22:04,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-11-06 22:22:04,513 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-11-06 22:22:04,514 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-11-06 22:22:04,514 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:22:04,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:04,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:22:04,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:04,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:04,728 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:22:04,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:04,729 INFO L85 PathProgramCache]: Analyzing trace with hash 950085, now seen corresponding path program 1 times [2023-11-06 22:22:04,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:22:04,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034514091] [2023-11-06 22:22:04,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:04,730 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:22:04,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:22:04,732 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:04,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:04,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:22:04,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:04,927 INFO L322 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-06 22:22:04,928 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-06 22:22:04,958 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:22:04,958 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:04,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:22:04,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034514091] [2023-11-06 22:22:04,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034514091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:04,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:04,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:22:04,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723105671] [2023-11-06 22:22:04,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:04,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:22:04,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:22:04,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:22:04,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:22:05,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 333 [2023-11-06 22:22:05,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:05,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:22:05,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 333 [2023-11-06 22:22:05,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:22:05,742 INFO L124 PetriNetUnfolderBase]: 1248/1886 cut-off events. [2023-11-06 22:22:05,742 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:22:05,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3790 conditions, 1886 events. 1248/1886 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 9488 event pairs, 712 based on Foata normal form. 63/1564 useless extension candidates. Maximal degree in co-relation 3786. Up to 1053 conditions per place. [2023-11-06 22:22:05,761 INFO L140 encePairwiseOnDemand]: 325/333 looper letters, 34 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-11-06 22:22:05,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 158 flow [2023-11-06 22:22:05,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:22:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:22:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-11-06 22:22:05,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43543543543543545 [2023-11-06 22:22:05,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-11-06 22:22:05,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-11-06 22:22:05,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:22:05,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-11-06 22:22:05,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:05,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:05,773 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:05,773 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 435 transitions. [2023-11-06 22:22:05,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 158 flow [2023-11-06 22:22:05,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:22:05,776 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 85 flow [2023-11-06 22:22:05,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-11-06 22:22:05,777 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-11-06 22:22:05,777 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 85 flow [2023-11-06 22:22:05,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:05,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:05,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:05,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:22:05,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:05,999 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:22:05,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash 729522853, now seen corresponding path program 1 times [2023-11-06 22:22:06,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:22:06,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972008482] [2023-11-06 22:22:06,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:06,000 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:22:06,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:22:06,001 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:06,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:06,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:22:06,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:06,180 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:22:06,180 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:06,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:22:06,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972008482] [2023-11-06 22:22:06,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972008482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:06,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:06,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:22:06,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220958666] [2023-11-06 22:22:06,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:06,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:22:06,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:22:06,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:22:06,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:22:06,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 333 [2023-11-06 22:22:06,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:06,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:22:06,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 333 [2023-11-06 22:22:06,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:22:06,621 INFO L124 PetriNetUnfolderBase]: 588/989 cut-off events. [2023-11-06 22:22:06,621 INFO L125 PetriNetUnfolderBase]: For 48/60 co-relation queries the response was YES. [2023-11-06 22:22:06,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2136 conditions, 989 events. 588/989 cut-off events. For 48/60 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4867 event pairs, 191 based on Foata normal form. 12/857 useless extension candidates. Maximal degree in co-relation 2131. Up to 921 conditions per place. [2023-11-06 22:22:06,633 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 37 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-11-06 22:22:06,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 197 flow [2023-11-06 22:22:06,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:22:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:22:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-11-06 22:22:06,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43543543543543545 [2023-11-06 22:22:06,637 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-11-06 22:22:06,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-11-06 22:22:06,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:22:06,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-11-06 22:22:06,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:06,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:06,645 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:06,645 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 85 flow. Second operand 3 states and 435 transitions. [2023-11-06 22:22:06,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 197 flow [2023-11-06 22:22:06,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:22:06,648 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 107 flow [2023-11-06 22:22:06,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-11-06 22:22:06,650 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -26 predicate places. [2023-11-06 22:22:06,650 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 107 flow [2023-11-06 22:22:06,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:06,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:06,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:06,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-06 22:22:06,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:06,866 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:22:06,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:06,867 INFO L85 PathProgramCache]: Analyzing trace with hash 392516364, now seen corresponding path program 1 times [2023-11-06 22:22:06,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:22:06,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229561084] [2023-11-06 22:22:06,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:06,869 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:22:06,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:22:06,870 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:06,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:07,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:22:07,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:07,094 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:22:07,094 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:07,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:22:07,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229561084] [2023-11-06 22:22:07,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229561084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:07,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:07,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:22:07,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752930449] [2023-11-06 22:22:07,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:07,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:22:07,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:22:07,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:22:07,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:22:07,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 333 [2023-11-06 22:22:07,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:07,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:22:07,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 333 [2023-11-06 22:22:07,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:22:07,411 INFO L124 PetriNetUnfolderBase]: 161/334 cut-off events. [2023-11-06 22:22:07,411 INFO L125 PetriNetUnfolderBase]: For 60/62 co-relation queries the response was YES. [2023-11-06 22:22:07,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 334 events. 161/334 cut-off events. For 60/62 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1286 event pairs, 43 based on Foata normal form. 16/308 useless extension candidates. Maximal degree in co-relation 832. Up to 202 conditions per place. [2023-11-06 22:22:07,417 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 44 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2023-11-06 22:22:07,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 261 flow [2023-11-06 22:22:07,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:22:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:22:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 576 transitions. [2023-11-06 22:22:07,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2023-11-06 22:22:07,424 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 576 transitions. [2023-11-06 22:22:07,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 576 transitions. [2023-11-06 22:22:07,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:22:07,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 576 transitions. [2023-11-06 22:22:07,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:07,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:07,433 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:07,433 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 107 flow. Second operand 4 states and 576 transitions. [2023-11-06 22:22:07,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 261 flow [2023-11-06 22:22:07,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:22:07,437 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 143 flow [2023-11-06 22:22:07,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-11-06 22:22:07,440 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2023-11-06 22:22:07,440 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 143 flow [2023-11-06 22:22:07,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:07,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:07,441 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:22:07,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:07,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:07,654 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:22:07,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:07,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1435288668, now seen corresponding path program 1 times [2023-11-06 22:22:07,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:22:07,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262713232] [2023-11-06 22:22:07,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:07,655 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:22:07,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:22:07,656 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:07,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:07,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:22:07,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:07,894 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:22:07,894 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:07,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:22:07,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262713232] [2023-11-06 22:22:07,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262713232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:07,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:07,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:22:07,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559294039] [2023-11-06 22:22:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:07,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:22:07,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:22:07,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:22:07,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:22:07,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 333 [2023-11-06 22:22:07,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:07,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:22:07,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 333 [2023-11-06 22:22:07,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:22:08,271 INFO L124 PetriNetUnfolderBase]: 82/172 cut-off events. [2023-11-06 22:22:08,271 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2023-11-06 22:22:08,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 172 events. 82/172 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 513 event pairs, 24 based on Foata normal form. 7/172 useless extension candidates. Maximal degree in co-relation 497. Up to 70 conditions per place. [2023-11-06 22:22:08,273 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 37 selfloop transitions, 10 changer transitions 1/51 dead transitions. [2023-11-06 22:22:08,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 263 flow [2023-11-06 22:22:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:22:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:22:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 704 transitions. [2023-11-06 22:22:08,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4228228228228228 [2023-11-06 22:22:08,277 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 704 transitions. [2023-11-06 22:22:08,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 704 transitions. [2023-11-06 22:22:08,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:22:08,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 704 transitions. [2023-11-06 22:22:08,280 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:22:08,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:08,286 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:08,286 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 143 flow. Second operand 5 states and 704 transitions. [2023-11-06 22:22:08,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 263 flow [2023-11-06 22:22:08,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 247 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 22:22:08,290 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2023-11-06 22:22:08,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-11-06 22:22:08,291 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2023-11-06 22:22:08,291 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2023-11-06 22:22:08,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:08,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:08,292 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:22:08,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:22:08,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:08,510 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:22:08,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:08,510 INFO L85 PathProgramCache]: Analyzing trace with hash 830563236, now seen corresponding path program 1 times [2023-11-06 22:22:08,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:22:08,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290722877] [2023-11-06 22:22:08,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:08,511 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:22:08,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:22:08,512 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:08,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:08,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:22:08,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:08,787 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:22:08,787 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:08,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:22:08,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290722877] [2023-11-06 22:22:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290722877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:08,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:08,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:22:08,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402708952] [2023-11-06 22:22:08,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:08,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:22:08,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:22:08,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:22:08,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:22:08,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 333 [2023-11-06 22:22:08,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:08,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:22:08,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 333 [2023-11-06 22:22:08,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:22:09,108 INFO L124 PetriNetUnfolderBase]: 94/204 cut-off events. [2023-11-06 22:22:09,108 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2023-11-06 22:22:09,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 204 events. 94/204 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 728 event pairs, 13 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 581. Up to 139 conditions per place. [2023-11-06 22:22:09,109 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 42 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-11-06 22:22:09,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 277 flow [2023-11-06 22:22:09,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:22:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:22:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2023-11-06 22:22:09,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41516516516516516 [2023-11-06 22:22:09,113 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions. [2023-11-06 22:22:09,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions. [2023-11-06 22:22:09,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:22:09,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions. [2023-11-06 22:22:09,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:09,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:09,118 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:09,118 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 4 states and 553 transitions. [2023-11-06 22:22:09,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 277 flow [2023-11-06 22:22:09,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 245 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-06 22:22:09,122 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 113 flow [2023-11-06 22:22:09,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-11-06 22:22:09,123 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-11-06 22:22:09,123 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 113 flow [2023-11-06 22:22:09,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:09,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:09,124 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:22:09,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:09,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:09,338 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:22:09,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:09,338 INFO L85 PathProgramCache]: Analyzing trace with hash 344344395, now seen corresponding path program 1 times [2023-11-06 22:22:09,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:22:09,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752643853] [2023-11-06 22:22:09,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:09,341 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:22:09,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:22:09,346 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:09,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:09,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:22:09,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:09,672 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:22:09,672 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:09,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:22:09,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752643853] [2023-11-06 22:22:09,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752643853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:09,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:09,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:22:09,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009040707] [2023-11-06 22:22:09,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:09,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:22:09,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:22:09,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:22:09,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:22:09,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 333 [2023-11-06 22:22:09,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:09,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:22:09,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 333 [2023-11-06 22:22:09,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:22:10,163 INFO L124 PetriNetUnfolderBase]: 94/203 cut-off events. [2023-11-06 22:22:10,163 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2023-11-06 22:22:10,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 203 events. 94/203 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 720 event pairs, 13 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 562. Up to 141 conditions per place. [2023-11-06 22:22:10,165 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 41 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-11-06 22:22:10,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 245 flow [2023-11-06 22:22:10,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:22:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:22:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2023-11-06 22:22:10,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42042042042042044 [2023-11-06 22:22:10,169 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2023-11-06 22:22:10,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2023-11-06 22:22:10,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:22:10,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2023-11-06 22:22:10,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:10,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:10,175 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:10,175 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 113 flow. Second operand 4 states and 560 transitions. [2023-11-06 22:22:10,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 245 flow [2023-11-06 22:22:10,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:22:10,178 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 112 flow [2023-11-06 22:22:10,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-11-06 22:22:10,179 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-11-06 22:22:10,179 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 112 flow [2023-11-06 22:22:10,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:10,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:10,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:10,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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)] Ended with exit code 0 [2023-11-06 22:22:10,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:10,394 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:22:10,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:10,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1140017037, now seen corresponding path program 1 times [2023-11-06 22:22:10,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:22:10,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503169076] [2023-11-06 22:22:10,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:10,395 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:22:10,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:22:10,397 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:10,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:10,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:22:10,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:10,726 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:22:10,727 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:10,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:22:10,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503169076] [2023-11-06 22:22:10,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503169076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:10,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:10,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:22:10,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144857231] [2023-11-06 22:22:10,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:10,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:22:10,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:22:10,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:22:10,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:22:10,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 333 [2023-11-06 22:22:10,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 112 flow. Second operand has 5 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:22:10,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:22:10,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 333 [2023-11-06 22:22:10,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:22:11,072 INFO L124 PetriNetUnfolderBase]: 141/297 cut-off events. [2023-11-06 22:22:11,072 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2023-11-06 22:22:11,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 297 events. 141/297 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1237 event pairs, 12 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 839. Up to 110 conditions per place. [2023-11-06 22:22:11,076 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 71 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2023-11-06 22:22:11,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 77 transitions, 433 flow [2023-11-06 22:22:11,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:22:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:22:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 710 transitions. [2023-11-06 22:22:11,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4264264264264264 [2023-11-06 22:22:11,081 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 710 transitions. [2023-11-06 22:22:11,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 710 transitions. [2023-11-06 22:22:11,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:22:11,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 710 transitions. [2023-11-06 22:22:11,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:11,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:11,089 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:11,089 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 112 flow. Second operand 5 states and 710 transitions. [2023-11-06 22:22:11,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 77 transitions, 433 flow [2023-11-06 22:22:11,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:22:11,094 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 125 flow [2023-11-06 22:22:11,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2023-11-06 22:22:11,095 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -24 predicate places. [2023-11-06 22:22:11,095 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 125 flow [2023-11-06 22:22:11,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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:22:11,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:11,096 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:22:11,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:11,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:11,310 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:22:11,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:11,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1173684139, now seen corresponding path program 2 times [2023-11-06 22:22:11,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:22:11,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809313440] [2023-11-06 22:22:11,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:22:11,311 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:22:11,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:22:11,312 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:11,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:11,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:22:11,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:22:11,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:22:11,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:11,639 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:22:11,639 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:11,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:22:11,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809313440] [2023-11-06 22:22:11,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809313440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:11,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:11,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:22:11,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727721275] [2023-11-06 22:22:11,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:11,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:22:11,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:22:11,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:22:11,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:22:11,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 333 [2023-11-06 22:22:11,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 125 flow. Second operand has 5 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:22:11,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:22:11,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 333 [2023-11-06 22:22:11,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:22:12,039 INFO L124 PetriNetUnfolderBase]: 187/407 cut-off events. [2023-11-06 22:22:12,039 INFO L125 PetriNetUnfolderBase]: For 335/335 co-relation queries the response was YES. [2023-11-06 22:22:12,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 407 events. 187/407 cut-off events. For 335/335 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1802 event pairs, 13 based on Foata normal form. 1/408 useless extension candidates. Maximal degree in co-relation 1254. Up to 150 conditions per place. [2023-11-06 22:22:12,043 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 70 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2023-11-06 22:22:12,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 462 flow [2023-11-06 22:22:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:22:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:22:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 841 transitions. [2023-11-06 22:22:12,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4209209209209209 [2023-11-06 22:22:12,049 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 841 transitions. [2023-11-06 22:22:12,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 841 transitions. [2023-11-06 22:22:12,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:22:12,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 841 transitions. [2023-11-06 22:22:12,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.16666666666666) internal successors, (841), 6 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:12,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:12,058 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:12,058 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 125 flow. Second operand 6 states and 841 transitions. [2023-11-06 22:22:12,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 462 flow [2023-11-06 22:22:12,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 452 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:22:12,063 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 159 flow [2023-11-06 22:22:12,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=159, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-11-06 22:22:12,064 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -20 predicate places. [2023-11-06 22:22:12,065 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 159 flow [2023-11-06 22:22:12,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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:22:12,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:12,066 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:22:12,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:12,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:12,279 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 22:22:12,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:12,279 INFO L85 PathProgramCache]: Analyzing trace with hash -705463133, now seen corresponding path program 3 times [2023-11-06 22:22:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:22:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467005408] [2023-11-06 22:22:12,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:22:12,280 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:22:12,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:22:12,281 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:12,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:12,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:22:12,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:22:12,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:22:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:22:12,796 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:22:12,796 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:22:12,797 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2023-11-06 22:22:12,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2023-11-06 22:22:12,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2023-11-06 22:22:12,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2023-11-06 22:22:12,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2023-11-06 22:22:12,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2023-11-06 22:22:12,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2023-11-06 22:22:12,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2023-11-06 22:22:12,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2023-11-06 22:22:12,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2023-11-06 22:22:12,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2023-11-06 22:22:12,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2023-11-06 22:22:12,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2023-11-06 22:22:12,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2023-11-06 22:22:12,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2023-11-06 22:22:12,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2023-11-06 22:22:12,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2023-11-06 22:22:12,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2023-11-06 22:22:12,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2023-11-06 22:22:12,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2023-11-06 22:22:12,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2023-11-06 22:22:12,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2023-11-06 22:22:12,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2023-11-06 22:22:12,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2023-11-06 22:22:12,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2023-11-06 22:22:12,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2023-11-06 22:22:12,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2023-11-06 22:22:12,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2023-11-06 22:22:12,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2023-11-06 22:22:12,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2023-11-06 22:22:12,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2023-11-06 22:22:12,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2023-11-06 22:22:12,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2023-11-06 22:22:12,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2023-11-06 22:22:12,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2023-11-06 22:22:12,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2023-11-06 22:22:12,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2023-11-06 22:22:12,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2023-11-06 22:22:12,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2023-11-06 22:22:12,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2023-11-06 22:22:12,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2023-11-06 22:22:12,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2023-11-06 22:22:12,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2023-11-06 22:22:12,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2023-11-06 22:22:12,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2023-11-06 22:22:12,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2023-11-06 22:22:12,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2023-11-06 22:22:12,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2023-11-06 22:22:12,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2023-11-06 22:22:12,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2023-11-06 22:22:12,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2023-11-06 22:22:12,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2023-11-06 22:22:12,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2023-11-06 22:22:12,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2023-11-06 22:22:12,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2023-11-06 22:22:12,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2023-11-06 22:22:12,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2023-11-06 22:22:12,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2023-11-06 22:22:12,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2023-11-06 22:22:12,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2023-11-06 22:22:12,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2023-11-06 22:22:12,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:13,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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:22:13,027 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:13,034 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:22:13,034 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:22:13,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:22:13 BasicIcfg [2023-11-06 22:22:13,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:22:13,166 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:22:13,166 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:22:13,166 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:22:13,167 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:26" (3/4) ... [2023-11-06 22:22:13,168 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:22:13,170 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:22:13,170 INFO L158 Benchmark]: Toolchain (without parser) took 49618.72ms. Allocated memory was 73.4MB in the beginning and 444.6MB in the end (delta: 371.2MB). Free memory was 48.7MB in the beginning and 303.9MB in the end (delta: -255.2MB). Peak memory consumption was 118.8MB. Max. memory is 16.1GB. [2023-11-06 22:22:13,171 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 73.4MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:22:13,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 948.02ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 48.5MB in the beginning and 55.6MB in the end (delta: -7.0MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2023-11-06 22:22:13,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.18ms. Allocated memory is still 88.1MB. Free memory was 55.6MB in the beginning and 53.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:22:13,172 INFO L158 Benchmark]: Boogie Preprocessor took 48.19ms. Allocated memory is still 88.1MB. Free memory was 52.8MB in the beginning and 50.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:22:13,172 INFO L158 Benchmark]: RCFGBuilder took 1898.78ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 50.5MB in the beginning and 59.1MB in the end (delta: -8.6MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2023-11-06 22:22:13,173 INFO L158 Benchmark]: TraceAbstraction took 46620.35ms. Allocated memory was 107.0MB in the beginning and 444.6MB in the end (delta: 337.6MB). Free memory was 59.1MB in the beginning and 303.9MB in the end (delta: -244.8MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. [2023-11-06 22:22:13,173 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 444.6MB. Free memory is still 303.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:22:13,175 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 73.4MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 948.02ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 48.5MB in the beginning and 55.6MB in the end (delta: -7.0MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.18ms. Allocated memory is still 88.1MB. Free memory was 55.6MB in the beginning and 53.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.19ms. Allocated memory is still 88.1MB. Free memory was 52.8MB in the beginning and 50.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1898.78ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 50.5MB in the beginning and 59.1MB in the end (delta: -8.6MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * TraceAbstraction took 46620.35ms. Allocated memory was 107.0MB in the beginning and 444.6MB in the end (delta: 337.6MB). Free memory was 59.1MB in the beginning and 303.9MB in the end (delta: -244.8MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 444.6MB. Free memory is still 303.9MB. 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: 33.3s, 176 PlacesBefore, 71 PlacesAfterwards, 169 TransitionsBefore, 62 TransitionsAfterwards, 5746 CoEnabledTransitionPairs, 8 FixpointIterations, 67 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 161 TotalNumberOfCompositions, 21780 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9124, independent: 8681, independent conditional: 0, independent unconditional: 8681, dependent: 443, dependent conditional: 0, dependent unconditional: 443, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2752, independent: 2684, independent conditional: 0, independent unconditional: 2684, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9124, independent: 5997, independent conditional: 0, independent unconditional: 5997, dependent: 375, dependent conditional: 0, dependent unconditional: 375, unknown: 2752, unknown conditional: 0, unknown unconditional: 2752] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 369, Positive conditional cache size: 0, Positive unconditional cache size: 369, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1937; [L838] FCALL, FORK 0 pthread_create(&t1937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1937, ((void *)0), P0, ((void *)0))=-2147483648, t1937={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] 0 pthread_t t1938; [L840] FCALL, FORK 0 pthread_create(&t1938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1938, ((void *)0), P1, ((void *)0))=-2147483647, t1937={15:0}, t1938={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] 0 pthread_t t1939; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1937={15:0}, t1938={5:0}, t1939={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L842] FCALL, FORK 0 pthread_create(&t1939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1939, ((void *)0), P2, ((void *)0))=-2147483646, t1937={15:0}, t1938={5:0}, t1939={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] EXPR 1 \read(z) [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L794] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L797] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L809] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L812] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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, t1937={15:0}, t1938={5:0}, t1939={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L859] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe007_power.oepc-thin001_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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$$choice0=0, weak$$choice1=2, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 835]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: 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: 838]: 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: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 217 locations, 61 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 46.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 33.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 497 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 340 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 952 IncrementalHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 14 mSDtfsCounter, 952 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=10, InterpolantAutomatonStates: 39, 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.8s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 547 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1326 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:22:13,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_765a670f-3c56-41b5-9be6-a4dc875db599/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