./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe007_power.opt-thin001_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe007_power.opt-thin001_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6328ead9c10c029445fd051d7c6329db494c1000fb08b7313fbd69c70835e259 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:23:46,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:23:46,517 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 03:23:46,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:23:46,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:23:46,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:23:46,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:23:46,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:23:46,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:23:46,550 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:23:46,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:23:46,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:23:46,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:23:46,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:23:46,552 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:23:46,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:23:46,552 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:23:46,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:23:46,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:23:46,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:23:46,553 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:23:46,553 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:23:46,553 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:23:46,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:23:46,553 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:23:46,554 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:23:46,554 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:23:46,554 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:23:46,554 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:23:46,554 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:23:46,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:23:46,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:23:46,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:23:46,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:23:46,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:23:46,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:23:46,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:23:46,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:23:46,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:23:46,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:23:46,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:23:46,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:23:46,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:23:46,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:23:46,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:23:46,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:23:46,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:23:46,556 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6328ead9c10c029445fd051d7c6329db494c1000fb08b7313fbd69c70835e259 [2024-11-28 03:23:46,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:23:46,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:23:46,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:23:46,892 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:23:46,892 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:23:46,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2024-11-28 03:23:49,899 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/data/4bd4ba054/28b8f790ab6540658e3c01f55e606384/FLAG04effa3e6 [2024-11-28 03:23:50,306 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:23:50,307 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/sv-benchmarks/c/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2024-11-28 03:23:50,327 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/data/4bd4ba054/28b8f790ab6540658e3c01f55e606384/FLAG04effa3e6 [2024-11-28 03:23:50,342 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/data/4bd4ba054/28b8f790ab6540658e3c01f55e606384 [2024-11-28 03:23:50,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:23:50,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:23:50,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:23:50,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:23:50,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:23:50,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:23:50" (1/1) ... [2024-11-28 03:23:50,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2604bc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:50, skipping insertion in model container [2024-11-28 03:23:50,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:23:50" (1/1) ... [2024-11-28 03:23:50,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:23:50,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:23:51,018 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:23:51,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:23:51,197 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:23:51,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:51 WrapperNode [2024-11-28 03:23:51,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:23:51,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:23:51,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:23:51,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:23:51,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:51" (1/1) ... [2024-11-28 03:23:51,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:51" (1/1) ... [2024-11-28 03:23:51,287 INFO L138 Inliner]: procedures = 175, calls = 60, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 174 [2024-11-28 03:23:51,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:23:51,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:23:51,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:23:51,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:23:51,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:51" (1/1) ... [2024-11-28 03:23:51,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:51" (1/1) ... [2024-11-28 03:23:51,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:51" (1/1) ... [2024-11-28 03:23:51,350 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-11-28 03:23:51,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:51" (1/1) ... [2024-11-28 03:23:51,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:51" (1/1) ... [2024-11-28 03:23:51,368 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:51" (1/1) ... [2024-11-28 03:23:51,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:51" (1/1) ... [2024-11-28 03:23:51,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:51" (1/1) ... [2024-11-28 03:23:51,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:51" (1/1) ... [2024-11-28 03:23:51,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:51" (1/1) ... [2024-11-28 03:23:51,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:23:51,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:23:51,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:23:51,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:23:51,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:51" (1/1) ... [2024-11-28 03:23:51,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:23:51,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:23:51,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:23:51,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:23:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 03:23:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 03:23:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 03:23:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 03:23:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 03:23:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:23:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-28 03:23:51,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-28 03:23:51,478 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-28 03:23:51,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-28 03:23:51,478 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-28 03:23:51,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-28 03:23:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:23:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:23:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 03:23:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:23:51,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:23:51,482 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:23:51,725 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:23:51,728 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:23:52,398 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:23:52,400 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:23:53,115 WARN L170 LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2024-11-28 03:23:53,334 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:23:53,334 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 03:23:53,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:23:53 BoogieIcfgContainer [2024-11-28 03:23:53,335 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:23:53,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:23:53,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:23:53,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:23:53,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:23:50" (1/3) ... [2024-11-28 03:23:53,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485881d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:23:53, skipping insertion in model container [2024-11-28 03:23:53,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:51" (2/3) ... [2024-11-28 03:23:53,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485881d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:23:53, skipping insertion in model container [2024-11-28 03:23:53,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:23:53" (3/3) ... [2024-11-28 03:23:53,350 INFO L128 eAbstractionObserver]: Analyzing ICFG safe007_power.opt-thin001_power.opt.i [2024-11-28 03:23:53,374 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:23:53,377 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe007_power.opt-thin001_power.opt.i that has 4 procedures, 73 locations, 1 initial locations, 0 loop locations, and 33 error locations. [2024-11-28 03:23:53,378 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:23:53,737 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 03:23:53,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 101 transitions, 214 flow [2024-11-28 03:23:53,909 INFO L124 PetriNetUnfolderBase]: 29/98 cut-off events. [2024-11-28 03:23:53,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:23:53,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 29/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 322 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 100. Up to 4 conditions per place. [2024-11-28 03:23:53,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 101 transitions, 214 flow [2024-11-28 03:23:53,929 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 98 transitions, 205 flow [2024-11-28 03:23:53,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:23:53,956 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@41c3fa09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:23:53,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-28 03:23:53,964 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:23:53,964 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2024-11-28 03:23:53,965 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:23:53,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:23:53,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:23:53,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:23:53,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:23:53,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1534162934, now seen corresponding path program 1 times [2024-11-28 03:23:53,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:23:53,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752594215] [2024-11-28 03:23:53,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:23:53,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:23:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:23:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:23:54,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:23:54,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752594215] [2024-11-28 03:23:54,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752594215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:23:54,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:23:54,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 03:23:54,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785490306] [2024-11-28 03:23:54,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:23:54,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:23:54,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:23:54,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:23:54,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:23:54,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 03:23:54,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 98 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:23:54,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:23:54,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 03:23:54,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:23:58,534 INFO L124 PetriNetUnfolderBase]: 9134/13826 cut-off events. [2024-11-28 03:23:58,535 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-28 03:23:58,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26910 conditions, 13826 events. 9134/13826 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 1611. Compared 111430 event pairs, 2689 based on Foata normal form. 516/7789 useless extension candidates. Maximal degree in co-relation 26899. Up to 7491 conditions per place. [2024-11-28 03:23:58,665 INFO L140 encePairwiseOnDemand]: 54/101 looper letters, 69 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2024-11-28 03:23:58,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 332 flow [2024-11-28 03:23:58,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:23:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:23:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2024-11-28 03:23:58,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7029702970297029 [2024-11-28 03:23:58,685 INFO L175 Difference]: Start difference. First operand has 79 places, 98 transitions, 205 flow. Second operand 3 states and 213 transitions. [2024-11-28 03:23:58,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 332 flow [2024-11-28 03:23:58,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 328 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 03:23:58,702 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 140 flow [2024-11-28 03:23:58,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-11-28 03:23:58,710 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -15 predicate places. [2024-11-28 03:23:58,712 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 140 flow [2024-11-28 03:23:58,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:23:58,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:23:58,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:23:58,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:23:58,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:23:58,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:23:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash -314409790, now seen corresponding path program 1 times [2024-11-28 03:23:58,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:23:58,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386349325] [2024-11-28 03:23:58,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:23:58,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:23:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:23:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:23:58,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:23:58,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386349325] [2024-11-28 03:23:58,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386349325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:23:58,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:23:58,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 03:23:58,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843077257] [2024-11-28 03:23:58,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:23:58,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:23:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:23:58,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:23:58,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:23:58,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 03:23:58,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:23:58,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:23:58,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 03:23:58,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:00,191 INFO L124 PetriNetUnfolderBase]: 4048/6490 cut-off events. [2024-11-28 03:24:00,192 INFO L125 PetriNetUnfolderBase]: For 1100/1100 co-relation queries the response was YES. [2024-11-28 03:24:00,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13393 conditions, 6490 events. 4048/6490 cut-off events. For 1100/1100 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 53255 event pairs, 3658 based on Foata normal form. 0/4390 useless extension candidates. Maximal degree in co-relation 13381. Up to 5819 conditions per place. [2024-11-28 03:24:00,242 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 33 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2024-11-28 03:24:00,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 194 flow [2024-11-28 03:24:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:24:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:24:00,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-28 03:24:00,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3201320132013201 [2024-11-28 03:24:00,244 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 140 flow. Second operand 3 states and 97 transitions. [2024-11-28 03:24:00,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 194 flow [2024-11-28 03:24:00,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 50 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:24:00,249 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 122 flow [2024-11-28 03:24:00,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-11-28 03:24:00,251 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2024-11-28 03:24:00,251 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 122 flow [2024-11-28 03:24:00,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:00,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:00,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:00,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:24:00,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:00,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:00,255 INFO L85 PathProgramCache]: Analyzing trace with hash -314409789, now seen corresponding path program 1 times [2024-11-28 03:24:00,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:00,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954516627] [2024-11-28 03:24:00,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:00,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:00,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:00,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954516627] [2024-11-28 03:24:00,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954516627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:00,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:00,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 03:24:00,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828909076] [2024-11-28 03:24:00,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:00,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:24:00,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:00,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:24:00,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:24:00,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 03:24:00,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:00,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:00,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 03:24:00,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:01,006 INFO L124 PetriNetUnfolderBase]: 1238/2098 cut-off events. [2024-11-28 03:24:01,007 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2024-11-28 03:24:01,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4313 conditions, 2098 events. 1238/2098 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 15026 event pairs, 1040 based on Foata normal form. 88/1854 useless extension candidates. Maximal degree in co-relation 4305. Up to 1809 conditions per place. [2024-11-28 03:24:01,019 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 25 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-28 03:24:01,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 162 flow [2024-11-28 03:24:01,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:24:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:24:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-28 03:24:01,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.297029702970297 [2024-11-28 03:24:01,024 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 122 flow. Second operand 3 states and 90 transitions. [2024-11-28 03:24:01,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 162 flow [2024-11-28 03:24:01,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:24:01,027 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 107 flow [2024-11-28 03:24:01,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-11-28 03:24:01,029 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2024-11-28 03:24:01,029 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 107 flow [2024-11-28 03:24:01,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:01,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:01,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:01,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:24:01,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:01,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:01,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1265561778, now seen corresponding path program 1 times [2024-11-28 03:24:01,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:01,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269181017] [2024-11-28 03:24:01,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:01,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:01,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:01,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269181017] [2024-11-28 03:24:01,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269181017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:01,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:01,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 03:24:01,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943208985] [2024-11-28 03:24:01,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:01,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:24:01,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:01,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:24:01,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:24:01,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 03:24:01,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:01,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:01,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 03:24:01,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:01,648 INFO L124 PetriNetUnfolderBase]: 1051/1839 cut-off events. [2024-11-28 03:24:01,649 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-28 03:24:01,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3712 conditions, 1839 events. 1051/1839 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 12978 event pairs, 151 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 3703. Up to 1377 conditions per place. [2024-11-28 03:24:01,661 INFO L140 encePairwiseOnDemand]: 94/101 looper letters, 31 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2024-11-28 03:24:01,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 205 flow [2024-11-28 03:24:01,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:24:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:24:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-11-28 03:24:01,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31353135313531355 [2024-11-28 03:24:01,663 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 107 flow. Second operand 3 states and 95 transitions. [2024-11-28 03:24:01,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 205 flow [2024-11-28 03:24:01,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:24:01,665 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 128 flow [2024-11-28 03:24:01,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-11-28 03:24:01,666 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2024-11-28 03:24:01,666 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 128 flow [2024-11-28 03:24:01,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:01,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:01,667 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:01,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:24:01,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:01,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash -117472616, now seen corresponding path program 1 times [2024-11-28 03:24:01,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:01,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530509568] [2024-11-28 03:24:01,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:01,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:02,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:02,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530509568] [2024-11-28 03:24:02,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530509568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:02,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:02,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:24:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848659106] [2024-11-28 03:24:02,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:02,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:24:02,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:02,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:24:02,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:24:02,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 03:24:02,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:02,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:02,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 03:24:02,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:02,748 INFO L124 PetriNetUnfolderBase]: 972/1718 cut-off events. [2024-11-28 03:24:02,748 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2024-11-28 03:24:02,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 1718 events. 972/1718 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 11911 event pairs, 123 based on Foata normal form. 0/1564 useless extension candidates. Maximal degree in co-relation 3913. Up to 1255 conditions per place. [2024-11-28 03:24:02,763 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 30 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2024-11-28 03:24:02,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 220 flow [2024-11-28 03:24:02,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:24:02,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 03:24:02,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2024-11-28 03:24:02,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27722772277227725 [2024-11-28 03:24:02,766 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 128 flow. Second operand 4 states and 112 transitions. [2024-11-28 03:24:02,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 220 flow [2024-11-28 03:24:02,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:24:02,771 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 124 flow [2024-11-28 03:24:02,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-28 03:24:02,775 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2024-11-28 03:24:02,775 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 124 flow [2024-11-28 03:24:02,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:02,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:02,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:02,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:24:02,776 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:02,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:02,776 INFO L85 PathProgramCache]: Analyzing trace with hash -117472617, now seen corresponding path program 1 times [2024-11-28 03:24:02,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:02,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978007587] [2024-11-28 03:24:02,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:02,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:02,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:02,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978007587] [2024-11-28 03:24:02,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978007587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:02,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:02,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:24:02,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641457844] [2024-11-28 03:24:02,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:02,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:24:02,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:02,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:24:02,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:24:02,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 03:24:02,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:02,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:02,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 03:24:02,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:03,578 INFO L124 PetriNetUnfolderBase]: 893/1597 cut-off events. [2024-11-28 03:24:03,578 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2024-11-28 03:24:03,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 1597 events. 893/1597 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10924 event pairs, 95 based on Foata normal form. 42/1485 useless extension candidates. Maximal degree in co-relation 3623. Up to 1134 conditions per place. [2024-11-28 03:24:03,593 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 29 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-11-28 03:24:03,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 214 flow [2024-11-28 03:24:03,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:24:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 03:24:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-11-28 03:24:03,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2747524752475248 [2024-11-28 03:24:03,595 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 124 flow. Second operand 4 states and 111 transitions. [2024-11-28 03:24:03,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 214 flow [2024-11-28 03:24:03,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 201 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 03:24:03,600 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 119 flow [2024-11-28 03:24:03,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-11-28 03:24:03,602 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2024-11-28 03:24:03,602 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 119 flow [2024-11-28 03:24:03,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:03,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:03,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:03,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:24:03,604 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:03,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:03,604 INFO L85 PathProgramCache]: Analyzing trace with hash -580456776, now seen corresponding path program 1 times [2024-11-28 03:24:03,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:03,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976573464] [2024-11-28 03:24:03,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:03,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:03,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:03,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976573464] [2024-11-28 03:24:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976573464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:03,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 03:24:03,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631724213] [2024-11-28 03:24:03,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:03,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:24:03,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:03,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:24:03,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:24:03,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 101 [2024-11-28 03:24:03,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:03,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:03,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 101 [2024-11-28 03:24:03,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:04,137 INFO L124 PetriNetUnfolderBase]: 893/1553 cut-off events. [2024-11-28 03:24:04,138 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2024-11-28 03:24:04,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 1553 events. 893/1553 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10756 event pairs, 749 based on Foata normal form. 50/1425 useless extension candidates. Maximal degree in co-relation 3579. Up to 1314 conditions per place. [2024-11-28 03:24:04,147 INFO L140 encePairwiseOnDemand]: 99/101 looper letters, 22 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-28 03:24:04,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 165 flow [2024-11-28 03:24:04,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:24:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:24:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-28 03:24:04,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25742574257425743 [2024-11-28 03:24:04,149 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 119 flow. Second operand 3 states and 78 transitions. [2024-11-28 03:24:04,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 165 flow [2024-11-28 03:24:04,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:24:04,150 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 110 flow [2024-11-28 03:24:04,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-28 03:24:04,151 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -29 predicate places. [2024-11-28 03:24:04,151 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 110 flow [2024-11-28 03:24:04,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:04,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:04,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:04,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:24:04,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:04,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:04,153 INFO L85 PathProgramCache]: Analyzing trace with hash -580455517, now seen corresponding path program 1 times [2024-11-28 03:24:04,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:04,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892611776] [2024-11-28 03:24:04,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:04,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:04,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892611776] [2024-11-28 03:24:04,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892611776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:04,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:04,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:24:04,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738479930] [2024-11-28 03:24:04,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:04,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:24:04,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:04,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:24:04,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:24:04,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 101 [2024-11-28 03:24:04,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:04,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:04,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 101 [2024-11-28 03:24:04,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:05,582 INFO L124 PetriNetUnfolderBase]: 1848/3177 cut-off events. [2024-11-28 03:24:05,583 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2024-11-28 03:24:05,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7170 conditions, 3177 events. 1848/3177 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 21499 event pairs, 661 based on Foata normal form. 0/2810 useless extension candidates. Maximal degree in co-relation 7160. Up to 1702 conditions per place. [2024-11-28 03:24:05,603 INFO L140 encePairwiseOnDemand]: 91/101 looper letters, 33 selfloop transitions, 7 changer transitions 60/113 dead transitions. [2024-11-28 03:24:05,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 113 transitions, 596 flow [2024-11-28 03:24:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:24:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 03:24:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 231 transitions. [2024-11-28 03:24:05,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28589108910891087 [2024-11-28 03:24:05,606 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 110 flow. Second operand 8 states and 231 transitions. [2024-11-28 03:24:05,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 113 transitions, 596 flow [2024-11-28 03:24:05,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 113 transitions, 595 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:24:05,608 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 206 flow [2024-11-28 03:24:05,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=206, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2024-11-28 03:24:05,609 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2024-11-28 03:24:05,610 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 206 flow [2024-11-28 03:24:05,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:05,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:05,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:05,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:24:05,611 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:05,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:05,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2134269652, now seen corresponding path program 1 times [2024-11-28 03:24:05,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:05,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591882474] [2024-11-28 03:24:05,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:05,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:05,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:05,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591882474] [2024-11-28 03:24:05,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591882474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:05,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:05,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:24:05,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568533855] [2024-11-28 03:24:05,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:05,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:24:05,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:05,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:24:05,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:24:05,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 101 [2024-11-28 03:24:05,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:05,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:05,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 101 [2024-11-28 03:24:05,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:06,832 INFO L124 PetriNetUnfolderBase]: 1940/3464 cut-off events. [2024-11-28 03:24:06,832 INFO L125 PetriNetUnfolderBase]: For 1947/1947 co-relation queries the response was YES. [2024-11-28 03:24:06,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8897 conditions, 3464 events. 1940/3464 cut-off events. For 1947/1947 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 24972 event pairs, 273 based on Foata normal form. 134/3396 useless extension candidates. Maximal degree in co-relation 8881. Up to 890 conditions per place. [2024-11-28 03:24:06,851 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 36 selfloop transitions, 3 changer transitions 62/113 dead transitions. [2024-11-28 03:24:06,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 113 transitions, 710 flow [2024-11-28 03:24:06,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:24:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 03:24:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 255 transitions. [2024-11-28 03:24:06,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2524752475247525 [2024-11-28 03:24:06,854 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 206 flow. Second operand 10 states and 255 transitions. [2024-11-28 03:24:06,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 113 transitions, 710 flow [2024-11-28 03:24:06,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 113 transitions, 651 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-11-28 03:24:06,887 INFO L231 Difference]: Finished difference. Result has 68 places, 37 transitions, 155 flow [2024-11-28 03:24:06,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=155, PETRI_PLACES=68, PETRI_TRANSITIONS=37} [2024-11-28 03:24:06,889 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -11 predicate places. [2024-11-28 03:24:06,890 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 37 transitions, 155 flow [2024-11-28 03:24:06,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:06,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:06,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:06,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:24:06,891 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:06,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:06,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1472138504, now seen corresponding path program 1 times [2024-11-28 03:24:06,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:06,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175184052] [2024-11-28 03:24:06,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:06,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:07,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:07,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175184052] [2024-11-28 03:24:07,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175184052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:07,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:07,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:24:07,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853136150] [2024-11-28 03:24:07,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:07,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:24:07,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:07,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:24:07,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:24:07,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 101 [2024-11-28 03:24:07,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 37 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:07,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:07,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 101 [2024-11-28 03:24:07,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:07,827 INFO L124 PetriNetUnfolderBase]: 727/1362 cut-off events. [2024-11-28 03:24:07,827 INFO L125 PetriNetUnfolderBase]: For 1364/1387 co-relation queries the response was YES. [2024-11-28 03:24:07,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3497 conditions, 1362 events. 727/1362 cut-off events. For 1364/1387 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8805 event pairs, 251 based on Foata normal form. 30/1297 useless extension candidates. Maximal degree in co-relation 3474. Up to 926 conditions per place. [2024-11-28 03:24:07,838 INFO L140 encePairwiseOnDemand]: 96/101 looper letters, 31 selfloop transitions, 2 changer transitions 23/69 dead transitions. [2024-11-28 03:24:07,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 69 transitions, 365 flow [2024-11-28 03:24:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:24:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 03:24:07,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-11-28 03:24:07,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24893917963224893 [2024-11-28 03:24:07,840 INFO L175 Difference]: Start difference. First operand has 68 places, 37 transitions, 155 flow. Second operand 7 states and 176 transitions. [2024-11-28 03:24:07,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 69 transitions, 365 flow [2024-11-28 03:24:07,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 318 flow, removed 18 selfloop flow, removed 11 redundant places. [2024-11-28 03:24:07,851 INFO L231 Difference]: Finished difference. Result has 62 places, 37 transitions, 141 flow [2024-11-28 03:24:07,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=141, PETRI_PLACES=62, PETRI_TRANSITIONS=37} [2024-11-28 03:24:07,852 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -17 predicate places. [2024-11-28 03:24:07,852 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 141 flow [2024-11-28 03:24:07,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:07,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:07,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:07,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:24:07,853 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:07,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:07,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1281994637, now seen corresponding path program 1 times [2024-11-28 03:24:07,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:07,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125392374] [2024-11-28 03:24:07,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:07,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:08,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125392374] [2024-11-28 03:24:08,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125392374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:08,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:08,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:24:08,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962504630] [2024-11-28 03:24:08,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:08,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:24:08,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:08,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:24:08,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:24:08,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 101 [2024-11-28 03:24:08,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 37 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:08,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:08,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 101 [2024-11-28 03:24:08,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:08,881 INFO L124 PetriNetUnfolderBase]: 1160/2102 cut-off events. [2024-11-28 03:24:08,882 INFO L125 PetriNetUnfolderBase]: For 1129/1144 co-relation queries the response was YES. [2024-11-28 03:24:08,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4921 conditions, 2102 events. 1160/2102 cut-off events. For 1129/1144 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13321 event pairs, 206 based on Foata normal form. 66/2100 useless extension candidates. Maximal degree in co-relation 4902. Up to 584 conditions per place. [2024-11-28 03:24:08,895 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 29 selfloop transitions, 3 changer transitions 39/83 dead transitions. [2024-11-28 03:24:08,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 414 flow [2024-11-28 03:24:08,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:24:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 03:24:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-11-28 03:24:08,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24752475247524752 [2024-11-28 03:24:08,898 INFO L175 Difference]: Start difference. First operand has 62 places, 37 transitions, 141 flow. Second operand 8 states and 200 transitions. [2024-11-28 03:24:08,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 414 flow [2024-11-28 03:24:08,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 83 transitions, 380 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-11-28 03:24:08,909 INFO L231 Difference]: Finished difference. Result has 64 places, 33 transitions, 119 flow [2024-11-28 03:24:08,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=8, PETRI_FLOW=119, PETRI_PLACES=64, PETRI_TRANSITIONS=33} [2024-11-28 03:24:08,910 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -15 predicate places. [2024-11-28 03:24:08,910 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 33 transitions, 119 flow [2024-11-28 03:24:08,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:08,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:08,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:08,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:24:08,911 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:08,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:08,911 INFO L85 PathProgramCache]: Analyzing trace with hash -78847252, now seen corresponding path program 1 times [2024-11-28 03:24:08,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:08,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263475933] [2024-11-28 03:24:08,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:08,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:10,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:10,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263475933] [2024-11-28 03:24:10,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263475933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:10,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:10,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:24:10,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945162952] [2024-11-28 03:24:10,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:10,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:24:10,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:10,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:24:10,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:24:10,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 101 [2024-11-28 03:24:10,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 33 transitions, 119 flow. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:10,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:10,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 101 [2024-11-28 03:24:10,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:10,803 INFO L124 PetriNetUnfolderBase]: 344/669 cut-off events. [2024-11-28 03:24:10,804 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2024-11-28 03:24:10,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 669 events. 344/669 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3569 event pairs, 164 based on Foata normal form. 24/684 useless extension candidates. Maximal degree in co-relation 1570. Up to 397 conditions per place. [2024-11-28 03:24:10,806 INFO L140 encePairwiseOnDemand]: 94/101 looper letters, 25 selfloop transitions, 4 changer transitions 23/66 dead transitions. [2024-11-28 03:24:10,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 317 flow [2024-11-28 03:24:10,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:24:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 03:24:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-11-28 03:24:10,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24504950495049505 [2024-11-28 03:24:10,809 INFO L175 Difference]: Start difference. First operand has 64 places, 33 transitions, 119 flow. Second operand 8 states and 198 transitions. [2024-11-28 03:24:10,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 317 flow [2024-11-28 03:24:10,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 257 flow, removed 17 selfloop flow, removed 12 redundant places. [2024-11-28 03:24:10,812 INFO L231 Difference]: Finished difference. Result has 60 places, 35 transitions, 122 flow [2024-11-28 03:24:10,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=122, PETRI_PLACES=60, PETRI_TRANSITIONS=35} [2024-11-28 03:24:10,813 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2024-11-28 03:24:10,813 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 35 transitions, 122 flow [2024-11-28 03:24:10,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:10,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:10,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:10,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:24:10,814 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:10,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash 702410478, now seen corresponding path program 1 times [2024-11-28 03:24:10,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:10,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927666408] [2024-11-28 03:24:10,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:10,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:12,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:12,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927666408] [2024-11-28 03:24:12,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927666408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:12,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:12,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:24:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124283814] [2024-11-28 03:24:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:12,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:24:12,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:12,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:24:12,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:24:12,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 101 [2024-11-28 03:24:12,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 35 transitions, 122 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:12,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:12,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 101 [2024-11-28 03:24:12,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:12,646 INFO L124 PetriNetUnfolderBase]: 327/632 cut-off events. [2024-11-28 03:24:12,646 INFO L125 PetriNetUnfolderBase]: For 448/449 co-relation queries the response was YES. [2024-11-28 03:24:12,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 632 events. 327/632 cut-off events. For 448/449 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3297 event pairs, 26 based on Foata normal form. 16/631 useless extension candidates. Maximal degree in co-relation 1630. Up to 336 conditions per place. [2024-11-28 03:24:12,651 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 31 selfloop transitions, 7 changer transitions 23/75 dead transitions. [2024-11-28 03:24:12,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 75 transitions, 371 flow [2024-11-28 03:24:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:24:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 03:24:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 259 transitions. [2024-11-28 03:24:12,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23312331233123312 [2024-11-28 03:24:12,656 INFO L175 Difference]: Start difference. First operand has 60 places, 35 transitions, 122 flow. Second operand 11 states and 259 transitions. [2024-11-28 03:24:12,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 75 transitions, 371 flow [2024-11-28 03:24:12,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 75 transitions, 353 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-28 03:24:12,661 INFO L231 Difference]: Finished difference. Result has 70 places, 39 transitions, 180 flow [2024-11-28 03:24:12,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=180, PETRI_PLACES=70, PETRI_TRANSITIONS=39} [2024-11-28 03:24:12,663 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -9 predicate places. [2024-11-28 03:24:12,663 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 39 transitions, 180 flow [2024-11-28 03:24:12,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:12,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:12,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:12,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:24:12,664 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:12,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:12,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1410360206, now seen corresponding path program 1 times [2024-11-28 03:24:12,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:12,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602185067] [2024-11-28 03:24:12,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:12,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:14,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:14,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602185067] [2024-11-28 03:24:14,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602185067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:14,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:14,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:24:14,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212819643] [2024-11-28 03:24:14,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:14,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:24:14,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:14,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:24:14,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:24:14,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 101 [2024-11-28 03:24:14,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 39 transitions, 180 flow. Second operand has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:14,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:14,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 101 [2024-11-28 03:24:14,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:14,670 INFO L124 PetriNetUnfolderBase]: 315/618 cut-off events. [2024-11-28 03:24:14,670 INFO L125 PetriNetUnfolderBase]: For 1256/1268 co-relation queries the response was YES. [2024-11-28 03:24:14,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 618 events. 315/618 cut-off events. For 1256/1268 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3308 event pairs, 32 based on Foata normal form. 12/614 useless extension candidates. Maximal degree in co-relation 1979. Up to 333 conditions per place. [2024-11-28 03:24:14,675 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 30 selfloop transitions, 9 changer transitions 15/68 dead transitions. [2024-11-28 03:24:14,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 414 flow [2024-11-28 03:24:14,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:24:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 03:24:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2024-11-28 03:24:14,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23542354235423543 [2024-11-28 03:24:14,677 INFO L175 Difference]: Start difference. First operand has 70 places, 39 transitions, 180 flow. Second operand 9 states and 214 transitions. [2024-11-28 03:24:14,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 414 flow [2024-11-28 03:24:14,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 68 transitions, 361 flow, removed 22 selfloop flow, removed 9 redundant places. [2024-11-28 03:24:14,684 INFO L231 Difference]: Finished difference. Result has 68 places, 41 transitions, 210 flow [2024-11-28 03:24:14,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=68, PETRI_TRANSITIONS=41} [2024-11-28 03:24:14,685 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -11 predicate places. [2024-11-28 03:24:14,685 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 41 transitions, 210 flow [2024-11-28 03:24:14,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:14,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:14,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:14,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:24:14,686 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:14,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash 394151544, now seen corresponding path program 2 times [2024-11-28 03:24:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:14,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145436664] [2024-11-28 03:24:14,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:24:14,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:14,750 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:24:14,750 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:24:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:16,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:16,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145436664] [2024-11-28 03:24:16,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145436664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:16,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:16,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:24:16,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95617639] [2024-11-28 03:24:16,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:16,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:24:16,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:16,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:24:16,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:24:16,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 101 [2024-11-28 03:24:16,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 41 transitions, 210 flow. Second operand has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:16,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:16,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 101 [2024-11-28 03:24:16,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:17,193 INFO L124 PetriNetUnfolderBase]: 319/626 cut-off events. [2024-11-28 03:24:17,193 INFO L125 PetriNetUnfolderBase]: For 1364/1388 co-relation queries the response was YES. [2024-11-28 03:24:17,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 626 events. 319/626 cut-off events. For 1364/1388 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3336 event pairs, 26 based on Foata normal form. 12/622 useless extension candidates. Maximal degree in co-relation 2069. Up to 320 conditions per place. [2024-11-28 03:24:17,198 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 33 selfloop transitions, 8 changer transitions 15/70 dead transitions. [2024-11-28 03:24:17,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 70 transitions, 450 flow [2024-11-28 03:24:17,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:24:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 03:24:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2024-11-28 03:24:17,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23542354235423543 [2024-11-28 03:24:17,200 INFO L175 Difference]: Start difference. First operand has 68 places, 41 transitions, 210 flow. Second operand 9 states and 214 transitions. [2024-11-28 03:24:17,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 70 transitions, 450 flow [2024-11-28 03:24:17,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 70 transitions, 403 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-11-28 03:24:17,207 INFO L231 Difference]: Finished difference. Result has 70 places, 43 transitions, 239 flow [2024-11-28 03:24:17,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=239, PETRI_PLACES=70, PETRI_TRANSITIONS=43} [2024-11-28 03:24:17,208 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -9 predicate places. [2024-11-28 03:24:17,208 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 43 transitions, 239 flow [2024-11-28 03:24:17,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:17,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:17,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:17,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:24:17,209 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:17,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:17,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1073683133, now seen corresponding path program 1 times [2024-11-28 03:24:17,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:17,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6632341] [2024-11-28 03:24:17,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:17,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:17,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:17,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6632341] [2024-11-28 03:24:17,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6632341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:17,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:17,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:24:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123912022] [2024-11-28 03:24:17,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:17,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:24:17,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:17,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:24:17,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:24:17,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 101 [2024-11-28 03:24:17,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 43 transitions, 239 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:17,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:17,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 101 [2024-11-28 03:24:17,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:17,708 INFO L124 PetriNetUnfolderBase]: 1014/1649 cut-off events. [2024-11-28 03:24:17,708 INFO L125 PetriNetUnfolderBase]: For 3816/3840 co-relation queries the response was YES. [2024-11-28 03:24:17,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5436 conditions, 1649 events. 1014/1649 cut-off events. For 3816/3840 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8328 event pairs, 92 based on Foata normal form. 70/1702 useless extension candidates. Maximal degree in co-relation 5415. Up to 1009 conditions per place. [2024-11-28 03:24:17,715 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 52 selfloop transitions, 5 changer transitions 1/68 dead transitions. [2024-11-28 03:24:17,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 519 flow [2024-11-28 03:24:17,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:24:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 03:24:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-11-28 03:24:17,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2524752475247525 [2024-11-28 03:24:17,719 INFO L175 Difference]: Start difference. First operand has 70 places, 43 transitions, 239 flow. Second operand 4 states and 102 transitions. [2024-11-28 03:24:17,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 519 flow [2024-11-28 03:24:17,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 477 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-11-28 03:24:17,727 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 247 flow [2024-11-28 03:24:17,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2024-11-28 03:24:17,727 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -15 predicate places. [2024-11-28 03:24:17,727 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 247 flow [2024-11-28 03:24:17,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:17,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:17,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:17,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:24:17,728 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:17,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:17,729 INFO L85 PathProgramCache]: Analyzing trace with hash 503225445, now seen corresponding path program 1 times [2024-11-28 03:24:17,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:17,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175902143] [2024-11-28 03:24:17,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:17,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:19,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175902143] [2024-11-28 03:24:19,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175902143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:19,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:19,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:24:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227058117] [2024-11-28 03:24:19,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:19,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:24:19,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:19,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:24:19,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:24:19,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 101 [2024-11-28 03:24:19,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 247 flow. Second operand has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:19,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:19,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 101 [2024-11-28 03:24:19,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:19,902 INFO L124 PetriNetUnfolderBase]: 492/930 cut-off events. [2024-11-28 03:24:19,902 INFO L125 PetriNetUnfolderBase]: For 1385/1419 co-relation queries the response was YES. [2024-11-28 03:24:19,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3046 conditions, 930 events. 492/930 cut-off events. For 1385/1419 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5081 event pairs, 267 based on Foata normal form. 22/898 useless extension candidates. Maximal degree in co-relation 3027. Up to 599 conditions per place. [2024-11-28 03:24:19,909 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 39 selfloop transitions, 14 changer transitions 6/76 dead transitions. [2024-11-28 03:24:19,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 516 flow [2024-11-28 03:24:19,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:24:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 03:24:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2024-11-28 03:24:19,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23322332233223322 [2024-11-28 03:24:19,911 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 247 flow. Second operand 9 states and 212 transitions. [2024-11-28 03:24:19,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 516 flow [2024-11-28 03:24:19,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 76 transitions, 498 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-28 03:24:19,915 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 386 flow [2024-11-28 03:24:19,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=386, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2024-11-28 03:24:19,916 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -5 predicate places. [2024-11-28 03:24:19,916 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 386 flow [2024-11-28 03:24:19,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:19,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:19,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:19,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:24:19,916 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:19,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:19,917 INFO L85 PathProgramCache]: Analyzing trace with hash -193045393, now seen corresponding path program 1 times [2024-11-28 03:24:19,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:19,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096049715] [2024-11-28 03:24:19,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:19,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:20,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:20,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096049715] [2024-11-28 03:24:20,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096049715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:20,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:20,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:24:20,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316621231] [2024-11-28 03:24:20,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:20,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:24:20,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:20,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:24:20,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:24:20,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 101 [2024-11-28 03:24:20,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 56 transitions, 386 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:20,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:20,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 101 [2024-11-28 03:24:20,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:20,516 INFO L124 PetriNetUnfolderBase]: 722/1201 cut-off events. [2024-11-28 03:24:20,517 INFO L125 PetriNetUnfolderBase]: For 2618/2668 co-relation queries the response was YES. [2024-11-28 03:24:20,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4072 conditions, 1201 events. 722/1201 cut-off events. For 2618/2668 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5421 event pairs, 56 based on Foata normal form. 65/1254 useless extension candidates. Maximal degree in co-relation 4049. Up to 601 conditions per place. [2024-11-28 03:24:20,525 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 57 selfloop transitions, 8 changer transitions 6/81 dead transitions. [2024-11-28 03:24:20,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 81 transitions, 680 flow [2024-11-28 03:24:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:24:20,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:24:20,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-11-28 03:24:20,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2514851485148515 [2024-11-28 03:24:20,526 INFO L175 Difference]: Start difference. First operand has 74 places, 56 transitions, 386 flow. Second operand 5 states and 127 transitions. [2024-11-28 03:24:20,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 81 transitions, 680 flow [2024-11-28 03:24:20,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 81 transitions, 620 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-11-28 03:24:20,535 INFO L231 Difference]: Finished difference. Result has 78 places, 48 transitions, 296 flow [2024-11-28 03:24:20,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=78, PETRI_TRANSITIONS=48} [2024-11-28 03:24:20,537 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -1 predicate places. [2024-11-28 03:24:20,537 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 48 transitions, 296 flow [2024-11-28 03:24:20,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:20,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:20,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:20,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:24:20,538 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:20,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:20,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1685322488, now seen corresponding path program 1 times [2024-11-28 03:24:20,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:20,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866832230] [2024-11-28 03:24:20,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:20,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:20,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:20,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866832230] [2024-11-28 03:24:20,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866832230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:20,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:20,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:24:20,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820397978] [2024-11-28 03:24:20,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:20,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:24:20,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:20,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:24:20,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:24:20,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 101 [2024-11-28 03:24:20,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 48 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:20,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:20,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 101 [2024-11-28 03:24:20,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:21,124 INFO L124 PetriNetUnfolderBase]: 373/626 cut-off events. [2024-11-28 03:24:21,124 INFO L125 PetriNetUnfolderBase]: For 1632/1668 co-relation queries the response was YES. [2024-11-28 03:24:21,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2279 conditions, 626 events. 373/626 cut-off events. For 1632/1668 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2306 event pairs, 29 based on Foata normal form. 41/656 useless extension candidates. Maximal degree in co-relation 2253. Up to 244 conditions per place. [2024-11-28 03:24:21,130 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 47 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-11-28 03:24:21,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 69 transitions, 530 flow [2024-11-28 03:24:21,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:24:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:24:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-11-28 03:24:21,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23102310231023102 [2024-11-28 03:24:21,132 INFO L175 Difference]: Start difference. First operand has 78 places, 48 transitions, 296 flow. Second operand 6 states and 140 transitions. [2024-11-28 03:24:21,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 69 transitions, 530 flow [2024-11-28 03:24:21,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 384 flow, removed 28 selfloop flow, removed 16 redundant places. [2024-11-28 03:24:21,139 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 211 flow [2024-11-28 03:24:21,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=65, PETRI_TRANSITIONS=44} [2024-11-28 03:24:21,139 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -14 predicate places. [2024-11-28 03:24:21,139 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 211 flow [2024-11-28 03:24:21,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:21,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:21,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:21,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:24:21,141 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:21,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:21,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1191754903, now seen corresponding path program 1 times [2024-11-28 03:24:21,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:21,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420533729] [2024-11-28 03:24:21,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:24:21,256 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:24:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:24:21,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:24:21,429 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:24:21,430 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2024-11-28 03:24:21,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (59 of 61 remaining) [2024-11-28 03:24:21,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2024-11-28 03:24:21,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2024-11-28 03:24:21,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2024-11-28 03:24:21,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2024-11-28 03:24:21,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2024-11-28 03:24:21,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2024-11-28 03:24:21,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2024-11-28 03:24:21,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2024-11-28 03:24:21,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2024-11-28 03:24:21,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2024-11-28 03:24:21,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2024-11-28 03:24:21,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2024-11-28 03:24:21,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2024-11-28 03:24:21,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2024-11-28 03:24:21,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2024-11-28 03:24:21,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2024-11-28 03:24:21,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2024-11-28 03:24:21,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2024-11-28 03:24:21,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2024-11-28 03:24:21,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2024-11-28 03:24:21,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2024-11-28 03:24:21,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2024-11-28 03:24:21,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2024-11-28 03:24:21,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2024-11-28 03:24:21,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2024-11-28 03:24:21,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2024-11-28 03:24:21,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2024-11-28 03:24:21,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2024-11-28 03:24:21,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2024-11-28 03:24:21,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2024-11-28 03:24:21,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (28 of 61 remaining) [2024-11-28 03:24:21,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 61 remaining) [2024-11-28 03:24:21,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 61 remaining) [2024-11-28 03:24:21,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2024-11-28 03:24:21,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 61 remaining) [2024-11-28 03:24:21,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2024-11-28 03:24:21,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2024-11-28 03:24:21,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2024-11-28 03:24:21,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2024-11-28 03:24:21,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2024-11-28 03:24:21,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2024-11-28 03:24:21,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2024-11-28 03:24:21,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2024-11-28 03:24:21,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2024-11-28 03:24:21,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2024-11-28 03:24:21,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2024-11-28 03:24:21,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2024-11-28 03:24:21,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2024-11-28 03:24:21,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2024-11-28 03:24:21,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2024-11-28 03:24:21,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2024-11-28 03:24:21,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2024-11-28 03:24:21,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2024-11-28 03:24:21,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2024-11-28 03:24:21,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2024-11-28 03:24:21,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2024-11-28 03:24:21,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2024-11-28 03:24:21,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2024-11-28 03:24:21,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2024-11-28 03:24:21,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 03:24:21,441 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:21,573 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 03:24:21,573 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:24:21,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:24:21 BasicIcfg [2024-11-28 03:24:21,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:24:21,584 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:24:21,584 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:24:21,584 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:24:21,585 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:23:53" (3/4) ... [2024-11-28 03:24:21,587 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 03:24:21,588 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:24:21,589 INFO L158 Benchmark]: Toolchain (without parser) took 31242.73ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 117.8MB in the beginning and 559.1MB in the end (delta: -441.3MB). Peak memory consumption was 765.8MB. Max. memory is 16.1GB. [2024-11-28 03:24:21,591 INFO L158 Benchmark]: CDTParser took 1.27ms. Allocated memory is still 142.6MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:21,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 850.99ms. Allocated memory is still 142.6MB. Free memory was 117.8MB in the beginning and 93.5MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 03:24:21,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.90ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:21,593 INFO L158 Benchmark]: Boogie Preprocessor took 109.22ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 87.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:24:21,593 INFO L158 Benchmark]: RCFGBuilder took 1937.39ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 87.2MB in the beginning and 385.1MB in the end (delta: -297.9MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2024-11-28 03:24:21,594 INFO L158 Benchmark]: TraceAbstraction took 28244.40ms. Allocated memory was 427.8MB in the beginning and 1.4GB in the end (delta: 922.7MB). Free memory was 385.1MB in the beginning and 559.3MB in the end (delta: -174.1MB). Peak memory consumption was 745.6MB. Max. memory is 16.1GB. [2024-11-28 03:24:21,595 INFO L158 Benchmark]: Witness Printer took 4.71ms. Allocated memory is still 1.4GB. Free memory was 559.3MB in the beginning and 559.1MB in the end (delta: 183.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:21,597 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.27ms. Allocated memory is still 142.6MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 850.99ms. Allocated memory is still 142.6MB. Free memory was 117.8MB in the beginning and 93.5MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.90ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 109.22ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 87.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1937.39ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 87.2MB in the beginning and 385.1MB in the end (delta: -297.9MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28244.40ms. Allocated memory was 427.8MB in the beginning and 1.4GB in the end (delta: 922.7MB). Free memory was 385.1MB in the beginning and 559.3MB in the end (delta: -174.1MB). Peak memory consumption was 745.6MB. Max. memory is 16.1GB. * Witness Printer took 4.71ms. Allocated memory is still 1.4GB. Free memory was 559.3MB in the beginning and 559.1MB in the end (delta: 183.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1940; [L851] FCALL, FORK 0 pthread_create(&t1940, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1940=-3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L852] 0 pthread_t t1941; [L853] FCALL, FORK 0 pthread_create(&t1941, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1940=-3, t1941=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L854] 0 pthread_t t1942; [L855] FCALL, FORK 0 pthread_create(&t1942, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1940=-3, t1941=-2, t1942=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 \read(y) [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L825] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L765] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L777] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1940=-3, t1941=-2, t1942=-1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1940=-3, t1941=-2, t1942=-1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1940=-3, t1941=-2, t1942=-1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L17] 0 __assert_fail ("0", "safe007_power.opt-thin001_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 851]: 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: 855]: 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, 122 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: 27.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 720 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 700 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1943 IncrementalHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 17 mSDtfsCounter, 1943 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=17, InterpolantAutomatonStates: 117, 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, 10.9s InterpolantComputationTime, 381 NumberOfCodeBlocks, 381 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 332 ConstructedInterpolants, 0 QuantifiedInterpolants, 3361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 03:24:21,628 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe007_power.opt-thin001_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6328ead9c10c029445fd051d7c6329db494c1000fb08b7313fbd69c70835e259 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:24:24,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:24:24,633 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 03:24:24,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:24:24,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:24:24,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:24:24,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:24:24,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:24:24,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:24:24,678 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:24:24,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:24:24,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:24:24,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:24:24,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:24:24,680 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:24:24,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:24:24,680 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:24:24,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:24:24,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:24:24,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:24:24,680 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:24:24,680 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:24:24,680 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:24:24,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:24:24,680 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:24:24,680 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 03:24:24,681 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 03:24:24,681 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:24:24,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:24:24,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:24:24,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:24:24,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:24:24,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:24:24,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:24:24,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:24:24,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:24:24,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:24:24,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:24:24,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:24:24,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:24:24,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:24:24,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:24:24,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:24:24,682 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 03:24:24,682 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 03:24:24,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:24:24,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:24:24,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:24:24,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:24:24,684 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6328ead9c10c029445fd051d7c6329db494c1000fb08b7313fbd69c70835e259 [2024-11-28 03:24:25,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:24:25,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:24:25,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:24:25,062 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:24:25,062 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:24:25,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2024-11-28 03:24:28,317 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/data/6e524e3c7/b5b4b448c6114c51be7309d6670bf6c0/FLAG2db51e57e [2024-11-28 03:24:28,657 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:24:28,658 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/sv-benchmarks/c/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2024-11-28 03:24:28,688 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/data/6e524e3c7/b5b4b448c6114c51be7309d6670bf6c0/FLAG2db51e57e [2024-11-28 03:24:28,711 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/data/6e524e3c7/b5b4b448c6114c51be7309d6670bf6c0 [2024-11-28 03:24:28,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:24:28,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:24:28,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:24:28,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:24:28,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:24:28,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:24:28" (1/1) ... [2024-11-28 03:24:28,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae8fe2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:28, skipping insertion in model container [2024-11-28 03:24:28,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:24:28" (1/1) ... [2024-11-28 03:24:28,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:24:29,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:24:29,241 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:24:29,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:24:29,360 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:24:29,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:29 WrapperNode [2024-11-28 03:24:29,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:24:29,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:24:29,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:24:29,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:24:29,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:29" (1/1) ... [2024-11-28 03:24:29,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:29" (1/1) ... [2024-11-28 03:24:29,422 INFO L138 Inliner]: procedures = 179, calls = 60, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 175 [2024-11-28 03:24:29,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:24:29,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:24:29,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:24:29,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:24:29,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:29" (1/1) ... [2024-11-28 03:24:29,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:29" (1/1) ... [2024-11-28 03:24:29,437 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:29" (1/1) ... [2024-11-28 03:24:29,473 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-11-28 03:24:29,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:29" (1/1) ... [2024-11-28 03:24:29,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:29" (1/1) ... [2024-11-28 03:24:29,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:29" (1/1) ... [2024-11-28 03:24:29,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:29" (1/1) ... [2024-11-28 03:24:29,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:29" (1/1) ... [2024-11-28 03:24:29,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:29" (1/1) ... [2024-11-28 03:24:29,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:29" (1/1) ... [2024-11-28 03:24:29,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:24:29,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:24:29,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:24:29,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:24:29,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:29" (1/1) ... [2024-11-28 03:24:29,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:24:29,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:29,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:24:29,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:24:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 03:24:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 03:24:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 03:24:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:24:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 03:24:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 03:24:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 03:24:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 03:24:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-28 03:24:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-28 03:24:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-28 03:24:29,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-28 03:24:29,574 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-28 03:24:29,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-28 03:24:29,574 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-28 03:24:29,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-28 03:24:29,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 03:24:29,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:24:29,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:24:29,576 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:24:29,766 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:24:29,769 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:24:30,483 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:24:30,483 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:24:31,278 WARN L170 LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2024-11-28 03:24:31,474 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:24:31,474 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 03:24:31,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:24:31 BoogieIcfgContainer [2024-11-28 03:24:31,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:24:31,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:24:31,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:24:31,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:24:31,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:24:28" (1/3) ... [2024-11-28 03:24:31,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793f0ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:24:31, skipping insertion in model container [2024-11-28 03:24:31,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:29" (2/3) ... [2024-11-28 03:24:31,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793f0ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:24:31, skipping insertion in model container [2024-11-28 03:24:31,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:24:31" (3/3) ... [2024-11-28 03:24:31,489 INFO L128 eAbstractionObserver]: Analyzing ICFG safe007_power.opt-thin001_power.opt.i [2024-11-28 03:24:31,508 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:24:31,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe007_power.opt-thin001_power.opt.i that has 4 procedures, 73 locations, 1 initial locations, 0 loop locations, and 33 error locations. [2024-11-28 03:24:31,510 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:24:31,806 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 03:24:31,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 101 transitions, 214 flow [2024-11-28 03:24:31,949 INFO L124 PetriNetUnfolderBase]: 29/98 cut-off events. [2024-11-28 03:24:31,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:24:31,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 29/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 328 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 100. Up to 4 conditions per place. [2024-11-28 03:24:31,958 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 101 transitions, 214 flow [2024-11-28 03:24:31,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 98 transitions, 205 flow [2024-11-28 03:24:31,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:24:32,002 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@1116197a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:24:32,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-28 03:24:32,009 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:24:32,009 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2024-11-28 03:24:32,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:24:32,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:32,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:32,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:32,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:32,018 INFO L85 PathProgramCache]: Analyzing trace with hash 185554318, now seen corresponding path program 1 times [2024-11-28 03:24:32,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:32,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628761590] [2024-11-28 03:24:32,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:32,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:32,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:32,036 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:32,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:24:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:32,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:24:32,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:32,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:32,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:32,308 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:32,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628761590] [2024-11-28 03:24:32,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628761590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:32,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:32,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 03:24:32,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460944845] [2024-11-28 03:24:32,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:32,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:24:32,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:32,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:24:32,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:24:32,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 03:24:32,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 98 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:32,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:32,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 03:24:32,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:35,847 INFO L124 PetriNetUnfolderBase]: 9134/13978 cut-off events. [2024-11-28 03:24:35,848 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-28 03:24:35,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27062 conditions, 13978 events. 9134/13978 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 1615. Compared 123917 event pairs, 2512 based on Foata normal form. 516/7942 useless extension candidates. Maximal degree in co-relation 27051. Up to 7491 conditions per place. [2024-11-28 03:24:35,994 INFO L140 encePairwiseOnDemand]: 54/101 looper letters, 69 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2024-11-28 03:24:35,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 332 flow [2024-11-28 03:24:35,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:24:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:24:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2024-11-28 03:24:36,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7029702970297029 [2024-11-28 03:24:36,011 INFO L175 Difference]: Start difference. First operand has 79 places, 98 transitions, 205 flow. Second operand 3 states and 213 transitions. [2024-11-28 03:24:36,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 332 flow [2024-11-28 03:24:36,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 328 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 03:24:36,021 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 140 flow [2024-11-28 03:24:36,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-11-28 03:24:36,028 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -15 predicate places. [2024-11-28 03:24:36,028 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 140 flow [2024-11-28 03:24:36,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:36,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:36,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:36,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:24:36,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:36,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:36,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:36,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1457217472, now seen corresponding path program 1 times [2024-11-28 03:24:36,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:36,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [81948795] [2024-11-28 03:24:36,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:36,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:36,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:36,248 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:36,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:24:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:36,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:24:36,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:36,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:36,558 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:36,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81948795] [2024-11-28 03:24:36,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81948795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:36,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:36,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 03:24:36,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739997424] [2024-11-28 03:24:36,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:36,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:24:36,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:36,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:24:36,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:24:36,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 03:24:36,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:36,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:36,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 03:24:36,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:38,100 INFO L124 PetriNetUnfolderBase]: 4048/6490 cut-off events. [2024-11-28 03:24:38,100 INFO L125 PetriNetUnfolderBase]: For 1100/1100 co-relation queries the response was YES. [2024-11-28 03:24:38,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13393 conditions, 6490 events. 4048/6490 cut-off events. For 1100/1100 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 53383 event pairs, 3658 based on Foata normal form. 0/4392 useless extension candidates. Maximal degree in co-relation 13381. Up to 5819 conditions per place. [2024-11-28 03:24:38,142 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 33 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2024-11-28 03:24:38,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 194 flow [2024-11-28 03:24:38,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:24:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:24:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-28 03:24:38,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3201320132013201 [2024-11-28 03:24:38,144 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 140 flow. Second operand 3 states and 97 transitions. [2024-11-28 03:24:38,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 194 flow [2024-11-28 03:24:38,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 50 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:24:38,146 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 122 flow [2024-11-28 03:24:38,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-11-28 03:24:38,147 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2024-11-28 03:24:38,147 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 122 flow [2024-11-28 03:24:38,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:38,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:38,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:38,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:24:38,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:38,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:38,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1457217473, now seen corresponding path program 1 times [2024-11-28 03:24:38,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:38,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [222785072] [2024-11-28 03:24:38,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:38,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:38,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:38,356 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:38,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:24:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:38,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:24:38,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:38,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:38,623 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222785072] [2024-11-28 03:24:38,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222785072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:38,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:38,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 03:24:38,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518754145] [2024-11-28 03:24:38,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:38,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:24:38,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:38,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:24:38,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:24:38,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 03:24:38,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:38,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:38,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 03:24:38,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:39,087 INFO L124 PetriNetUnfolderBase]: 1238/2098 cut-off events. [2024-11-28 03:24:39,088 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2024-11-28 03:24:39,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4313 conditions, 2098 events. 1238/2098 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 14997 event pairs, 1040 based on Foata normal form. 88/1856 useless extension candidates. Maximal degree in co-relation 4305. Up to 1809 conditions per place. [2024-11-28 03:24:39,101 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 25 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-28 03:24:39,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 162 flow [2024-11-28 03:24:39,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:24:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:24:39,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-28 03:24:39,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.297029702970297 [2024-11-28 03:24:39,106 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 122 flow. Second operand 3 states and 90 transitions. [2024-11-28 03:24:39,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 162 flow [2024-11-28 03:24:39,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:24:39,107 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 107 flow [2024-11-28 03:24:39,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-11-28 03:24:39,109 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2024-11-28 03:24:39,110 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 107 flow [2024-11-28 03:24:39,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:39,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:39,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:39,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:24:39,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:39,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:39,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:39,312 INFO L85 PathProgramCache]: Analyzing trace with hash 781327504, now seen corresponding path program 1 times [2024-11-28 03:24:39,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:39,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233033487] [2024-11-28 03:24:39,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:39,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:39,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:39,315 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:39,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:24:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:39,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 03:24:39,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:39,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:39,501 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:39,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233033487] [2024-11-28 03:24:39,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233033487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:39,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:39,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 03:24:39,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584940356] [2024-11-28 03:24:39,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:39,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:24:39,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:39,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:24:39,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:24:39,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 03:24:39,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:39,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:39,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 03:24:39,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:39,925 INFO L124 PetriNetUnfolderBase]: 1051/1839 cut-off events. [2024-11-28 03:24:39,926 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-28 03:24:39,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3712 conditions, 1839 events. 1051/1839 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 12906 event pairs, 151 based on Foata normal form. 0/1603 useless extension candidates. Maximal degree in co-relation 3703. Up to 1377 conditions per place. [2024-11-28 03:24:39,937 INFO L140 encePairwiseOnDemand]: 94/101 looper letters, 31 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2024-11-28 03:24:39,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 205 flow [2024-11-28 03:24:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:24:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:24:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-11-28 03:24:39,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31353135313531355 [2024-11-28 03:24:39,939 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 107 flow. Second operand 3 states and 95 transitions. [2024-11-28 03:24:39,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 205 flow [2024-11-28 03:24:39,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:24:39,941 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 128 flow [2024-11-28 03:24:39,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-11-28 03:24:39,941 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2024-11-28 03:24:39,941 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 128 flow [2024-11-28 03:24:39,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:39,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:39,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:39,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 03:24:40,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:40,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:40,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:40,143 INFO L85 PathProgramCache]: Analyzing trace with hash -763413856, now seen corresponding path program 1 times [2024-11-28 03:24:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:40,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [912081595] [2024-11-28 03:24:40,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:40,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:40,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:40,146 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:40,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:24:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:40,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 03:24:40,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:40,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:40,492 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:40,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912081595] [2024-11-28 03:24:40,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912081595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:40,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:40,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:24:40,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544662421] [2024-11-28 03:24:40,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:40,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:24:40,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:40,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:24:40,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:24:40,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 03:24:40,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:40,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:40,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 03:24:40,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:40,966 INFO L124 PetriNetUnfolderBase]: 972/1718 cut-off events. [2024-11-28 03:24:40,967 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2024-11-28 03:24:40,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 1718 events. 972/1718 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 11856 event pairs, 123 based on Foata normal form. 0/1566 useless extension candidates. Maximal degree in co-relation 3913. Up to 1255 conditions per place. [2024-11-28 03:24:40,978 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 30 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2024-11-28 03:24:40,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 220 flow [2024-11-28 03:24:40,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:24:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 03:24:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2024-11-28 03:24:40,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27722772277227725 [2024-11-28 03:24:40,981 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 128 flow. Second operand 4 states and 112 transitions. [2024-11-28 03:24:40,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 220 flow [2024-11-28 03:24:40,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:24:40,983 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 124 flow [2024-11-28 03:24:40,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-28 03:24:40,984 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2024-11-28 03:24:40,984 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 124 flow [2024-11-28 03:24:40,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:40,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:40,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:40,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 03:24:41,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:41,189 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:41,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:41,191 INFO L85 PathProgramCache]: Analyzing trace with hash -151894119, now seen corresponding path program 1 times [2024-11-28 03:24:41,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:41,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1624902423] [2024-11-28 03:24:41,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:41,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:41,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:41,194 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:41,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:24:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:41,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:24:41,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:41,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:41,474 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:41,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624902423] [2024-11-28 03:24:41,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624902423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:41,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:41,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:24:41,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973869165] [2024-11-28 03:24:41,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:41,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:24:41,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:41,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:24:41,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:24:41,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 03:24:41,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:41,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:41,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 03:24:41,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:42,015 INFO L124 PetriNetUnfolderBase]: 893/1597 cut-off events. [2024-11-28 03:24:42,015 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2024-11-28 03:24:42,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 1597 events. 893/1597 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10813 event pairs, 95 based on Foata normal form. 42/1487 useless extension candidates. Maximal degree in co-relation 3623. Up to 1134 conditions per place. [2024-11-28 03:24:42,028 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 29 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-11-28 03:24:42,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 214 flow [2024-11-28 03:24:42,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:24:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 03:24:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-11-28 03:24:42,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2747524752475248 [2024-11-28 03:24:42,030 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 124 flow. Second operand 4 states and 111 transitions. [2024-11-28 03:24:42,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 214 flow [2024-11-28 03:24:42,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 201 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 03:24:42,033 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 119 flow [2024-11-28 03:24:42,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-11-28 03:24:42,034 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2024-11-28 03:24:42,034 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 119 flow [2024-11-28 03:24:42,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:42,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:42,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:42,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 03:24:42,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:42,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:42,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:42,239 INFO L85 PathProgramCache]: Analyzing trace with hash 700218234, now seen corresponding path program 1 times [2024-11-28 03:24:42,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:42,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889802782] [2024-11-28 03:24:42,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:42,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:42,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:42,241 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:42,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:24:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:42,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 03:24:42,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:42,435 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:42,435 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:42,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889802782] [2024-11-28 03:24:42,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889802782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:42,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:42,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 03:24:42,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354474842] [2024-11-28 03:24:42,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:42,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:24:42,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:42,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:24:42,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:24:42,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 101 [2024-11-28 03:24:42,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:42,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:42,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 101 [2024-11-28 03:24:42,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:42,891 INFO L124 PetriNetUnfolderBase]: 893/1553 cut-off events. [2024-11-28 03:24:42,892 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2024-11-28 03:24:42,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 1553 events. 893/1553 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10686 event pairs, 749 based on Foata normal form. 50/1427 useless extension candidates. Maximal degree in co-relation 3579. Up to 1314 conditions per place. [2024-11-28 03:24:42,902 INFO L140 encePairwiseOnDemand]: 99/101 looper letters, 22 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-28 03:24:42,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 165 flow [2024-11-28 03:24:42,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:24:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:24:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-28 03:24:42,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25742574257425743 [2024-11-28 03:24:42,904 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 119 flow. Second operand 3 states and 78 transitions. [2024-11-28 03:24:42,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 165 flow [2024-11-28 03:24:42,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:24:42,906 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 110 flow [2024-11-28 03:24:42,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-28 03:24:42,907 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -29 predicate places. [2024-11-28 03:24:42,907 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 110 flow [2024-11-28 03:24:42,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:42,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:42,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:42,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 03:24:43,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:43,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:43,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:43,113 INFO L85 PathProgramCache]: Analyzing trace with hash 700219493, now seen corresponding path program 1 times [2024-11-28 03:24:43,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:43,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1341468395] [2024-11-28 03:24:43,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:43,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:43,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:43,117 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:43,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:24:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:43,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:24:43,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:43,314 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:43,314 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:43,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341468395] [2024-11-28 03:24:43,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341468395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:43,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:43,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:24:43,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876697715] [2024-11-28 03:24:43,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:43,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:24:43,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:43,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:24:43,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:24:43,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 101 [2024-11-28 03:24:43,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:43,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:43,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 101 [2024-11-28 03:24:43,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:44,128 INFO L124 PetriNetUnfolderBase]: 2336/3742 cut-off events. [2024-11-28 03:24:44,128 INFO L125 PetriNetUnfolderBase]: For 239/239 co-relation queries the response was YES. [2024-11-28 03:24:44,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8528 conditions, 3742 events. 2336/3742 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 23636 event pairs, 188 based on Foata normal form. 123/3570 useless extension candidates. Maximal degree in co-relation 8518. Up to 2251 conditions per place. [2024-11-28 03:24:44,144 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 52 selfloop transitions, 5 changer transitions 1/69 dead transitions. [2024-11-28 03:24:44,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 336 flow [2024-11-28 03:24:44,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:24:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 03:24:44,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-11-28 03:24:44,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2896039603960396 [2024-11-28 03:24:44,146 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 110 flow. Second operand 4 states and 117 transitions. [2024-11-28 03:24:44,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 336 flow [2024-11-28 03:24:44,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 69 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:24:44,148 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 143 flow [2024-11-28 03:24:44,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2024-11-28 03:24:44,149 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -26 predicate places. [2024-11-28 03:24:44,149 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 143 flow [2024-11-28 03:24:44,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:44,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:44,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:44,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 03:24:44,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:44,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:44,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash -881489896, now seen corresponding path program 1 times [2024-11-28 03:24:44,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:44,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771352693] [2024-11-28 03:24:44,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:44,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:44,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:44,356 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:44,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:24:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:44,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:24:44,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:44,556 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:44,556 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:44,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771352693] [2024-11-28 03:24:44,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771352693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:44,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:44,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:24:44,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608670473] [2024-11-28 03:24:44,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:44,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:24:44,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:44,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:24:44,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:24:44,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 101 [2024-11-28 03:24:44,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:44,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:44,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 101 [2024-11-28 03:24:44,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:45,055 INFO L124 PetriNetUnfolderBase]: 1539/2518 cut-off events. [2024-11-28 03:24:45,055 INFO L125 PetriNetUnfolderBase]: For 748/748 co-relation queries the response was YES. [2024-11-28 03:24:45,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6503 conditions, 2518 events. 1539/2518 cut-off events. For 748/748 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14328 event pairs, 71 based on Foata normal form. 110/2447 useless extension candidates. Maximal degree in co-relation 6490. Up to 1177 conditions per place. [2024-11-28 03:24:45,066 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 64 selfloop transitions, 8 changer transitions 1/84 dead transitions. [2024-11-28 03:24:45,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 454 flow [2024-11-28 03:24:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:24:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:24:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-11-28 03:24:45,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29306930693069305 [2024-11-28 03:24:45,068 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 143 flow. Second operand 5 states and 148 transitions. [2024-11-28 03:24:45,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 454 flow [2024-11-28 03:24:45,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 444 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-28 03:24:45,071 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 183 flow [2024-11-28 03:24:45,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-11-28 03:24:45,072 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2024-11-28 03:24:45,072 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 183 flow [2024-11-28 03:24:45,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:45,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:45,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:45,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 03:24:45,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:45,277 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:45,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1736490434, now seen corresponding path program 1 times [2024-11-28 03:24:45,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:45,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361257276] [2024-11-28 03:24:45,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:45,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:45,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:45,279 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:45,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:24:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:45,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:24:45,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:45,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:45,502 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:45,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361257276] [2024-11-28 03:24:45,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361257276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:45,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:45,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:24:45,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886793767] [2024-11-28 03:24:45,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:45,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:24:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:45,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:24:45,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:24:45,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 101 [2024-11-28 03:24:45,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:45,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:45,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 101 [2024-11-28 03:24:45,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:45,981 INFO L124 PetriNetUnfolderBase]: 806/1307 cut-off events. [2024-11-28 03:24:45,981 INFO L125 PetriNetUnfolderBase]: For 1139/1139 co-relation queries the response was YES. [2024-11-28 03:24:45,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3801 conditions, 1307 events. 806/1307 cut-off events. For 1139/1139 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6152 event pairs, 48 based on Foata normal form. 64/1280 useless extension candidates. Maximal degree in co-relation 3786. Up to 468 conditions per place. [2024-11-28 03:24:45,987 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 55 selfloop transitions, 11 changer transitions 1/78 dead transitions. [2024-11-28 03:24:45,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 435 flow [2024-11-28 03:24:45,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:24:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:24:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-11-28 03:24:45,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2590759075907591 [2024-11-28 03:24:45,988 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 183 flow. Second operand 6 states and 157 transitions. [2024-11-28 03:24:45,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 435 flow [2024-11-28 03:24:45,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 410 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-28 03:24:45,994 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 197 flow [2024-11-28 03:24:45,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=161, 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=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2024-11-28 03:24:45,995 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2024-11-28 03:24:45,995 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 197 flow [2024-11-28 03:24:45,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:45,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:45,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:46,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 03:24:46,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:46,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:46,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash 862853619, now seen corresponding path program 1 times [2024-11-28 03:24:46,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:46,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2040299424] [2024-11-28 03:24:46,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:46,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:46,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:46,200 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:46,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:24:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:46,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 03:24:46,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:46,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:46,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:46,585 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:46,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040299424] [2024-11-28 03:24:46,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040299424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:46,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:46,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:24:46,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312969514] [2024-11-28 03:24:46,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:46,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:24:46,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:46,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:24:46,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:24:46,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 101 [2024-11-28 03:24:46,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 197 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:46,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:46,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 101 [2024-11-28 03:24:46,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:47,264 INFO L124 PetriNetUnfolderBase]: 1696/2724 cut-off events. [2024-11-28 03:24:47,265 INFO L125 PetriNetUnfolderBase]: For 2570/2572 co-relation queries the response was YES. [2024-11-28 03:24:47,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7961 conditions, 2724 events. 1696/2724 cut-off events. For 2570/2572 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 14250 event pairs, 349 based on Foata normal form. 16/2568 useless extension candidates. Maximal degree in co-relation 7945. Up to 1154 conditions per place. [2024-11-28 03:24:47,276 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 57 selfloop transitions, 7 changer transitions 37/110 dead transitions. [2024-11-28 03:24:47,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 110 transitions, 691 flow [2024-11-28 03:24:47,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:24:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 03:24:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2024-11-28 03:24:47,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2545968882602546 [2024-11-28 03:24:47,278 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 197 flow. Second operand 7 states and 180 transitions. [2024-11-28 03:24:47,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 110 transitions, 691 flow [2024-11-28 03:24:47,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 110 transitions, 574 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-11-28 03:24:47,288 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 198 flow [2024-11-28 03:24:47,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=198, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2024-11-28 03:24:47,289 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -16 predicate places. [2024-11-28 03:24:47,289 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 198 flow [2024-11-28 03:24:47,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:47,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:47,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:47,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 03:24:47,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:47,490 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 03:24:47,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:47,491 INFO L85 PathProgramCache]: Analyzing trace with hash -743085941, now seen corresponding path program 2 times [2024-11-28 03:24:47,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:47,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [616949822] [2024-11-28 03:24:47,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:24:47,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:47,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:47,495 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:47,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 03:24:47,687 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:24:47,687 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 03:24:47,687 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:24:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:24:47,843 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-28 03:24:47,843 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:24:47,844 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2024-11-28 03:24:47,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (59 of 61 remaining) [2024-11-28 03:24:47,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2024-11-28 03:24:47,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2024-11-28 03:24:47,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2024-11-28 03:24:47,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2024-11-28 03:24:47,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2024-11-28 03:24:47,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2024-11-28 03:24:47,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2024-11-28 03:24:47,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2024-11-28 03:24:47,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2024-11-28 03:24:47,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2024-11-28 03:24:47,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2024-11-28 03:24:47,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2024-11-28 03:24:47,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2024-11-28 03:24:47,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2024-11-28 03:24:47,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2024-11-28 03:24:47,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2024-11-28 03:24:47,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2024-11-28 03:24:47,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2024-11-28 03:24:47,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2024-11-28 03:24:47,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2024-11-28 03:24:47,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2024-11-28 03:24:47,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2024-11-28 03:24:47,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2024-11-28 03:24:47,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2024-11-28 03:24:47,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2024-11-28 03:24:47,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2024-11-28 03:24:47,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2024-11-28 03:24:47,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2024-11-28 03:24:47,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2024-11-28 03:24:47,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2024-11-28 03:24:47,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (28 of 61 remaining) [2024-11-28 03:24:47,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 61 remaining) [2024-11-28 03:24:47,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 61 remaining) [2024-11-28 03:24:47,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2024-11-28 03:24:47,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 61 remaining) [2024-11-28 03:24:47,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2024-11-28 03:24:47,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2024-11-28 03:24:47,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2024-11-28 03:24:47,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2024-11-28 03:24:47,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2024-11-28 03:24:47,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2024-11-28 03:24:47,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2024-11-28 03:24:47,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2024-11-28 03:24:47,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2024-11-28 03:24:47,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2024-11-28 03:24:47,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2024-11-28 03:24:47,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2024-11-28 03:24:47,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2024-11-28 03:24:47,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2024-11-28 03:24:47,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2024-11-28 03:24:47,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2024-11-28 03:24:47,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2024-11-28 03:24:47,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2024-11-28 03:24:47,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2024-11-28 03:24:47,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2024-11-28 03:24:47,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2024-11-28 03:24:47,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2024-11-28 03:24:47,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2024-11-28 03:24:47,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2024-11-28 03:24:47,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-28 03:24:48,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:48,059 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:48,154 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 03:24:48,154 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:24:48,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:24:48 BasicIcfg [2024-11-28 03:24:48,159 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:24:48,160 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:24:48,160 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:24:48,160 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:24:48,161 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:24:31" (3/4) ... [2024-11-28 03:24:48,163 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 03:24:48,164 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:24:48,164 INFO L158 Benchmark]: Toolchain (without parser) took 19449.11ms. Allocated memory was 83.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 58.5MB in the beginning and 462.8MB in the end (delta: -404.2MB). Peak memory consumption was 837.9MB. Max. memory is 16.1GB. [2024-11-28 03:24:48,165 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 83.9MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:48,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 645.23ms. Allocated memory is still 83.9MB. Free memory was 58.5MB in the beginning and 34.0MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 03:24:48,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.24ms. Allocated memory is still 83.9MB. Free memory was 34.0MB in the beginning and 31.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:48,166 INFO L158 Benchmark]: Boogie Preprocessor took 86.72ms. Allocated memory is still 83.9MB. Free memory was 31.6MB in the beginning and 27.8MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:24:48,166 INFO L158 Benchmark]: RCFGBuilder took 1964.86ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 27.8MB in the beginning and 57.6MB in the end (delta: -29.8MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2024-11-28 03:24:48,166 INFO L158 Benchmark]: TraceAbstraction took 16681.75ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 57.6MB in the beginning and 462.9MB in the end (delta: -405.3MB). Peak memory consumption was 801.8MB. Max. memory is 16.1GB. [2024-11-28 03:24:48,166 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 1.3GB. Free memory was 462.9MB in the beginning and 462.8MB in the end (delta: 117.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:48,168 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 83.9MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 645.23ms. Allocated memory is still 83.9MB. Free memory was 58.5MB in the beginning and 34.0MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.24ms. Allocated memory is still 83.9MB. Free memory was 34.0MB in the beginning and 31.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 86.72ms. Allocated memory is still 83.9MB. Free memory was 31.6MB in the beginning and 27.8MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1964.86ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 27.8MB in the beginning and 57.6MB in the end (delta: -29.8MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16681.75ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 57.6MB in the beginning and 462.9MB in the end (delta: -405.3MB). Peak memory consumption was 801.8MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 1.3GB. Free memory was 462.9MB in the beginning and 462.8MB in the end (delta: 117.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1940; [L851] FCALL, FORK 0 pthread_create(&t1940, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1940=13, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L852] 0 pthread_t t1941; [L853] FCALL, FORK 0 pthread_create(&t1941, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1940=13, t1941=14, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L854] 0 pthread_t t1942; [L855] FCALL, FORK 0 pthread_create(&t1942, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1940=13, t1941=14, t1942=15, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L825] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L765] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L777] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1940=13, t1941=14, t1942=15, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1940=13, t1941=14, t1942=15, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1940=13, t1941=14, t1942=15, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L17] 0 __assert_fail ("0", "safe007_power.opt-thin001_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 851]: 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: 855]: 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, 122 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: 16.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 499 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 475 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 926 IncrementalHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 3 mSDtfsCounter, 926 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=0, InterpolantAutomatonStates: 45, 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.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 829 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1320 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 03:24:48,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d777371c-0f48-4719-a7bd-64ce2fb2d44c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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