./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx --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 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:22:11,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:22:11,443 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-21 22:22:11,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:22:11,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:22:11,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:22:11,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:22:11,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:22:11,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:22:11,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:22:11,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:22:11,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:22:11,512 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:22:11,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:22:11,515 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:22:11,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:22:11,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:22:11,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:22:11,517 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 22:22:11,517 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 22:22:11,518 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 22:22:11,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:22:11,519 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 22:22:11,519 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:22:11,520 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:22:11,520 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:22:11,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:22:11,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:22:11,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:22:11,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:22:11,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:22:11,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:22:11,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:22:11,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:22:11,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:22:11,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:22:11,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:22:11,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:22:11,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:22:11,525 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx 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 -> 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da [2023-11-21 22:22:11,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:22:11,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:22:11,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:22:11,866 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:22:11,896 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:22:11,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2023-11-21 22:22:14,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:22:15,255 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:22:15,276 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2023-11-21 22:22:15,297 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/data/edf3dc30b/78e26ca710ad419694ab33541a53366a/FLAG5bf5ca0f7 [2023-11-21 22:22:15,311 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/data/edf3dc30b/78e26ca710ad419694ab33541a53366a [2023-11-21 22:22:15,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:22:15,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:22:15,317 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:22:15,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:22:15,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:22:15,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:22:15" (1/1) ... [2023-11-21 22:22:15,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474e6da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:15, skipping insertion in model container [2023-11-21 22:22:15,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:22:15" (1/1) ... [2023-11-21 22:22:15,378 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:22:15,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:22:15,874 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:22:15,935 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:22:15,975 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:22:15,976 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:22:15,984 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:22:15,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:15 WrapperNode [2023-11-21 22:22:15,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:22:15,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:22:15,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:22:15,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:22:15,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:15" (1/1) ... [2023-11-21 22:22:16,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:15" (1/1) ... [2023-11-21 22:22:16,043 INFO L138 Inliner]: procedures = 176, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 187 [2023-11-21 22:22:16,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:22:16,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:22:16,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:22:16,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:22:16,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:15" (1/1) ... [2023-11-21 22:22:16,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:15" (1/1) ... [2023-11-21 22:22:16,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:15" (1/1) ... [2023-11-21 22:22:16,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:15" (1/1) ... [2023-11-21 22:22:16,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:15" (1/1) ... [2023-11-21 22:22:16,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:15" (1/1) ... [2023-11-21 22:22:16,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:15" (1/1) ... [2023-11-21 22:22:16,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:15" (1/1) ... [2023-11-21 22:22:16,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:22:16,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:22:16,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:22:16,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:22:16,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:15" (1/1) ... [2023-11-21 22:22:16,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:22:16,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:22:16,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:22:16,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:22:16,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 22:22:16,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:22:16,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 22:22:16,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:22:16,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:22:16,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:22:16,242 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 22:22:16,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 22:22:16,242 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 22:22:16,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 22:22:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 22:22:16,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 22:22:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 22:22:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 22:22:16,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:22:16,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:22:16,248 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:22:16,474 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:22:16,477 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:22:17,081 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:22:17,688 WARN L1820 r$LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2023-11-21 22:22:17,856 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:22:17,856 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:22:17,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:22:17 BoogieIcfgContainer [2023-11-21 22:22:17,859 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:22:17,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:22:17,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:22:17,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:22:17,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:22:15" (1/3) ... [2023-11-21 22:22:17,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5398cb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:22:17, skipping insertion in model container [2023-11-21 22:22:17,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:15" (2/3) ... [2023-11-21 22:22:17,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5398cb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:22:17, skipping insertion in model container [2023-11-21 22:22:17,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:22:17" (3/3) ... [2023-11-21 22:22:17,871 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2023-11-21 22:22:17,890 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:22:17,891 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2023-11-21 22:22:17,891 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:22:18,087 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 22:22:18,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 110 transitions, 232 flow [2023-11-21 22:22:18,223 INFO L124 PetriNetUnfolderBase]: 29/107 cut-off events. [2023-11-21 22:22:18,223 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:22:18,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 29/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 310 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 106. Up to 4 conditions per place. [2023-11-21 22:22:18,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 110 transitions, 232 flow [2023-11-21 22:22:18,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 107 transitions, 223 flow [2023-11-21 22:22:18,260 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:22:18,267 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2de3b13e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:22:18,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2023-11-21 22:22:18,270 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:22:18,270 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-21 22:22:18,271 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:22:18,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:18,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:22:18,272 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:18,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:18,278 INFO L85 PathProgramCache]: Analyzing trace with hash 28312, now seen corresponding path program 1 times [2023-11-21 22:22:18,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:18,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680487217] [2023-11-21 22:22:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:18,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:18,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:18,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680487217] [2023-11-21 22:22:18,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680487217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:18,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:18,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:22:18,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856568972] [2023-11-21 22:22:18,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:18,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:22:18,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:18,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:22:18,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:22:18,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 110 [2023-11-21 22:22:18,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 107 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:18,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:18,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 110 [2023-11-21 22:22:18,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:21,724 INFO L124 PetriNetUnfolderBase]: 6863/10581 cut-off events. [2023-11-21 22:22:21,725 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-21 22:22:21,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20233 conditions, 10581 events. 6863/10581 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 87971 event pairs, 5229 based on Foata normal form. 360/5822 useless extension candidates. Maximal degree in co-relation 20219. Up to 8313 conditions per place. [2023-11-21 22:22:21,863 INFO L140 encePairwiseOnDemand]: 67/110 looper letters, 61 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2023-11-21 22:22:21,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 86 transitions, 307 flow [2023-11-21 22:22:21,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:22:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:22:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2023-11-21 22:22:21,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-21 22:22:21,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 220 transitions. [2023-11-21 22:22:21,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 220 transitions. [2023-11-21 22:22:21,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:21,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 220 transitions. [2023-11-21 22:22:21,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:21,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:21,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:21,896 INFO L175 Difference]: Start difference. First operand has 88 places, 107 transitions, 223 flow. Second operand 3 states and 220 transitions. [2023-11-21 22:22:21,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 86 transitions, 307 flow [2023-11-21 22:22:21,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 86 transitions, 304 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-21 22:22:21,904 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 140 flow [2023-11-21 22:22:21,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2023-11-21 22:22:21,910 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -17 predicate places. [2023-11-21 22:22:21,911 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 140 flow [2023-11-21 22:22:21,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:21,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:21,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:22:21,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:22:21,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:21,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:21,913 INFO L85 PathProgramCache]: Analyzing trace with hash 28313, now seen corresponding path program 1 times [2023-11-21 22:22:21,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:21,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15705642] [2023-11-21 22:22:21,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:22,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:22,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15705642] [2023-11-21 22:22:22,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15705642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:22,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:22,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:22:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547890876] [2023-11-21 22:22:22,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:22,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:22:22,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:22,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:22:22,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:22:22,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 110 [2023-11-21 22:22:22,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:22,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:22,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 110 [2023-11-21 22:22:22,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:24,620 INFO L124 PetriNetUnfolderBase]: 6863/10580 cut-off events. [2023-11-21 22:22:24,620 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-21 22:22:24,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20410 conditions, 10580 events. 6863/10580 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 88043 event pairs, 5229 based on Foata normal form. 1/5462 useless extension candidates. Maximal degree in co-relation 20399. Up to 8312 conditions per place. [2023-11-21 22:22:24,718 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 60 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2023-11-21 22:22:24,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 304 flow [2023-11-21 22:22:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:22:24,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:22:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-21 22:22:24,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2023-11-21 22:22:24,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-21 22:22:24,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-21 22:22:24,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:24,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-21 22:22:24,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:24,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:24,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:24,725 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 140 flow. Second operand 3 states and 144 transitions. [2023-11-21 22:22:24,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 304 flow [2023-11-21 22:22:24,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 85 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:22:24,749 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 138 flow [2023-11-21 22:22:24,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2023-11-21 22:22:24,750 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -18 predicate places. [2023-11-21 22:22:24,750 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 138 flow [2023-11-21 22:22:24,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:24,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:24,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:22:24,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:22:24,752 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:24,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:24,753 INFO L85 PathProgramCache]: Analyzing trace with hash 844362636, now seen corresponding path program 1 times [2023-11-21 22:22:24,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:24,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151950707] [2023-11-21 22:22:24,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:24,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:24,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:24,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151950707] [2023-11-21 22:22:24,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151950707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:24,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:24,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:22:24,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153688816] [2023-11-21 22:22:24,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:24,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:22:24,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:24,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:22:24,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:22:24,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 110 [2023-11-21 22:22:24,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:24,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:24,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 110 [2023-11-21 22:22:24,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:26,995 INFO L124 PetriNetUnfolderBase]: 6864/10578 cut-off events. [2023-11-21 22:22:26,995 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-21 22:22:27,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20411 conditions, 10578 events. 6864/10578 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 87806 event pairs, 5229 based on Foata normal form. 0/5463 useless extension candidates. Maximal degree in co-relation 20400. Up to 8312 conditions per place. [2023-11-21 22:22:27,079 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 61 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-11-21 22:22:27,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 304 flow [2023-11-21 22:22:27,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:22:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:22:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2023-11-21 22:22:27,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4303030303030303 [2023-11-21 22:22:27,084 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 142 transitions. [2023-11-21 22:22:27,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 142 transitions. [2023-11-21 22:22:27,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:27,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 142 transitions. [2023-11-21 22:22:27,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:27,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:27,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:27,090 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 138 flow. Second operand 3 states and 142 transitions. [2023-11-21 22:22:27,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 304 flow [2023-11-21 22:22:27,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 84 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:22:27,104 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 136 flow [2023-11-21 22:22:27,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2023-11-21 22:22:27,106 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -19 predicate places. [2023-11-21 22:22:27,107 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 136 flow [2023-11-21 22:22:27,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:27,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:27,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:22:27,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:22:27,108 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:27,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:27,109 INFO L85 PathProgramCache]: Analyzing trace with hash 844362637, now seen corresponding path program 1 times [2023-11-21 22:22:27,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:27,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782043034] [2023-11-21 22:22:27,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:27,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:27,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:27,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782043034] [2023-11-21 22:22:27,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782043034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:27,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:27,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:22:27,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043076625] [2023-11-21 22:22:27,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:27,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:22:27,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:27,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:22:27,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:22:27,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 110 [2023-11-21 22:22:27,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:27,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:27,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 110 [2023-11-21 22:22:27,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:29,368 INFO L124 PetriNetUnfolderBase]: 6863/10576 cut-off events. [2023-11-21 22:22:29,368 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2023-11-21 22:22:29,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20407 conditions, 10576 events. 6863/10576 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 87271 event pairs, 4220 based on Foata normal form. 2/5464 useless extension candidates. Maximal degree in co-relation 20397. Up to 8309 conditions per place. [2023-11-21 22:22:29,475 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 60 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-11-21 22:22:29,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 83 transitions, 300 flow [2023-11-21 22:22:29,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:22:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:22:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-21 22:22:29,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2023-11-21 22:22:29,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-21 22:22:29,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-21 22:22:29,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:29,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-21 22:22:29,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:29,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:29,483 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:29,484 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 136 flow. Second operand 3 states and 144 transitions. [2023-11-21 22:22:29,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 83 transitions, 300 flow [2023-11-21 22:22:29,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 83 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:22:29,493 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 134 flow [2023-11-21 22:22:29,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2023-11-21 22:22:29,495 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -20 predicate places. [2023-11-21 22:22:29,496 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 134 flow [2023-11-21 22:22:29,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:29,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:29,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:29,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:22:29,497 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:29,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:29,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1215242569, now seen corresponding path program 1 times [2023-11-21 22:22:29,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:29,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387804395] [2023-11-21 22:22:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:29,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:29,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:29,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387804395] [2023-11-21 22:22:29,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387804395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:29,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:29,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:22:29,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520918497] [2023-11-21 22:22:29,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:29,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:22:29,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:29,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:22:29,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:22:29,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 110 [2023-11-21 22:22:29,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:29,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:29,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 110 [2023-11-21 22:22:29,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:31,193 INFO L124 PetriNetUnfolderBase]: 6888/10418 cut-off events. [2023-11-21 22:22:31,193 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2023-11-21 22:22:31,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20292 conditions, 10418 events. 6888/10418 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 81275 event pairs, 5357 based on Foata normal form. 0/5253 useless extension candidates. Maximal degree in co-relation 20282. Up to 8322 conditions per place. [2023-11-21 22:22:31,288 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 61 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2023-11-21 22:22:31,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 82 transitions, 300 flow [2023-11-21 22:22:31,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:22:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:22:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2023-11-21 22:22:31,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4303030303030303 [2023-11-21 22:22:31,297 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 142 transitions. [2023-11-21 22:22:31,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 142 transitions. [2023-11-21 22:22:31,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:31,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 142 transitions. [2023-11-21 22:22:31,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:31,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:31,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:31,300 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 134 flow. Second operand 3 states and 142 transitions. [2023-11-21 22:22:31,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 82 transitions, 300 flow [2023-11-21 22:22:31,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 82 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:22:31,314 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 132 flow [2023-11-21 22:22:31,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2023-11-21 22:22:31,317 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -21 predicate places. [2023-11-21 22:22:31,318 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 132 flow [2023-11-21 22:22:31,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:31,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:31,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:31,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:22:31,319 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:31,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1215242568, now seen corresponding path program 1 times [2023-11-21 22:22:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:31,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434244278] [2023-11-21 22:22:31,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:31,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:31,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:31,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434244278] [2023-11-21 22:22:31,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434244278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:31,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:31,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:22:31,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508106109] [2023-11-21 22:22:31,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:31,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:22:31,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:31,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:22:31,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:22:31,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 110 [2023-11-21 22:22:31,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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) [2023-11-21 22:22:31,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:31,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 110 [2023-11-21 22:22:31,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:33,135 INFO L124 PetriNetUnfolderBase]: 6863/10370 cut-off events. [2023-11-21 22:22:33,135 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2023-11-21 22:22:33,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20217 conditions, 10370 events. 6863/10370 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 80370 event pairs, 5332 based on Foata normal form. 18/5237 useless extension candidates. Maximal degree in co-relation 20207. Up to 8279 conditions per place. [2023-11-21 22:22:33,222 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 60 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2023-11-21 22:22:33,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 296 flow [2023-11-21 22:22:33,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:22:33,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:22:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-21 22:22:33,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2023-11-21 22:22:33,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-21 22:22:33,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-21 22:22:33,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:33,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-21 22:22:33,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:33,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:33,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:33,228 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 132 flow. Second operand 3 states and 144 transitions. [2023-11-21 22:22:33,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 296 flow [2023-11-21 22:22:33,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:22:33,239 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 130 flow [2023-11-21 22:22:33,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2023-11-21 22:22:33,240 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -22 predicate places. [2023-11-21 22:22:33,241 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 130 flow [2023-11-21 22:22:33,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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) [2023-11-21 22:22:33,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:33,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:33,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:22:33,243 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:33,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash 982196809, now seen corresponding path program 1 times [2023-11-21 22:22:33,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:33,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309450489] [2023-11-21 22:22:33,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:33,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:33,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:33,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309450489] [2023-11-21 22:22:33,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309450489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:33,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:33,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:22:33,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950197033] [2023-11-21 22:22:33,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:33,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:22:33,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:33,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:22:33,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:22:33,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 110 [2023-11-21 22:22:33,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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) [2023-11-21 22:22:33,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:33,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 110 [2023-11-21 22:22:33,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:35,138 INFO L124 PetriNetUnfolderBase]: 9134/13983 cut-off events. [2023-11-21 22:22:35,138 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2023-11-21 22:22:35,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27339 conditions, 13983 events. 9134/13983 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 1615. Compared 123259 event pairs, 2512 based on Foata normal form. 0/7430 useless extension candidates. Maximal degree in co-relation 27329. Up to 7491 conditions per place. [2023-11-21 22:22:35,236 INFO L140 encePairwiseOnDemand]: 103/110 looper letters, 69 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2023-11-21 22:22:35,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 342 flow [2023-11-21 22:22:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:22:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:22:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2023-11-21 22:22:35,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2023-11-21 22:22:35,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 160 transitions. [2023-11-21 22:22:35,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 160 transitions. [2023-11-21 22:22:35,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:35,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 160 transitions. [2023-11-21 22:22:35,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:35,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:35,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:35,248 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 130 flow. Second operand 3 states and 160 transitions. [2023-11-21 22:22:35,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 342 flow [2023-11-21 22:22:35,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:22:35,263 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 146 flow [2023-11-21 22:22:35,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2023-11-21 22:22:35,264 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -21 predicate places. [2023-11-21 22:22:35,265 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 146 flow [2023-11-21 22:22:35,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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) [2023-11-21 22:22:35,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:35,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:35,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:22:35,266 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:35,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:35,268 INFO L85 PathProgramCache]: Analyzing trace with hash 383330935, now seen corresponding path program 1 times [2023-11-21 22:22:35,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:35,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27523452] [2023-11-21 22:22:35,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:35,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:35,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:35,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27523452] [2023-11-21 22:22:35,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27523452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:35,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:35,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:22:35,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218991119] [2023-11-21 22:22:35,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:35,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:22:35,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:35,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:22:35,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:22:35,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 110 [2023-11-21 22:22:35,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:35,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:35,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 110 [2023-11-21 22:22:35,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:37,849 INFO L124 PetriNetUnfolderBase]: 9512/14885 cut-off events. [2023-11-21 22:22:37,849 INFO L125 PetriNetUnfolderBase]: For 1738/1738 co-relation queries the response was YES. [2023-11-21 22:22:37,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30140 conditions, 14885 events. 9512/14885 cut-off events. For 1738/1738 co-relation queries the response was YES. Maximal size of possible extension queue 1772. Compared 132092 event pairs, 5664 based on Foata normal form. 90/8718 useless extension candidates. Maximal degree in co-relation 30127. Up to 10822 conditions per place. [2023-11-21 22:22:37,969 INFO L140 encePairwiseOnDemand]: 100/110 looper letters, 65 selfloop transitions, 7 changer transitions 0/91 dead transitions. [2023-11-21 22:22:37,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 360 flow [2023-11-21 22:22:37,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:22:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:22:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2023-11-21 22:22:37,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2023-11-21 22:22:37,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 158 transitions. [2023-11-21 22:22:37,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 158 transitions. [2023-11-21 22:22:37,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:37,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 158 transitions. [2023-11-21 22:22:37,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:37,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:37,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:37,980 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 146 flow. Second operand 3 states and 158 transitions. [2023-11-21 22:22:37,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 360 flow [2023-11-21 22:22:37,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 91 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:22:37,987 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 197 flow [2023-11-21 22:22:37,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2023-11-21 22:22:37,990 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -20 predicate places. [2023-11-21 22:22:37,990 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 197 flow [2023-11-21 22:22:37,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:37,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:37,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:37,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:22:37,991 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:37,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:37,992 INFO L85 PathProgramCache]: Analyzing trace with hash 383330937, now seen corresponding path program 1 times [2023-11-21 22:22:37,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:37,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442137642] [2023-11-21 22:22:37,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:37,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:38,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:38,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442137642] [2023-11-21 22:22:38,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442137642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:38,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:38,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:22:38,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164609975] [2023-11-21 22:22:38,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:38,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:22:38,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:38,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:22:38,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:22:38,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 110 [2023-11-21 22:22:38,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:38,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:38,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 110 [2023-11-21 22:22:38,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:39,797 INFO L124 PetriNetUnfolderBase]: 5568/9187 cut-off events. [2023-11-21 22:22:39,797 INFO L125 PetriNetUnfolderBase]: For 2506/2514 co-relation queries the response was YES. [2023-11-21 22:22:39,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21028 conditions, 9187 events. 5568/9187 cut-off events. For 2506/2514 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 79844 event pairs, 3212 based on Foata normal form. 0/7145 useless extension candidates. Maximal degree in co-relation 21015. Up to 5205 conditions per place. [2023-11-21 22:22:39,854 INFO L140 encePairwiseOnDemand]: 95/110 looper letters, 71 selfloop transitions, 14 changer transitions 0/103 dead transitions. [2023-11-21 22:22:39,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 103 transitions, 524 flow [2023-11-21 22:22:39,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:22:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:22:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2023-11-21 22:22:39,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42272727272727273 [2023-11-21 22:22:39,857 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 186 transitions. [2023-11-21 22:22:39,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 186 transitions. [2023-11-21 22:22:39,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:39,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 186 transitions. [2023-11-21 22:22:39,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:39,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:39,860 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:39,861 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 197 flow. Second operand 4 states and 186 transitions. [2023-11-21 22:22:39,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 103 transitions, 524 flow [2023-11-21 22:22:39,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 103 transitions, 496 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-21 22:22:39,869 INFO L231 Difference]: Finished difference. Result has 71 places, 76 transitions, 336 flow [2023-11-21 22:22:39,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=71, PETRI_TRANSITIONS=76} [2023-11-21 22:22:39,870 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -17 predicate places. [2023-11-21 22:22:39,870 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 76 transitions, 336 flow [2023-11-21 22:22:39,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:39,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:39,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:39,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:22:39,871 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:39,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:39,872 INFO L85 PathProgramCache]: Analyzing trace with hash 383330938, now seen corresponding path program 1 times [2023-11-21 22:22:39,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:39,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595937832] [2023-11-21 22:22:39,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:39,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:40,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:40,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595937832] [2023-11-21 22:22:40,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595937832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:40,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:40,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:22:40,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982186909] [2023-11-21 22:22:40,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:40,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:22:40,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:40,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:22:40,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:22:40,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 110 [2023-11-21 22:22:40,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 76 transitions, 336 flow. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:40,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:40,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 110 [2023-11-21 22:22:40,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:40,741 INFO L124 PetriNetUnfolderBase]: 2032/3525 cut-off events. [2023-11-21 22:22:40,741 INFO L125 PetriNetUnfolderBase]: For 3018/3034 co-relation queries the response was YES. [2023-11-21 22:22:40,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9994 conditions, 3525 events. 2032/3525 cut-off events. For 3018/3034 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 27815 event pairs, 1064 based on Foata normal form. 866/3900 useless extension candidates. Maximal degree in co-relation 9977. Up to 1645 conditions per place. [2023-11-21 22:22:40,769 INFO L140 encePairwiseOnDemand]: 101/110 looper letters, 60 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2023-11-21 22:22:40,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 81 transitions, 512 flow [2023-11-21 22:22:40,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:22:40,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:22:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2023-11-21 22:22:40,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2023-11-21 22:22:40,771 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 165 transitions. [2023-11-21 22:22:40,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 165 transitions. [2023-11-21 22:22:40,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:40,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 165 transitions. [2023-11-21 22:22:40,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:40,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:40,774 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:40,774 INFO L175 Difference]: Start difference. First operand has 71 places, 76 transitions, 336 flow. Second operand 4 states and 165 transitions. [2023-11-21 22:22:40,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 81 transitions, 512 flow [2023-11-21 22:22:40,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 510 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-21 22:22:40,781 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 322 flow [2023-11-21 22:22:40,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2023-11-21 22:22:40,783 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -22 predicate places. [2023-11-21 22:22:40,783 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 322 flow [2023-11-21 22:22:40,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:40,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:40,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:40,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:22:40,784 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:40,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1580534122, now seen corresponding path program 1 times [2023-11-21 22:22:40,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:40,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856227804] [2023-11-21 22:22:40,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:40,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:40,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:40,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856227804] [2023-11-21 22:22:40,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856227804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:40,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:40,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:22:40,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895577210] [2023-11-21 22:22:40,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:40,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:22:40,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:40,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:22:40,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:22:40,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 110 [2023-11-21 22:22:40,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:40,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:40,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 110 [2023-11-21 22:22:40,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:41,485 INFO L124 PetriNetUnfolderBase]: 1942/3375 cut-off events. [2023-11-21 22:22:41,485 INFO L125 PetriNetUnfolderBase]: For 2604/2620 co-relation queries the response was YES. [2023-11-21 22:22:41,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9593 conditions, 3375 events. 1942/3375 cut-off events. For 2604/2620 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 26343 event pairs, 497 based on Foata normal form. 0/2980 useless extension candidates. Maximal degree in co-relation 9575. Up to 2592 conditions per place. [2023-11-21 22:22:41,504 INFO L140 encePairwiseOnDemand]: 103/110 looper letters, 51 selfloop transitions, 17 changer transitions 0/87 dead transitions. [2023-11-21 22:22:41,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 87 transitions, 537 flow [2023-11-21 22:22:41,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:22:41,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:22:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2023-11-21 22:22:41,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396969696969697 [2023-11-21 22:22:41,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 131 transitions. [2023-11-21 22:22:41,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 131 transitions. [2023-11-21 22:22:41,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:41,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 131 transitions. [2023-11-21 22:22:41,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:41,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:41,508 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:41,508 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 322 flow. Second operand 3 states and 131 transitions. [2023-11-21 22:22:41,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 87 transitions, 537 flow [2023-11-21 22:22:41,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 87 transitions, 533 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:22:41,513 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 374 flow [2023-11-21 22:22:41,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=67, PETRI_TRANSITIONS=69} [2023-11-21 22:22:41,513 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -21 predicate places. [2023-11-21 22:22:41,514 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 374 flow [2023-11-21 22:22:41,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:41,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:41,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:41,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:22:41,514 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:41,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1525272357, now seen corresponding path program 1 times [2023-11-21 22:22:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:41,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211490876] [2023-11-21 22:22:41,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:41,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:41,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:41,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211490876] [2023-11-21 22:22:41,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211490876] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:41,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:41,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:22:41,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739866359] [2023-11-21 22:22:41,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:41,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:22:41,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:41,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:22:41,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:22:41,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 110 [2023-11-21 22:22:41,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 374 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:41,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:41,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 110 [2023-11-21 22:22:41,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:42,372 INFO L124 PetriNetUnfolderBase]: 1970/3519 cut-off events. [2023-11-21 22:22:42,373 INFO L125 PetriNetUnfolderBase]: For 2760/2776 co-relation queries the response was YES. [2023-11-21 22:22:42,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10574 conditions, 3519 events. 1970/3519 cut-off events. For 2760/2776 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 28157 event pairs, 397 based on Foata normal form. 0/3220 useless extension candidates. Maximal degree in co-relation 10555. Up to 1667 conditions per place. [2023-11-21 22:22:42,399 INFO L140 encePairwiseOnDemand]: 101/110 looper letters, 47 selfloop transitions, 23 changer transitions 0/89 dead transitions. [2023-11-21 22:22:42,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 580 flow [2023-11-21 22:22:42,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:22:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:22:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2023-11-21 22:22:42,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2023-11-21 22:22:42,401 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 168 transitions. [2023-11-21 22:22:42,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 168 transitions. [2023-11-21 22:22:42,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:42,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 168 transitions. [2023-11-21 22:22:42,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:42,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:42,404 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:42,404 INFO L175 Difference]: Start difference. First operand has 67 places, 69 transitions, 374 flow. Second operand 4 states and 168 transitions. [2023-11-21 22:22:42,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 580 flow [2023-11-21 22:22:42,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 89 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:22:42,413 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 388 flow [2023-11-21 22:22:42,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=388, PETRI_PLACES=67, PETRI_TRANSITIONS=69} [2023-11-21 22:22:42,414 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -21 predicate places. [2023-11-21 22:22:42,414 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 388 flow [2023-11-21 22:22:42,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:42,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:42,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:42,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:22:42,415 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:42,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:42,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1320409682, now seen corresponding path program 1 times [2023-11-21 22:22:42,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:42,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729914768] [2023-11-21 22:22:42,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:42,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:42,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:42,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729914768] [2023-11-21 22:22:42,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729914768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:42,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:42,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:22:42,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908467920] [2023-11-21 22:22:42,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:42,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:22:42,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:42,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:22:42,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:22:42,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 110 [2023-11-21 22:22:42,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 388 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:42,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:42,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 110 [2023-11-21 22:22:42,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:43,408 INFO L124 PetriNetUnfolderBase]: 1878/3379 cut-off events. [2023-11-21 22:22:43,408 INFO L125 PetriNetUnfolderBase]: For 3094/3110 co-relation queries the response was YES. [2023-11-21 22:22:43,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10352 conditions, 3379 events. 1878/3379 cut-off events. For 3094/3110 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 26954 event pairs, 473 based on Foata normal form. 48/3128 useless extension candidates. Maximal degree in co-relation 10333. Up to 2543 conditions per place. [2023-11-21 22:22:43,431 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 49 selfloop transitions, 17 changer transitions 0/85 dead transitions. [2023-11-21 22:22:43,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 592 flow [2023-11-21 22:22:43,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:22:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:22:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2023-11-21 22:22:43,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35454545454545455 [2023-11-21 22:22:43,433 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 156 transitions. [2023-11-21 22:22:43,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 156 transitions. [2023-11-21 22:22:43,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:43,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 156 transitions. [2023-11-21 22:22:43,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:43,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:43,435 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:43,435 INFO L175 Difference]: Start difference. First operand has 67 places, 69 transitions, 388 flow. Second operand 4 states and 156 transitions. [2023-11-21 22:22:43,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 592 flow [2023-11-21 22:22:43,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 85 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:22:43,440 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 386 flow [2023-11-21 22:22:43,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=386, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2023-11-21 22:22:43,441 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -21 predicate places. [2023-11-21 22:22:43,441 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 386 flow [2023-11-21 22:22:43,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:43,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:43,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:43,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 22:22:43,442 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:43,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:43,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1095896328, now seen corresponding path program 1 times [2023-11-21 22:22:43,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:43,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038344096] [2023-11-21 22:22:43,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:43,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:43,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:43,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038344096] [2023-11-21 22:22:43,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038344096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:43,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:43,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:22:43,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379653924] [2023-11-21 22:22:43,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:43,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 22:22:43,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:43,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 22:22:43,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:22:43,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 110 [2023-11-21 22:22:43,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 386 flow. Second operand has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:43,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:43,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 110 [2023-11-21 22:22:43,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:44,788 INFO L124 PetriNetUnfolderBase]: 1879/3360 cut-off events. [2023-11-21 22:22:44,789 INFO L125 PetriNetUnfolderBase]: For 3222/3222 co-relation queries the response was YES. [2023-11-21 22:22:44,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10279 conditions, 3360 events. 1879/3360 cut-off events. For 3222/3222 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 27128 event pairs, 597 based on Foata normal form. 0/3038 useless extension candidates. Maximal degree in co-relation 10259. Up to 1654 conditions per place. [2023-11-21 22:22:44,805 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 55 selfloop transitions, 5 changer transitions 8/84 dead transitions. [2023-11-21 22:22:44,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 622 flow [2023-11-21 22:22:44,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:22:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:22:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2023-11-21 22:22:44,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2803030303030303 [2023-11-21 22:22:44,807 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 185 transitions. [2023-11-21 22:22:44,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 185 transitions. [2023-11-21 22:22:44,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:44,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 185 transitions. [2023-11-21 22:22:44,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:44,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:44,811 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:44,811 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 386 flow. Second operand 6 states and 185 transitions. [2023-11-21 22:22:44,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 622 flow [2023-11-21 22:22:44,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 84 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:22:44,816 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 366 flow [2023-11-21 22:22:44,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2023-11-21 22:22:44,818 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -19 predicate places. [2023-11-21 22:22:44,818 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 366 flow [2023-11-21 22:22:44,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:44,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:44,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:44,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 22:22:44,819 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:44,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1095897674, now seen corresponding path program 1 times [2023-11-21 22:22:44,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:44,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160867983] [2023-11-21 22:22:44,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:44,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:44,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:44,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160867983] [2023-11-21 22:22:44,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160867983] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:44,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:44,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:22:44,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191735833] [2023-11-21 22:22:44,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:44,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:22:44,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:44,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:22:44,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:22:44,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 110 [2023-11-21 22:22:44,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 366 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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) [2023-11-21 22:22:44,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:44,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 110 [2023-11-21 22:22:44,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:46,162 INFO L124 PetriNetUnfolderBase]: 4241/6814 cut-off events. [2023-11-21 22:22:46,162 INFO L125 PetriNetUnfolderBase]: For 5361/5369 co-relation queries the response was YES. [2023-11-21 22:22:46,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19861 conditions, 6814 events. 4241/6814 cut-off events. For 5361/5369 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 47051 event pairs, 757 based on Foata normal form. 123/6433 useless extension candidates. Maximal degree in co-relation 19842. Up to 5241 conditions per place. [2023-11-21 22:22:46,207 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 87 selfloop transitions, 5 changer transitions 1/107 dead transitions. [2023-11-21 22:22:46,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 107 transitions, 810 flow [2023-11-21 22:22:46,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:22:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:22:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2023-11-21 22:22:46,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2023-11-21 22:22:46,209 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 160 transitions. [2023-11-21 22:22:46,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 160 transitions. [2023-11-21 22:22:46,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:46,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 160 transitions. [2023-11-21 22:22:46,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:46,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:46,211 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:46,211 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 366 flow. Second operand 4 states and 160 transitions. [2023-11-21 22:22:46,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 107 transitions, 810 flow [2023-11-21 22:22:46,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 107 transitions, 798 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-21 22:22:46,220 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 392 flow [2023-11-21 22:22:46,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=392, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2023-11-21 22:22:46,221 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -18 predicate places. [2023-11-21 22:22:46,221 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 392 flow [2023-11-21 22:22:46,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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) [2023-11-21 22:22:46,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:46,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:46,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 22:22:46,222 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:46,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash -637045649, now seen corresponding path program 1 times [2023-11-21 22:22:46,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:46,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126904537] [2023-11-21 22:22:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:46,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:46,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:46,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126904537] [2023-11-21 22:22:46,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126904537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:46,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:46,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:22:46,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047587317] [2023-11-21 22:22:46,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:46,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:22:46,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:46,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:22:46,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:22:46,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 110 [2023-11-21 22:22:46,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 392 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:46,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:46,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 110 [2023-11-21 22:22:46,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:47,070 INFO L124 PetriNetUnfolderBase]: 2039/3352 cut-off events. [2023-11-21 22:22:47,070 INFO L125 PetriNetUnfolderBase]: For 2754/2762 co-relation queries the response was YES. [2023-11-21 22:22:47,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10052 conditions, 3352 events. 2039/3352 cut-off events. For 2754/2762 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20058 event pairs, 177 based on Foata normal form. 110/3248 useless extension candidates. Maximal degree in co-relation 10031. Up to 1997 conditions per place. [2023-11-21 22:22:47,087 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 85 selfloop transitions, 8 changer transitions 8/115 dead transitions. [2023-11-21 22:22:47,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 115 transitions, 864 flow [2023-11-21 22:22:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:22:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 22:22:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2023-11-21 22:22:47,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2023-11-21 22:22:47,089 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 200 transitions. [2023-11-21 22:22:47,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 200 transitions. [2023-11-21 22:22:47,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:47,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 200 transitions. [2023-11-21 22:22:47,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:47,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:47,091 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:47,091 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 392 flow. Second operand 5 states and 200 transitions. [2023-11-21 22:22:47,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 115 transitions, 864 flow [2023-11-21 22:22:47,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 115 transitions, 848 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-21 22:22:47,097 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 312 flow [2023-11-21 22:22:47,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2023-11-21 22:22:47,098 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -14 predicate places. [2023-11-21 22:22:47,098 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 312 flow [2023-11-21 22:22:47,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:47,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:47,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:47,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 22:22:47,099 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:47,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1051614409, now seen corresponding path program 1 times [2023-11-21 22:22:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:47,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783204442] [2023-11-21 22:22:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:47,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:47,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:47,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783204442] [2023-11-21 22:22:47,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783204442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:47,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:47,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:22:47,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746962809] [2023-11-21 22:22:47,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:47,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:22:47,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:47,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:22:47,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:22:47,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 110 [2023-11-21 22:22:47,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:47,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:47,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 110 [2023-11-21 22:22:47,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:47,768 INFO L124 PetriNetUnfolderBase]: 848/1387 cut-off events. [2023-11-21 22:22:47,768 INFO L125 PetriNetUnfolderBase]: For 1913/1921 co-relation queries the response was YES. [2023-11-21 22:22:47,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4520 conditions, 1387 events. 848/1387 cut-off events. For 1913/1921 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6596 event pairs, 42 based on Foata normal form. 64/1365 useless extension candidates. Maximal degree in co-relation 4509. Up to 468 conditions per place. [2023-11-21 22:22:47,777 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 66 selfloop transitions, 11 changer transitions 3/94 dead transitions. [2023-11-21 22:22:47,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 94 transitions, 660 flow [2023-11-21 22:22:47,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:22:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:22:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2023-11-21 22:22:47,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32272727272727275 [2023-11-21 22:22:47,779 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 213 transitions. [2023-11-21 22:22:47,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 213 transitions. [2023-11-21 22:22:47,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:47,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 213 transitions. [2023-11-21 22:22:47,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.5) internal successors, (213), 6 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:47,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:47,783 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:47,783 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 312 flow. Second operand 6 states and 213 transitions. [2023-11-21 22:22:47,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 94 transitions, 660 flow [2023-11-21 22:22:47,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 565 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-11-21 22:22:47,790 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 247 flow [2023-11-21 22:22:47,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2023-11-21 22:22:47,791 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -21 predicate places. [2023-11-21 22:22:47,791 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 247 flow [2023-11-21 22:22:47,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:47,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:47,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:47,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 22:22:47,792 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:47,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:47,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1889688900, now seen corresponding path program 1 times [2023-11-21 22:22:47,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:47,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746257711] [2023-11-21 22:22:47,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:47,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:48,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:48,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746257711] [2023-11-21 22:22:48,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746257711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:48,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:48,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:22:48,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784473156] [2023-11-21 22:22:48,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:48,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:22:48,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:48,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:22:48,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:22:48,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 110 [2023-11-21 22:22:48,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:48,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:48,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 110 [2023-11-21 22:22:48,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:48,718 INFO L124 PetriNetUnfolderBase]: 1010/1881 cut-off events. [2023-11-21 22:22:48,719 INFO L125 PetriNetUnfolderBase]: For 1584/1624 co-relation queries the response was YES. [2023-11-21 22:22:48,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5241 conditions, 1881 events. 1010/1881 cut-off events. For 1584/1624 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11015 event pairs, 230 based on Foata normal form. 16/1728 useless extension candidates. Maximal degree in co-relation 5231. Up to 761 conditions per place. [2023-11-21 22:22:48,731 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 36 selfloop transitions, 1 changer transitions 30/89 dead transitions. [2023-11-21 22:22:48,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 89 transitions, 534 flow [2023-11-21 22:22:48,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:22:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:22:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2023-11-21 22:22:48,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3212121212121212 [2023-11-21 22:22:48,734 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 212 transitions. [2023-11-21 22:22:48,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 212 transitions. [2023-11-21 22:22:48,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:48,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 212 transitions. [2023-11-21 22:22:48,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.333333333333336) internal successors, (212), 6 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:48,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:48,738 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:48,738 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 247 flow. Second operand 6 states and 212 transitions. [2023-11-21 22:22:48,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 89 transitions, 534 flow [2023-11-21 22:22:48,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 89 transitions, 448 flow, removed 25 selfloop flow, removed 8 redundant places. [2023-11-21 22:22:48,747 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 192 flow [2023-11-21 22:22:48,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-21 22:22:48,748 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -24 predicate places. [2023-11-21 22:22:48,748 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 192 flow [2023-11-21 22:22:48,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:48,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:48,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:48,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 22:22:48,749 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:48,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:48,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1404600254, now seen corresponding path program 2 times [2023-11-21 22:22:48,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:48,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203584000] [2023-11-21 22:22:48,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:48,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:49,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:22:49,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203584000] [2023-11-21 22:22:49,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203584000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:49,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:49,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:22:49,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019275892] [2023-11-21 22:22:49,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:49,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:22:49,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:22:49,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:22:49,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:22:49,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 110 [2023-11-21 22:22:49,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:49,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:49,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 110 [2023-11-21 22:22:49,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:49,588 INFO L124 PetriNetUnfolderBase]: 910/1688 cut-off events. [2023-11-21 22:22:49,588 INFO L125 PetriNetUnfolderBase]: For 538/550 co-relation queries the response was YES. [2023-11-21 22:22:49,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4154 conditions, 1688 events. 910/1688 cut-off events. For 538/550 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9783 event pairs, 266 based on Foata normal form. 16/1562 useless extension candidates. Maximal degree in co-relation 4144. Up to 570 conditions per place. [2023-11-21 22:22:49,597 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 24 selfloop transitions, 3 changer transitions 29/78 dead transitions. [2023-11-21 22:22:49,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 386 flow [2023-11-21 22:22:49,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:22:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:22:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2023-11-21 22:22:49,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3090909090909091 [2023-11-21 22:22:49,599 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 204 transitions. [2023-11-21 22:22:49,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 204 transitions. [2023-11-21 22:22:49,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:49,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 204 transitions. [2023-11-21 22:22:49,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:49,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:49,602 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:49,602 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 192 flow. Second operand 6 states and 204 transitions. [2023-11-21 22:22:49,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 386 flow [2023-11-21 22:22:49,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 375 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-21 22:22:49,607 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 156 flow [2023-11-21 22:22:49,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2023-11-21 22:22:49,607 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -23 predicate places. [2023-11-21 22:22:49,608 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 156 flow [2023-11-21 22:22:49,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:49,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:49,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:49,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-21 22:22:49,609 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:22:49,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:49,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1784282234, now seen corresponding path program 3 times [2023-11-21 22:22:49,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:22:49,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718840885] [2023-11-21 22:22:49,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:49,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:22:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:22:49,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:22:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:22:49,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:22:49,858 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:22:49,859 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (66 of 67 remaining) [2023-11-21 22:22:49,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (65 of 67 remaining) [2023-11-21 22:22:49,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 67 remaining) [2023-11-21 22:22:49,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 67 remaining) [2023-11-21 22:22:49,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 67 remaining) [2023-11-21 22:22:49,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 67 remaining) [2023-11-21 22:22:49,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 67 remaining) [2023-11-21 22:22:49,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 67 remaining) [2023-11-21 22:22:49,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 67 remaining) [2023-11-21 22:22:49,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 67 remaining) [2023-11-21 22:22:49,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 67 remaining) [2023-11-21 22:22:49,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 67 remaining) [2023-11-21 22:22:49,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 67 remaining) [2023-11-21 22:22:49,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 67 remaining) [2023-11-21 22:22:49,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 67 remaining) [2023-11-21 22:22:49,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 67 remaining) [2023-11-21 22:22:49,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 67 remaining) [2023-11-21 22:22:49,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 67 remaining) [2023-11-21 22:22:49,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 67 remaining) [2023-11-21 22:22:49,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 67 remaining) [2023-11-21 22:22:49,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 67 remaining) [2023-11-21 22:22:49,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 67 remaining) [2023-11-21 22:22:49,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 67 remaining) [2023-11-21 22:22:49,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 67 remaining) [2023-11-21 22:22:49,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 67 remaining) [2023-11-21 22:22:49,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 67 remaining) [2023-11-21 22:22:49,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 67 remaining) [2023-11-21 22:22:49,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 67 remaining) [2023-11-21 22:22:49,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 67 remaining) [2023-11-21 22:22:49,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 67 remaining) [2023-11-21 22:22:49,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 67 remaining) [2023-11-21 22:22:49,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 67 remaining) [2023-11-21 22:22:49,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 67 remaining) [2023-11-21 22:22:49,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 67 remaining) [2023-11-21 22:22:49,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 67 remaining) [2023-11-21 22:22:49,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 67 remaining) [2023-11-21 22:22:49,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 67 remaining) [2023-11-21 22:22:49,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 67 remaining) [2023-11-21 22:22:49,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (28 of 67 remaining) [2023-11-21 22:22:49,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 67 remaining) [2023-11-21 22:22:49,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 67 remaining) [2023-11-21 22:22:49,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 67 remaining) [2023-11-21 22:22:49,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 67 remaining) [2023-11-21 22:22:49,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 67 remaining) [2023-11-21 22:22:49,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 67 remaining) [2023-11-21 22:22:49,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 67 remaining) [2023-11-21 22:22:49,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 67 remaining) [2023-11-21 22:22:49,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 67 remaining) [2023-11-21 22:22:49,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 67 remaining) [2023-11-21 22:22:49,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 67 remaining) [2023-11-21 22:22:49,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 67 remaining) [2023-11-21 22:22:49,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 67 remaining) [2023-11-21 22:22:49,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 67 remaining) [2023-11-21 22:22:49,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 67 remaining) [2023-11-21 22:22:49,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 67 remaining) [2023-11-21 22:22:49,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 67 remaining) [2023-11-21 22:22:49,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 67 remaining) [2023-11-21 22:22:49,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 67 remaining) [2023-11-21 22:22:49,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 67 remaining) [2023-11-21 22:22:49,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 67 remaining) [2023-11-21 22:22:49,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 67 remaining) [2023-11-21 22:22:49,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 67 remaining) [2023-11-21 22:22:49,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 67 remaining) [2023-11-21 22:22:49,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 67 remaining) [2023-11-21 22:22:49,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 67 remaining) [2023-11-21 22:22:49,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 67 remaining) [2023-11-21 22:22:49,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 67 remaining) [2023-11-21 22:22:49,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-21 22:22:49,876 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:22:49,883 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 22:22:49,883 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:22:49,997 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-21 22:22:49,999 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-21 22:22:50,001 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated [2023-11-21 22:22:50,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 22:22:50,034 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 22:22:50,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:22:50 BasicIcfg [2023-11-21 22:22:50,058 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:22:50,058 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:22:50,058 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:22:50,059 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:22:50,059 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:22:17" (3/4) ... [2023-11-21 22:22:50,061 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-21 22:22:50,062 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:22:50,063 INFO L158 Benchmark]: Toolchain (without parser) took 34747.40ms. Allocated memory was 130.0MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 92.7MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 139.8MB. Max. memory is 16.1GB. [2023-11-21 22:22:50,063 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 104.9MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:22:50,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 667.94ms. Allocated memory is still 130.0MB. Free memory was 92.7MB in the beginning and 68.1MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-21 22:22:50,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.72ms. Allocated memory is still 130.0MB. Free memory was 68.1MB in the beginning and 65.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 22:22:50,064 INFO L158 Benchmark]: Boogie Preprocessor took 84.95ms. Allocated memory is still 130.0MB. Free memory was 65.5MB in the beginning and 62.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:22:50,065 INFO L158 Benchmark]: RCFGBuilder took 1729.02ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 62.8MB in the beginning and 101.9MB in the end (delta: -39.1MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2023-11-21 22:22:50,066 INFO L158 Benchmark]: TraceAbstraction took 32194.97ms. Allocated memory was 157.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 101.9MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2023-11-21 22:22:50,066 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 3.2GB. Free memory is still 3.0GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:22:50,068 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.27ms. Allocated memory is still 104.9MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 667.94ms. Allocated memory is still 130.0MB. Free memory was 92.7MB in the beginning and 68.1MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.72ms. Allocated memory is still 130.0MB. Free memory was 68.1MB in the beginning and 65.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.95ms. Allocated memory is still 130.0MB. Free memory was 65.5MB in the beginning and 62.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1729.02ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 62.8MB in the beginning and 101.9MB in the end (delta: -39.1MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * TraceAbstraction took 32194.97ms. Allocated memory was 157.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 101.9MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 3.2GB. Free memory is still 3.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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_p0_EBX = 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; [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 t2052; [L851] FCALL, FORK 0 pthread_create(&t2052, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L852] 0 pthread_t t2053; [L853] FCALL, FORK 0 pthread_create(&t2053, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={5:0}, t2053={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L854] 0 pthread_t t2054; [L855] FCALL, FORK 0 pthread_create(&t2054, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={5:0}, t2053={7:0}, t2054={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, 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] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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] [L777] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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 [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={5:0}, t2053={7:0}, t2054={8:0}, weak$$choice0=0, 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] [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 [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={5:0}, t2053={7:0}, t2054={8:0}, weak$$choice0=0, 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] [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_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={5:0}, t2053={7:0}, t2054={8:0}, weak$$choice0=0, 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 [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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", "safe012_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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: -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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 67 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: 31.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 27.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1111 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 964 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2186 IncrementalHoareTripleChecker+Invalid, 2314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 25 mSDtfsCounter, 2186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=15, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 1109 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-21 22:22:50,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx --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 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:22:52,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:22:53,006 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-21 22:22:53,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:22:53,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:22:53,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:22:53,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:22:53,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:22:53,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:22:53,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:22:53,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:22:53,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:22:53,077 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:22:53,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:22:53,079 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:22:53,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:22:53,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:22:53,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:22:53,081 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 22:22:53,082 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 22:22:53,082 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 22:22:53,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:22:53,084 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 22:22:53,084 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-21 22:22:53,084 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-21 22:22:53,085 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:22:53,085 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:22:53,086 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:22:53,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:22:53,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:22:53,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:22:53,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:22:53,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:22:53,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:22:53,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:22:53,090 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-21 22:22:53,091 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-21 22:22:53,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:22:53,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:22:53,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:22:53,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:22:53,093 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-21 22:22:53,093 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx 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 -> 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da [2023-11-21 22:22:53,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:22:53,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:22:53,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:22:53,526 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:22:53,527 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:22:53,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2023-11-21 22:22:56,975 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:22:57,333 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:22:57,333 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2023-11-21 22:22:57,351 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/data/ce17f6c9d/1f84c5f895dd45469824cff45945bf9d/FLAGf39dcc859 [2023-11-21 22:22:57,367 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/data/ce17f6c9d/1f84c5f895dd45469824cff45945bf9d [2023-11-21 22:22:57,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:22:57,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:22:57,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:22:57,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:22:57,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:22:57,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:22:57" (1/1) ... [2023-11-21 22:22:57,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55cadb54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:57, skipping insertion in model container [2023-11-21 22:22:57,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:22:57" (1/1) ... [2023-11-21 22:22:57,437 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:22:57,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:22:58,014 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:22:58,086 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:22:58,135 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:22:58,136 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:22:58,144 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:22:58,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:58 WrapperNode [2023-11-21 22:22:58,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:22:58,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:22:58,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:22:58,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:22:58,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:58" (1/1) ... [2023-11-21 22:22:58,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:58" (1/1) ... [2023-11-21 22:22:58,218 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 188 [2023-11-21 22:22:58,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:22:58,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:22:58,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:22:58,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:22:58,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:58" (1/1) ... [2023-11-21 22:22:58,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:58" (1/1) ... [2023-11-21 22:22:58,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:58" (1/1) ... [2023-11-21 22:22:58,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:58" (1/1) ... [2023-11-21 22:22:58,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:58" (1/1) ... [2023-11-21 22:22:58,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:58" (1/1) ... [2023-11-21 22:22:58,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:58" (1/1) ... [2023-11-21 22:22:58,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:58" (1/1) ... [2023-11-21 22:22:58,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:22:58,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:22:58,308 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:22:58,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:22:58,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:58" (1/1) ... [2023-11-21 22:22:58,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:22:58,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:22:58,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:22:58,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:22:58,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-21 22:22:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 22:22:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:22:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:22:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:22:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-21 22:22:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-21 22:22:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-21 22:22:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 22:22:58,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 22:22:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 22:22:58,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 22:22:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 22:22:58,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 22:22:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 22:22:58,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:22:58,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:22:58,408 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:22:58,580 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:22:58,583 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:22:59,247 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:22:59,922 WARN L1820 r$LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2023-11-21 22:23:00,115 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:23:00,116 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:23:00,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:23:00 BoogieIcfgContainer [2023-11-21 22:23:00,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:23:00,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:23:00,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:23:00,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:23:00,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:22:57" (1/3) ... [2023-11-21 22:23:00,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69418e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:23:00, skipping insertion in model container [2023-11-21 22:23:00,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:58" (2/3) ... [2023-11-21 22:23:00,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69418e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:23:00, skipping insertion in model container [2023-11-21 22:23:00,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:23:00" (3/3) ... [2023-11-21 22:23:00,130 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2023-11-21 22:23:00,152 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:23:00,152 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2023-11-21 22:23:00,152 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:23:00,393 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 22:23:00,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 110 transitions, 232 flow [2023-11-21 22:23:00,521 INFO L124 PetriNetUnfolderBase]: 29/107 cut-off events. [2023-11-21 22:23:00,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:23:00,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 29/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 330 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 106. Up to 4 conditions per place. [2023-11-21 22:23:00,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 110 transitions, 232 flow [2023-11-21 22:23:00,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 107 transitions, 223 flow [2023-11-21 22:23:00,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:23:00,562 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@73e14af7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:23:00,563 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2023-11-21 22:23:00,568 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:23:00,568 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-21 22:23:00,568 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:23:00,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:00,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:23:00,570 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-21 22:23:00,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:00,577 INFO L85 PathProgramCache]: Analyzing trace with hash 28376, now seen corresponding path program 1 times [2023-11-21 22:23:00,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:23:00,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109017598] [2023-11-21 22:23:00,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:00,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:23:00,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:23:00,594 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f27838-d35c-4385-9f22-6ac88b8f89a0/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)