./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8bcba962b15df67a0e136eef2e702f216cc120b7626a7b8dc8877f6ecaf3765 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 11:57:45,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:57:45,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:57:46,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:57:46,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:57:46,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:57:46,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:57:46,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:57:46,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:57:46,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:57:46,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:57:46,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:57:46,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:57:46,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:57:46,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:57:46,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:57:46,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:57:46,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:57:46,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:57:46,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:57:46,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:57:46,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:57:46,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:57:46,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:57:46,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:57:46,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:57:46,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:57:46,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:57:46,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:57:46,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:57:46,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:57:46,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:57:46,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:57:46,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:57:46,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:57:46,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:57:46,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:57:46,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:57:46,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:57:46,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:57:46,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:57:46,045 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 11:57:46,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:57:46,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:57:46,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:57:46,066 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:57:46,066 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:57:46,067 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:57:46,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:57:46,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:57:46,067 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:57:46,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:57:46,068 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:57:46,068 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 11:57:46,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:57:46,068 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:57:46,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:57:46,069 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 11:57:46,069 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 11:57:46,069 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 11:57:46,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:57:46,069 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 11:57:46,069 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:57:46,069 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:57:46,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:57:46,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:57:46,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:57:46,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:57:46,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:57:46,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:57:46,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:57:46,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:57:46,071 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:57:46,071 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:57:46,071 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:57:46,071 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:57:46,071 INFO L138 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_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/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_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8bcba962b15df67a0e136eef2e702f216cc120b7626a7b8dc8877f6ecaf3765 [2022-12-13 11:57:46,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:57:46,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:57:46,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:57:46,282 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:57:46,282 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:57:46,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i [2022-12-13 11:57:48,943 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:57:49,109 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:57:49,110 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i [2022-12-13 11:57:49,119 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/data/93bdd9a1c/70f71fe80f9f46efb0144424eed6f963/FLAGe500d9640 [2022-12-13 11:57:49,130 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/data/93bdd9a1c/70f71fe80f9f46efb0144424eed6f963 [2022-12-13 11:57:49,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:57:49,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:57:49,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:57:49,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:57:49,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:57:49,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:57:49" (1/1) ... [2022-12-13 11:57:49,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74aaffd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:49, skipping insertion in model container [2022-12-13 11:57:49,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:57:49" (1/1) ... [2022-12-13 11:57:49,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:57:49,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:57:49,388 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i[30726,30739] [2022-12-13 11:57:49,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:57:49,403 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:57:49,435 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i[30726,30739] [2022-12-13 11:57:49,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:57:49,459 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:57:49,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:49 WrapperNode [2022-12-13 11:57:49,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:57:49,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:57:49,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:57:49,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:57:49,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:49" (1/1) ... [2022-12-13 11:57:49,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:49" (1/1) ... [2022-12-13 11:57:49,494 INFO L138 Inliner]: procedures = 171, calls = 26, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 85 [2022-12-13 11:57:49,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:57:49,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:57:49,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:57:49,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:57:49,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:49" (1/1) ... [2022-12-13 11:57:49,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:49" (1/1) ... [2022-12-13 11:57:49,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:49" (1/1) ... [2022-12-13 11:57:49,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:49" (1/1) ... [2022-12-13 11:57:49,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:49" (1/1) ... [2022-12-13 11:57:49,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:49" (1/1) ... [2022-12-13 11:57:49,512 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:49" (1/1) ... [2022-12-13 11:57:49,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:49" (1/1) ... [2022-12-13 11:57:49,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:57:49,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:57:49,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:57:49,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:57:49,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:49" (1/1) ... [2022-12-13 11:57:49,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:57:49,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:57:49,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:57:49,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:57:49,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:57:49,579 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-12-13 11:57:49,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-12-13 11:57:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:57:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:57:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:57:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:57:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:57:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:57:49,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:57:49,582 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 11:57:49,689 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:57:49,691 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:57:49,876 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:57:49,928 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:57:49,928 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 11:57:49,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:57:49 BoogieIcfgContainer [2022-12-13 11:57:49,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:57:49,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:57:49,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:57:49,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:57:49,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:57:49" (1/3) ... [2022-12-13 11:57:49,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f051f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:57:49, skipping insertion in model container [2022-12-13 11:57:49,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:49" (2/3) ... [2022-12-13 11:57:49,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f051f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:57:49, skipping insertion in model container [2022-12-13 11:57:49,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:57:49" (3/3) ... [2022-12-13 11:57:49,937 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2022-12-13 11:57:49,951 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:57:49,952 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-12-13 11:57:49,952 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:57:50,021 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:57:50,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 101 transitions, 207 flow [2022-12-13 11:57:50,084 INFO L130 PetriNetUnfolder]: 7/117 cut-off events. [2022-12-13 11:57:50,084 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:50,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 117 events. 7/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 214 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. [2022-12-13 11:57:50,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 101 transitions, 207 flow [2022-12-13 11:57:50,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 101 transitions, 207 flow [2022-12-13 11:57:50,095 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 11:57:50,104 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 101 transitions, 207 flow [2022-12-13 11:57:50,106 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 101 transitions, 207 flow [2022-12-13 11:57:50,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 101 transitions, 207 flow [2022-12-13 11:57:50,131 INFO L130 PetriNetUnfolder]: 7/117 cut-off events. [2022-12-13 11:57:50,131 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:50,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 117 events. 7/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 214 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. [2022-12-13 11:57:50,134 INFO L119 LiptonReduction]: Number of co-enabled transitions 2394 [2022-12-13 11:57:51,819 INFO L134 LiptonReduction]: Checked pairs total: 6520 [2022-12-13 11:57:51,819 INFO L136 LiptonReduction]: Total number of compositions: 102 [2022-12-13 11:57:51,832 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:57:51,836 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;@6f1f034a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:57:51,836 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-12-13 11:57:51,838 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-13 11:57:51,838 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:51,838 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:51,839 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 11:57:51,839 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-12-13 11:57:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash 16157, now seen corresponding path program 1 times [2022-12-13 11:57:51,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:51,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059907668] [2022-12-13 11:57:51,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:51,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:52,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:52,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:52,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059907668] [2022-12-13 11:57:52,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059907668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:52,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:52,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:57:52,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280539367] [2022-12-13 11:57:52,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:52,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:57:52,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:52,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:57:52,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:57:52,093 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 203 [2022-12-13 11:57:52,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:52,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:52,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 203 [2022-12-13 11:57:52,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:52,160 INFO L130 PetriNetUnfolder]: 64/154 cut-off events. [2022-12-13 11:57:52,160 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:52,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 154 events. 64/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 607 event pairs, 56 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 283. Up to 142 conditions per place. [2022-12-13 11:57:52,162 INFO L137 encePairwiseOnDemand]: 195/203 looper letters, 23 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2022-12-13 11:57:52,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 111 flow [2022-12-13 11:57:52,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:57:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:57:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2022-12-13 11:57:52,173 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4548440065681445 [2022-12-13 11:57:52,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2022-12-13 11:57:52,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2022-12-13 11:57:52,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:57:52,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2022-12-13 11:57:52,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:52,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:52,183 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:52,190 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 83 flow. Second operand 3 states and 277 transitions. [2022-12-13 11:57:52,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 111 flow [2022-12-13 11:57:52,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 111 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:57:52,195 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 65 flow [2022-12-13 11:57:52,196 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2022-12-13 11:57:52,200 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2022-12-13 11:57:52,200 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 65 flow [2022-12-13 11:57:52,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:52,200 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:52,200 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 11:57:52,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:57:52,201 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-12-13 11:57:52,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:52,201 INFO L85 PathProgramCache]: Analyzing trace with hash 16155, now seen corresponding path program 1 times [2022-12-13 11:57:52,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:52,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515132346] [2022-12-13 11:57:52,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:52,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:52,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:52,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515132346] [2022-12-13 11:57:52,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515132346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:52,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:52,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:57:52,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895898361] [2022-12-13 11:57:52,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:52,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:57:52,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:52,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:57:52,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:57:52,284 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 203 [2022-12-13 11:57:52,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:52,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:52,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 203 [2022-12-13 11:57:52,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:52,362 INFO L130 PetriNetUnfolder]: 99/250 cut-off events. [2022-12-13 11:57:52,362 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:52,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 250 events. 99/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 999 event pairs, 50 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 489. Up to 125 conditions per place. [2022-12-13 11:57:52,364 INFO L137 encePairwiseOnDemand]: 198/203 looper letters, 43 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2022-12-13 11:57:52,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 51 transitions, 203 flow [2022-12-13 11:57:52,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:57:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:57:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2022-12-13 11:57:52,366 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46798029556650245 [2022-12-13 11:57:52,366 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 285 transitions. [2022-12-13 11:57:52,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 285 transitions. [2022-12-13 11:57:52,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:57:52,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 285 transitions. [2022-12-13 11:57:52,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:52,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:52,368 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:52,368 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 65 flow. Second operand 3 states and 285 transitions. [2022-12-13 11:57:52,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 51 transitions, 203 flow [2022-12-13 11:57:52,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 51 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:57:52,369 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 94 flow [2022-12-13 11:57:52,370 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2022-12-13 11:57:52,370 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2022-12-13 11:57:52,370 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 94 flow [2022-12-13 11:57:52,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:52,370 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:52,370 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2022-12-13 11:57:52,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:57:52,371 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-12-13 11:57:52,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:52,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2047120486, now seen corresponding path program 1 times [2022-12-13 11:57:52,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:52,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066798321] [2022-12-13 11:57:52,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:52,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:57:52,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:57:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:57:52,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:57:52,403 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:57:52,404 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 34 remaining) [2022-12-13 11:57:52,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 34 remaining) [2022-12-13 11:57:52,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 34 remaining) [2022-12-13 11:57:52,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 34 remaining) [2022-12-13 11:57:52,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 34 remaining) [2022-12-13 11:57:52,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 34 remaining) [2022-12-13 11:57:52,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 34 remaining) [2022-12-13 11:57:52,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 34 remaining) [2022-12-13 11:57:52,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 34 remaining) [2022-12-13 11:57:52,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (24 of 34 remaining) [2022-12-13 11:57:52,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 34 remaining) [2022-12-13 11:57:52,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 34 remaining) [2022-12-13 11:57:52,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (21 of 34 remaining) [2022-12-13 11:57:52,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (20 of 34 remaining) [2022-12-13 11:57:52,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 34 remaining) [2022-12-13 11:57:52,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 34 remaining) [2022-12-13 11:57:52,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 34 remaining) [2022-12-13 11:57:52,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 34 remaining) [2022-12-13 11:57:52,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (15 of 34 remaining) [2022-12-13 11:57:52,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 34 remaining) [2022-12-13 11:57:52,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 34 remaining) [2022-12-13 11:57:52,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 34 remaining) [2022-12-13 11:57:52,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 34 remaining) [2022-12-13 11:57:52,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 34 remaining) [2022-12-13 11:57:52,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 34 remaining) [2022-12-13 11:57:52,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 34 remaining) [2022-12-13 11:57:52,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 34 remaining) [2022-12-13 11:57:52,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (6 of 34 remaining) [2022-12-13 11:57:52,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 34 remaining) [2022-12-13 11:57:52,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 34 remaining) [2022-12-13 11:57:52,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (3 of 34 remaining) [2022-12-13 11:57:52,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (2 of 34 remaining) [2022-12-13 11:57:52,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 34 remaining) [2022-12-13 11:57:52,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 34 remaining) [2022-12-13 11:57:52,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:57:52,409 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-13 11:57:52,411 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 11:57:52,411 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-12-13 11:57:52,440 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:57:52,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 165 transitions, 342 flow [2022-12-13 11:57:52,463 INFO L130 PetriNetUnfolder]: 13/199 cut-off events. [2022-12-13 11:57:52,463 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:57:52,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 199 events. 13/199 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 605 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 144. Up to 6 conditions per place. [2022-12-13 11:57:52,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 165 transitions, 342 flow [2022-12-13 11:57:52,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 165 transitions, 342 flow [2022-12-13 11:57:52,466 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 11:57:52,466 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 165 transitions, 342 flow [2022-12-13 11:57:52,466 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 165 transitions, 342 flow [2022-12-13 11:57:52,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 165 transitions, 342 flow [2022-12-13 11:57:52,482 INFO L130 PetriNetUnfolder]: 13/199 cut-off events. [2022-12-13 11:57:52,482 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:57:52,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 199 events. 13/199 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 605 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 144. Up to 6 conditions per place. [2022-12-13 11:57:52,487 INFO L119 LiptonReduction]: Number of co-enabled transitions 12852 [2022-12-13 11:57:53,846 INFO L134 LiptonReduction]: Checked pairs total: 51741 [2022-12-13 11:57:53,846 INFO L136 LiptonReduction]: Total number of compositions: 122 [2022-12-13 11:57:53,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:57:53,849 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;@6f1f034a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:57:53,849 INFO L358 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2022-12-13 11:57:53,850 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-13 11:57:53,850 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:53,850 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:53,850 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 11:57:53,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-12-13 11:57:53,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:53,850 INFO L85 PathProgramCache]: Analyzing trace with hash 27454, now seen corresponding path program 1 times [2022-12-13 11:57:53,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:53,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161407587] [2022-12-13 11:57:53,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:53,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:53,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:53,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161407587] [2022-12-13 11:57:53,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161407587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:53,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:53,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:57:53,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045796547] [2022-12-13 11:57:53,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:53,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:57:53,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:53,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:57:53,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:57:53,926 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 287 [2022-12-13 11:57:53,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 83 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:53,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:53,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 287 [2022-12-13 11:57:53,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:54,958 INFO L130 PetriNetUnfolder]: 5941/10974 cut-off events. [2022-12-13 11:57:54,959 INFO L131 PetriNetUnfolder]: For 248/248 co-relation queries the response was YES. [2022-12-13 11:57:54,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20852 conditions, 10974 events. 5941/10974 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 90500 event pairs, 2574 based on Foata normal form. 161/6080 useless extension candidates. Maximal degree in co-relation 16000. Up to 5337 conditions per place. [2022-12-13 11:57:55,030 INFO L137 encePairwiseOnDemand]: 276/287 looper letters, 91 selfloop transitions, 4 changer transitions 0/118 dead transitions. [2022-12-13 11:57:55,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 118 transitions, 443 flow [2022-12-13 11:57:55,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:57:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:57:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2022-12-13 11:57:55,033 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5749128919860628 [2022-12-13 11:57:55,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2022-12-13 11:57:55,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2022-12-13 11:57:55,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:57:55,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2022-12-13 11:57:55,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:55,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:55,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:55,039 INFO L175 Difference]: Start difference. First operand has 83 places, 83 transitions, 178 flow. Second operand 3 states and 495 transitions. [2022-12-13 11:57:55,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 118 transitions, 443 flow [2022-12-13 11:57:55,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 118 transitions, 441 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 11:57:55,042 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 184 flow [2022-12-13 11:57:55,043 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2022-12-13 11:57:55,044 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -4 predicate places. [2022-12-13 11:57:55,044 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 184 flow [2022-12-13 11:57:55,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:55,044 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:55,044 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 11:57:55,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:57:55,045 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-12-13 11:57:55,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:55,045 INFO L85 PathProgramCache]: Analyzing trace with hash 27456, now seen corresponding path program 1 times [2022-12-13 11:57:55,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:55,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306077936] [2022-12-13 11:57:55,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:55,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:55,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:55,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306077936] [2022-12-13 11:57:55,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306077936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:55,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:55,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:57:55,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806888750] [2022-12-13 11:57:55,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:55,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:57:55,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:55,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:57:55,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:57:55,138 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 287 [2022-12-13 11:57:55,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:55,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:55,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 287 [2022-12-13 11:57:55,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:55,773 INFO L130 PetriNetUnfolder]: 4054/7510 cut-off events. [2022-12-13 11:57:55,774 INFO L131 PetriNetUnfolder]: For 2781/2781 co-relation queries the response was YES. [2022-12-13 11:57:55,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16668 conditions, 7510 events. 4054/7510 cut-off events. For 2781/2781 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 56584 event pairs, 3241 based on Foata normal form. 961/5896 useless extension candidates. Maximal degree in co-relation 13301. Up to 6550 conditions per place. [2022-12-13 11:57:55,809 INFO L137 encePairwiseOnDemand]: 285/287 looper letters, 48 selfloop transitions, 1 changer transitions 0/74 dead transitions. [2022-12-13 11:57:55,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 280 flow [2022-12-13 11:57:55,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:57:55,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:57:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2022-12-13 11:57:55,811 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.519163763066202 [2022-12-13 11:57:55,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2022-12-13 11:57:55,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2022-12-13 11:57:55,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:57:55,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2022-12-13 11:57:55,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:55,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:55,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:55,814 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 184 flow. Second operand 3 states and 447 transitions. [2022-12-13 11:57:55,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 280 flow [2022-12-13 11:57:55,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 74 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:57:55,824 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 176 flow [2022-12-13 11:57:55,824 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2022-12-13 11:57:55,825 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -5 predicate places. [2022-12-13 11:57:55,825 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 176 flow [2022-12-13 11:57:55,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:55,825 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:55,826 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:55,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:57:55,826 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-12-13 11:57:55,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:55,826 INFO L85 PathProgramCache]: Analyzing trace with hash 706269978, now seen corresponding path program 1 times [2022-12-13 11:57:55,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:55,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27118251] [2022-12-13 11:57:55,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:55,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:55,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:55,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27118251] [2022-12-13 11:57:55,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27118251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:55,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:55,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:57:55,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513959413] [2022-12-13 11:57:55,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:55,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:57:55,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:55,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:57:55,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:57:55,945 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 287 [2022-12-13 11:57:55,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:55,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:55,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 287 [2022-12-13 11:57:55,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:56,746 INFO L130 PetriNetUnfolder]: 5957/11272 cut-off events. [2022-12-13 11:57:56,746 INFO L131 PetriNetUnfolder]: For 1522/1522 co-relation queries the response was YES. [2022-12-13 11:57:56,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23758 conditions, 11272 events. 5957/11272 cut-off events. For 1522/1522 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 96795 event pairs, 1801 based on Foata normal form. 0/6685 useless extension candidates. Maximal degree in co-relation 23748. Up to 4923 conditions per place. [2022-12-13 11:57:56,786 INFO L137 encePairwiseOnDemand]: 271/287 looper letters, 83 selfloop transitions, 12 changer transitions 0/116 dead transitions. [2022-12-13 11:57:56,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 116 transitions, 469 flow [2022-12-13 11:57:56,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:57:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:57:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2022-12-13 11:57:56,787 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5389082462253194 [2022-12-13 11:57:56,787 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2022-12-13 11:57:56,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2022-12-13 11:57:56,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:57:56,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2022-12-13 11:57:56,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:56,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:56,790 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:56,790 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 176 flow. Second operand 3 states and 464 transitions. [2022-12-13 11:57:56,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 116 transitions, 469 flow [2022-12-13 11:57:56,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 116 transitions, 468 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:57:56,807 INFO L231 Difference]: Finished difference. Result has 81 places, 85 transitions, 287 flow [2022-12-13 11:57:56,807 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=81, PETRI_TRANSITIONS=85} [2022-12-13 11:57:56,807 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -2 predicate places. [2022-12-13 11:57:56,807 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 85 transitions, 287 flow [2022-12-13 11:57:56,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:56,808 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:56,808 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:56,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:57:56,808 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-12-13 11:57:56,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:56,808 INFO L85 PathProgramCache]: Analyzing trace with hash 706269979, now seen corresponding path program 1 times [2022-12-13 11:57:56,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:56,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325848051] [2022-12-13 11:57:56,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:56,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:56,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:56,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325848051] [2022-12-13 11:57:56,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325848051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:56,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:56,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:57:56,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804396620] [2022-12-13 11:57:56,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:56,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:57:56,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:56,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:57:56,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:57:56,903 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 287 [2022-12-13 11:57:56,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 85 transitions, 287 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:56,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:56,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 287 [2022-12-13 11:57:56,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:57,630 INFO L130 PetriNetUnfolder]: 4498/8520 cut-off events. [2022-12-13 11:57:57,630 INFO L131 PetriNetUnfolder]: For 4241/4399 co-relation queries the response was YES. [2022-12-13 11:57:57,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21156 conditions, 8520 events. 4498/8520 cut-off events. For 4241/4399 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 68379 event pairs, 1735 based on Foata normal form. 970/6750 useless extension candidates. Maximal degree in co-relation 21145. Up to 6249 conditions per place. [2022-12-13 11:57:57,660 INFO L137 encePairwiseOnDemand]: 279/287 looper letters, 73 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2022-12-13 11:57:57,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 490 flow [2022-12-13 11:57:57,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:57:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:57:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2022-12-13 11:57:57,661 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5365853658536586 [2022-12-13 11:57:57,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2022-12-13 11:57:57,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2022-12-13 11:57:57,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:57:57,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2022-12-13 11:57:57,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:57,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:57,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:57,664 INFO L175 Difference]: Start difference. First operand has 81 places, 85 transitions, 287 flow. Second operand 3 states and 462 transitions. [2022-12-13 11:57:57,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 490 flow [2022-12-13 11:57:57,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 103 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:57:57,672 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 261 flow [2022-12-13 11:57:57,672 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2022-12-13 11:57:57,673 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -8 predicate places. [2022-12-13 11:57:57,673 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 261 flow [2022-12-13 11:57:57,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:57,673 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:57,673 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:57,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:57:57,673 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-12-13 11:57:57,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash 120642760, now seen corresponding path program 1 times [2022-12-13 11:57:57,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:57,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645044613] [2022-12-13 11:57:57,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:57,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:57,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:57,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:57,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645044613] [2022-12-13 11:57:57,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645044613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:57,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:57,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:57:57,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059804021] [2022-12-13 11:57:57,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:57,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:57:57,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:57,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:57:57,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:57:57,849 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 287 [2022-12-13 11:57:57,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:57,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:57,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 287 [2022-12-13 11:57:57,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:58,548 INFO L130 PetriNetUnfolder]: 4975/9449 cut-off events. [2022-12-13 11:57:58,548 INFO L131 PetriNetUnfolder]: For 3696/3856 co-relation queries the response was YES. [2022-12-13 11:57:58,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22742 conditions, 9449 events. 4975/9449 cut-off events. For 3696/3856 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 74955 event pairs, 2361 based on Foata normal form. 0/6177 useless extension candidates. Maximal degree in co-relation 22731. Up to 7873 conditions per place. [2022-12-13 11:57:58,582 INFO L137 encePairwiseOnDemand]: 278/287 looper letters, 74 selfloop transitions, 6 changer transitions 0/104 dead transitions. [2022-12-13 11:57:58,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 104 transitions, 505 flow [2022-12-13 11:57:58,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:57:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:57:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2022-12-13 11:57:58,584 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5200348432055749 [2022-12-13 11:57:58,584 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 597 transitions. [2022-12-13 11:57:58,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 597 transitions. [2022-12-13 11:57:58,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:57:58,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 597 transitions. [2022-12-13 11:57:58,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:58,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 287.0) internal successors, (1435), 5 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:58,587 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 287.0) internal successors, (1435), 5 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:58,587 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 261 flow. Second operand 4 states and 597 transitions. [2022-12-13 11:57:58,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 104 transitions, 505 flow [2022-12-13 11:57:58,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 104 transitions, 491 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:57:58,605 INFO L231 Difference]: Finished difference. Result has 78 places, 84 transitions, 304 flow [2022-12-13 11:57:58,605 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=78, PETRI_TRANSITIONS=84} [2022-12-13 11:57:58,606 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -5 predicate places. [2022-12-13 11:57:58,606 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 84 transitions, 304 flow [2022-12-13 11:57:58,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:58,606 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:58,606 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-12-13 11:57:58,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:57:58,606 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-12-13 11:57:58,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:58,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1443035119, now seen corresponding path program 1 times [2022-12-13 11:57:58,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:58,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818224979] [2022-12-13 11:57:58,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:58,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:57:58,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:57:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:57:58,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:57:58,623 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:57:58,623 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 49 remaining) [2022-12-13 11:57:58,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 49 remaining) [2022-12-13 11:57:58,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 49 remaining) [2022-12-13 11:57:58,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 49 remaining) [2022-12-13 11:57:58,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 49 remaining) [2022-12-13 11:57:58,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 49 remaining) [2022-12-13 11:57:58,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 49 remaining) [2022-12-13 11:57:58,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 49 remaining) [2022-12-13 11:57:58,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 49 remaining) [2022-12-13 11:57:58,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (39 of 49 remaining) [2022-12-13 11:57:58,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 49 remaining) [2022-12-13 11:57:58,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 49 remaining) [2022-12-13 11:57:58,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (36 of 49 remaining) [2022-12-13 11:57:58,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (35 of 49 remaining) [2022-12-13 11:57:58,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 49 remaining) [2022-12-13 11:57:58,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 49 remaining) [2022-12-13 11:57:58,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 49 remaining) [2022-12-13 11:57:58,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 49 remaining) [2022-12-13 11:57:58,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (30 of 49 remaining) [2022-12-13 11:57:58,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 49 remaining) [2022-12-13 11:57:58,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 49 remaining) [2022-12-13 11:57:58,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 49 remaining) [2022-12-13 11:57:58,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 49 remaining) [2022-12-13 11:57:58,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 49 remaining) [2022-12-13 11:57:58,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 49 remaining) [2022-12-13 11:57:58,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 49 remaining) [2022-12-13 11:57:58,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 49 remaining) [2022-12-13 11:57:58,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (21 of 49 remaining) [2022-12-13 11:57:58,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 49 remaining) [2022-12-13 11:57:58,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 49 remaining) [2022-12-13 11:57:58,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (18 of 49 remaining) [2022-12-13 11:57:58,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (17 of 49 remaining) [2022-12-13 11:57:58,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 49 remaining) [2022-12-13 11:57:58,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 49 remaining) [2022-12-13 11:57:58,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 49 remaining) [2022-12-13 11:57:58,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 49 remaining) [2022-12-13 11:57:58,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 49 remaining) [2022-12-13 11:57:58,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 49 remaining) [2022-12-13 11:57:58,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 49 remaining) [2022-12-13 11:57:58,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 49 remaining) [2022-12-13 11:57:58,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 49 remaining) [2022-12-13 11:57:58,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 49 remaining) [2022-12-13 11:57:58,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (6 of 49 remaining) [2022-12-13 11:57:58,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 49 remaining) [2022-12-13 11:57:58,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 49 remaining) [2022-12-13 11:57:58,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (3 of 49 remaining) [2022-12-13 11:57:58,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (2 of 49 remaining) [2022-12-13 11:57:58,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 49 remaining) [2022-12-13 11:57:58,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 49 remaining) [2022-12-13 11:57:58,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:57:58,628 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-12-13 11:57:58,628 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 11:57:58,628 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-12-13 11:57:58,662 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:57:58,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 229 transitions, 479 flow [2022-12-13 11:57:58,689 INFO L130 PetriNetUnfolder]: 19/281 cut-off events. [2022-12-13 11:57:58,689 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 11:57:58,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 281 events. 19/281 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1064 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 207. Up to 8 conditions per place. [2022-12-13 11:57:58,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 229 transitions, 479 flow [2022-12-13 11:57:58,693 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 229 transitions, 479 flow [2022-12-13 11:57:58,693 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 11:57:58,693 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 229 transitions, 479 flow [2022-12-13 11:57:58,693 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 229 transitions, 479 flow [2022-12-13 11:57:58,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 229 transitions, 479 flow [2022-12-13 11:57:58,718 INFO L130 PetriNetUnfolder]: 19/281 cut-off events. [2022-12-13 11:57:58,718 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 11:57:58,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 281 events. 19/281 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1064 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 207. Up to 8 conditions per place. [2022-12-13 11:57:58,730 INFO L119 LiptonReduction]: Number of co-enabled transitions 31374 [2022-12-13 11:58:00,831 INFO L134 LiptonReduction]: Checked pairs total: 111759 [2022-12-13 11:58:00,831 INFO L136 LiptonReduction]: Total number of compositions: 158 [2022-12-13 11:58:00,832 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:58:00,833 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;@6f1f034a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:58:00,833 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-12-13 11:58:00,834 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-13 11:58:00,834 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:00,834 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:00,834 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 11:58:00,834 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 11:58:00,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:00,835 INFO L85 PathProgramCache]: Analyzing trace with hash 41885, now seen corresponding path program 1 times [2022-12-13 11:58:00,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:00,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295509739] [2022-12-13 11:58:00,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:00,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:58:00,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:00,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295509739] [2022-12-13 11:58:00,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295509739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:00,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:00,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:58:00,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430425151] [2022-12-13 11:58:00,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:00,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:58:00,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:00,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:58:00,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:58:00,902 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 387 [2022-12-13 11:58:00,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:00,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:00,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 387 [2022-12-13 11:58:00,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:24,338 INFO L130 PetriNetUnfolder]: 246283/368842 cut-off events. [2022-12-13 11:58:24,338 INFO L131 PetriNetUnfolder]: For 12946/12946 co-relation queries the response was YES. [2022-12-13 11:58:24,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715481 conditions, 368842 events. 246283/368842 cut-off events. For 12946/12946 co-relation queries the response was YES. Maximal size of possible extension queue 13974. Compared 3601184 event pairs, 97151 based on Foata normal form. 3696/200117 useless extension candidates. Maximal degree in co-relation 231356. Up to 195883 conditions per place. [2022-12-13 11:58:26,093 INFO L137 encePairwiseOnDemand]: 374/387 looper letters, 142 selfloop transitions, 7 changer transitions 0/181 dead transitions. [2022-12-13 11:58:26,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 181 transitions, 693 flow [2022-12-13 11:58:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 697 transitions. [2022-12-13 11:58:26,096 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6003445305770887 [2022-12-13 11:58:26,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 697 transitions. [2022-12-13 11:58:26,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 697 transitions. [2022-12-13 11:58:26,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:58:26,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 697 transitions. [2022-12-13 11:58:26,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:26,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:26,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:26,101 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 253 flow. Second operand 3 states and 697 transitions. [2022-12-13 11:58:26,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 181 transitions, 693 flow [2022-12-13 11:58:26,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 181 transitions, 685 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-13 11:58:26,114 INFO L231 Difference]: Finished difference. Result has 114 places, 114 transitions, 285 flow [2022-12-13 11:58:26,114 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=114, PETRI_TRANSITIONS=114} [2022-12-13 11:58:26,115 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2022-12-13 11:58:26,115 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 114 transitions, 285 flow [2022-12-13 11:58:26,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:26,115 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:26,115 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 11:58:26,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:58:26,116 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 11:58:26,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash 41886, now seen corresponding path program 1 times [2022-12-13 11:58:26,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:26,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829289230] [2022-12-13 11:58:26,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:26,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:58:26,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:26,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829289230] [2022-12-13 11:58:26,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829289230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:26,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:26,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:58:26,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149293798] [2022-12-13 11:58:26,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:26,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:58:26,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:26,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:58:26,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:58:26,200 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 387 [2022-12-13 11:58:26,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 114 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:26,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:26,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 387 [2022-12-13 11:58:26,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:42,846 INFO L130 PetriNetUnfolder]: 168092/260396 cut-off events. [2022-12-13 11:58:42,847 INFO L131 PetriNetUnfolder]: For 81524/81524 co-relation queries the response was YES. [2022-12-13 11:58:43,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564453 conditions, 260396 events. 168092/260396 cut-off events. For 81524/81524 co-relation queries the response was YES. Maximal size of possible extension queue 9289. Compared 2532794 event pairs, 141062 based on Foata normal form. 24020/185622 useless extension candidates. Maximal degree in co-relation 482144. Up to 229794 conditions per place. [2022-12-13 11:58:44,199 INFO L137 encePairwiseOnDemand]: 385/387 looper letters, 78 selfloop transitions, 1 changer transitions 0/113 dead transitions. [2022-12-13 11:58:44,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 113 transitions, 441 flow [2022-12-13 11:58:44,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:44,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2022-12-13 11:58:44,201 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5400516795865633 [2022-12-13 11:58:44,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2022-12-13 11:58:44,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2022-12-13 11:58:44,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:58:44,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2022-12-13 11:58:44,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:44,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:44,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:44,205 INFO L175 Difference]: Start difference. First operand has 114 places, 114 transitions, 285 flow. Second operand 3 states and 627 transitions. [2022-12-13 11:58:44,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 113 transitions, 441 flow [2022-12-13 11:58:44,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 113 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:44,658 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 271 flow [2022-12-13 11:58:44,659 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2022-12-13 11:58:44,659 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, -4 predicate places. [2022-12-13 11:58:44,659 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 271 flow [2022-12-13 11:58:44,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:44,659 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:44,659 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:44,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:58:44,660 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 11:58:44,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:44,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1958552889, now seen corresponding path program 1 times [2022-12-13 11:58:44,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:44,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421733969] [2022-12-13 11:58:44,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:44,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:58:44,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:44,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421733969] [2022-12-13 11:58:44,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421733969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:44,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:44,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:58:44,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915905616] [2022-12-13 11:58:44,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:44,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:58:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:44,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:58:44,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:58:44,741 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 387 [2022-12-13 11:58:44,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:44,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:44,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 387 [2022-12-13 11:58:44,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:59:13,679 INFO L130 PetriNetUnfolder]: 310642/465039 cut-off events. [2022-12-13 11:59:13,679 INFO L131 PetriNetUnfolder]: For 62566/62566 co-relation queries the response was YES. [2022-12-13 11:59:14,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993778 conditions, 465039 events. 310642/465039 cut-off events. For 62566/62566 co-relation queries the response was YES. Maximal size of possible extension queue 17175. Compared 4610350 event pairs, 125802 based on Foata normal form. 0/267053 useless extension candidates. Maximal degree in co-relation 993767. Up to 245080 conditions per place. [2022-12-13 11:59:16,291 INFO L137 encePairwiseOnDemand]: 367/387 looper letters, 138 selfloop transitions, 19 changer transitions 0/186 dead transitions. [2022-12-13 11:59:16,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 186 transitions, 767 flow [2022-12-13 11:59:16,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:59:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:59:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2022-12-13 11:59:16,293 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5770887166236004 [2022-12-13 11:59:16,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 670 transitions. [2022-12-13 11:59:16,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 670 transitions. [2022-12-13 11:59:16,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:59:16,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 670 transitions. [2022-12-13 11:59:16,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:16,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:16,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:16,297 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 271 flow. Second operand 3 states and 670 transitions. [2022-12-13 11:59:16,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 186 transitions, 767 flow [2022-12-13 11:59:16,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 186 transitions, 766 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:59:16,305 INFO L231 Difference]: Finished difference. Result has 116 places, 131 transitions, 450 flow [2022-12-13 11:59:16,305 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=116, PETRI_TRANSITIONS=131} [2022-12-13 11:59:16,306 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, -1 predicate places. [2022-12-13 11:59:16,306 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 131 transitions, 450 flow [2022-12-13 11:59:16,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:16,306 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:59:16,306 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:16,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:59:16,306 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 11:59:16,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:16,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1958552890, now seen corresponding path program 1 times [2022-12-13 11:59:16,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:16,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875769338] [2022-12-13 11:59:16,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:16,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:59:16,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:16,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875769338] [2022-12-13 11:59:16,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875769338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:59:16,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:59:16,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:59:16,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297245145] [2022-12-13 11:59:16,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:59:16,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:59:16,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:59:16,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:59:16,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:59:16,420 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 387 [2022-12-13 11:59:16,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 131 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:16,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:59:16,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 387 [2022-12-13 11:59:16,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:59:42,296 INFO L130 PetriNetUnfolder]: 236959/357420 cut-off events. [2022-12-13 11:59:42,296 INFO L131 PetriNetUnfolder]: For 167798/173140 co-relation queries the response was YES. [2022-12-13 11:59:43,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876565 conditions, 357420 events. 236959/357420 cut-off events. For 167798/173140 co-relation queries the response was YES. Maximal size of possible extension queue 12520. Compared 3461286 event pairs, 82391 based on Foata normal form. 26366/257437 useless extension candidates. Maximal degree in co-relation 876553. Up to 281430 conditions per place. [2022-12-13 11:59:44,497 INFO L137 encePairwiseOnDemand]: 378/387 looper letters, 132 selfloop transitions, 9 changer transitions 0/176 dead transitions. [2022-12-13 11:59:44,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 176 transitions, 854 flow [2022-12-13 11:59:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:59:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:59:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2022-12-13 11:59:44,499 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5745047372954349 [2022-12-13 11:59:44,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 667 transitions. [2022-12-13 11:59:44,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 667 transitions. [2022-12-13 11:59:44,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:59:44,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 667 transitions. [2022-12-13 11:59:44,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:44,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:44,502 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:44,503 INFO L175 Difference]: Start difference. First operand has 116 places, 131 transitions, 450 flow. Second operand 3 states and 667 transitions. [2022-12-13 11:59:44,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 176 transitions, 854 flow [2022-12-13 11:59:44,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 176 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:59:44,894 INFO L231 Difference]: Finished difference. Result has 110 places, 125 transitions, 418 flow [2022-12-13 11:59:44,894 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=110, PETRI_TRANSITIONS=125} [2022-12-13 11:59:44,894 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, -7 predicate places. [2022-12-13 11:59:44,894 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 125 transitions, 418 flow [2022-12-13 11:59:44,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:44,895 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:59:44,895 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:44,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:59:44,895 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 11:59:44,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:44,895 INFO L85 PathProgramCache]: Analyzing trace with hash 973692694, now seen corresponding path program 1 times [2022-12-13 11:59:44,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:44,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653117822] [2022-12-13 11:59:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:44,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:59:44,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:44,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653117822] [2022-12-13 11:59:44,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653117822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:59:44,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:59:44,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:59:44,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946850858] [2022-12-13 11:59:44,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:59:44,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:59:44,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:59:44,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:59:44,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:59:45,032 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 387 [2022-12-13 11:59:45,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 125 transitions, 418 flow. Second operand has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:45,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:59:45,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 387 [2022-12-13 11:59:45,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:12,006 INFO L130 PetriNetUnfolder]: 255694/394958 cut-off events. [2022-12-13 12:00:12,006 INFO L131 PetriNetUnfolder]: For 155627/164100 co-relation queries the response was YES. [2022-12-13 12:00:12,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929218 conditions, 394958 events. 255694/394958 cut-off events. For 155627/164100 co-relation queries the response was YES. Maximal size of possible extension queue 13865. Compared 3947640 event pairs, 135596 based on Foata normal form. 2536/247532 useless extension candidates. Maximal degree in co-relation 929206. Up to 346850 conditions per place. [2022-12-13 12:00:14,347 INFO L137 encePairwiseOnDemand]: 374/387 looper letters, 120 selfloop transitions, 8 changer transitions 0/162 dead transitions. [2022-12-13 12:00:14,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 162 transitions, 790 flow [2022-12-13 12:00:14,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:00:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:00:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 843 transitions. [2022-12-13 12:00:14,349 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5445736434108527 [2022-12-13 12:00:14,349 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 843 transitions. [2022-12-13 12:00:14,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 843 transitions. [2022-12-13 12:00:14,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:00:14,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 843 transitions. [2022-12-13 12:00:14,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 210.75) internal successors, (843), 4 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:14,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:14,355 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:14,355 INFO L175 Difference]: Start difference. First operand has 110 places, 125 transitions, 418 flow. Second operand 4 states and 843 transitions. [2022-12-13 12:00:14,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 162 transitions, 790 flow [2022-12-13 12:00:21,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 162 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:00:21,255 INFO L231 Difference]: Finished difference. Result has 113 places, 132 transitions, 471 flow [2022-12-13 12:00:21,255 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=471, PETRI_PLACES=113, PETRI_TRANSITIONS=132} [2022-12-13 12:00:21,255 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, -4 predicate places. [2022-12-13 12:00:21,255 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 132 transitions, 471 flow [2022-12-13 12:00:21,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:21,255 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:21,255 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:21,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:00:21,256 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 12:00:21,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:21,256 INFO L85 PathProgramCache]: Analyzing trace with hash -675951326, now seen corresponding path program 1 times [2022-12-13 12:00:21,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:21,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657912142] [2022-12-13 12:00:21,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:21,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 12:00:21,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:21,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657912142] [2022-12-13 12:00:21,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657912142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:21,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:21,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:00:21,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768022924] [2022-12-13 12:00:21,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:21,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:00:21,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:21,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:00:21,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:00:21,345 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 387 [2022-12-13 12:00:21,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 132 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:21,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:21,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 387 [2022-12-13 12:00:21,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:08,258 INFO L130 PetriNetUnfolder]: 425406/642717 cut-off events. [2022-12-13 12:01:08,258 INFO L131 PetriNetUnfolder]: For 341108/357743 co-relation queries the response was YES. [2022-12-13 12:01:09,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1594587 conditions, 642717 events. 425406/642717 cut-off events. For 341108/357743 co-relation queries the response was YES. Maximal size of possible extension queue 19562. Compared 6486742 event pairs, 139773 based on Foata normal form. 4230/449951 useless extension candidates. Maximal degree in co-relation 1594572. Up to 324935 conditions per place. [2022-12-13 12:01:12,524 INFO L137 encePairwiseOnDemand]: 367/387 looper letters, 166 selfloop transitions, 30 changer transitions 0/223 dead transitions. [2022-12-13 12:01:12,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 223 transitions, 1220 flow [2022-12-13 12:01:12,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:01:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:01:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2022-12-13 12:01:12,527 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5710594315245479 [2022-12-13 12:01:12,527 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 663 transitions. [2022-12-13 12:01:12,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 663 transitions. [2022-12-13 12:01:12,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:01:12,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 663 transitions. [2022-12-13 12:01:12,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:12,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:12,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:12,530 INFO L175 Difference]: Start difference. First operand has 113 places, 132 transitions, 471 flow. Second operand 3 states and 663 transitions. [2022-12-13 12:01:12,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 223 transitions, 1220 flow [2022-12-13 12:01:12,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 223 transitions, 1216 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 12:01:12,605 INFO L231 Difference]: Finished difference. Result has 117 places, 161 transitions, 808 flow [2022-12-13 12:01:12,605 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=808, PETRI_PLACES=117, PETRI_TRANSITIONS=161} [2022-12-13 12:01:12,605 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 0 predicate places. [2022-12-13 12:01:12,606 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 161 transitions, 808 flow [2022-12-13 12:01:12,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:12,606 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:12,606 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:12,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:01:12,606 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 12:01:12,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:12,606 INFO L85 PathProgramCache]: Analyzing trace with hash -675951325, now seen corresponding path program 1 times [2022-12-13 12:01:12,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:12,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485360796] [2022-12-13 12:01:12,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:12,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 12:01:12,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:12,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485360796] [2022-12-13 12:01:12,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485360796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:12,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:12,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:01:12,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005808206] [2022-12-13 12:01:12,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:12,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:01:12,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:12,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:01:12,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:01:12,715 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 387 [2022-12-13 12:01:12,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 161 transitions, 808 flow. Second operand has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:12,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:12,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 387 [2022-12-13 12:01:12,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:31,844 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1272] L722-9-->L708-2: Formula: (and (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_73| 0) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95| 0)) (= (+ |v_thr1Thread1of3ForFork0_push_~oldTop~0#1_21| 1) 0) (< |v_#StackHeapBarrier_62| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95|) (= (store |v_#length_336| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95| 4) |v_#length_335|) (= |v_#valid_488| (store |v_#valid_489| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95| 1)) (= |v_thr1Thread1of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread1of3ForFork0_push_#in~d#1_13| |v_thr1Thread1of3ForFork0_push_~d#1_19|) (= (select |v_#valid_489| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, #valid=|v_#valid_489|, #length=|v_#length_336|} OutVars{thr1Thread1of3ForFork0_push_~d#1=|v_thr1Thread1of3ForFork0_push_~d#1_19|, thr1Thread1of3ForFork0_push_#in~d#1=|v_thr1Thread1of3ForFork0_push_#in~d#1_13|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, thr1Thread1of3ForFork0_push_~oldTop~0#1=|v_thr1Thread1of3ForFork0_push_~oldTop~0#1_21|, #valid=|v_#valid_488|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_73|, thr1Thread1of3ForFork0_push_#t~mem4#1=|v_thr1Thread1of3ForFork0_push_#t~mem4#1_31|, #length=|v_#length_335|, thr1Thread1of3ForFork0_push_#t~mem3#1=|v_thr1Thread1of3ForFork0_push_#t~mem3#1_39|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95|, thr1Thread1of3ForFork0_push_#t~mem6#1=|v_thr1Thread1of3ForFork0_push_#t~mem6#1_19|, thr1Thread1of3ForFork0_push_#t~mem5#1=|v_thr1Thread1of3ForFork0_push_#t~mem5#1_29|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_push_~d#1, thr1Thread1of3ForFork0_push_#in~d#1, thr1Thread1of3ForFork0_push_~oldTop~0#1, #valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, thr1Thread1of3ForFork0_push_#t~mem4#1, #length, thr1Thread1of3ForFork0_push_#t~mem3#1, thr1Thread1of3ForFork0_push_~#newTop~0#1.base, thr1Thread1of3ForFork0_push_#t~mem6#1, thr1Thread1of3ForFork0_push_#t~mem5#1][17], [Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 83#L714true, 243#true, 210#L708-4true, 167#L708-2true, Black: 233#true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 250#true, Black: 245#(= ~next_alloc_idx~0 1), Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 46#L728-5true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 258#(and (= (select |#length| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 252#(= (select |#valid| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 1)]) [2022-12-13 12:01:31,844 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 12:01:31,844 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 12:01:31,844 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 12:01:31,844 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 12:01:33,746 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1272] L722-9-->L708-2: Formula: (and (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_73| 0) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95| 0)) (= (+ |v_thr1Thread1of3ForFork0_push_~oldTop~0#1_21| 1) 0) (< |v_#StackHeapBarrier_62| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95|) (= (store |v_#length_336| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95| 4) |v_#length_335|) (= |v_#valid_488| (store |v_#valid_489| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95| 1)) (= |v_thr1Thread1of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread1of3ForFork0_push_#in~d#1_13| |v_thr1Thread1of3ForFork0_push_~d#1_19|) (= (select |v_#valid_489| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, #valid=|v_#valid_489|, #length=|v_#length_336|} OutVars{thr1Thread1of3ForFork0_push_~d#1=|v_thr1Thread1of3ForFork0_push_~d#1_19|, thr1Thread1of3ForFork0_push_#in~d#1=|v_thr1Thread1of3ForFork0_push_#in~d#1_13|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, thr1Thread1of3ForFork0_push_~oldTop~0#1=|v_thr1Thread1of3ForFork0_push_~oldTop~0#1_21|, #valid=|v_#valid_488|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_73|, thr1Thread1of3ForFork0_push_#t~mem4#1=|v_thr1Thread1of3ForFork0_push_#t~mem4#1_31|, #length=|v_#length_335|, thr1Thread1of3ForFork0_push_#t~mem3#1=|v_thr1Thread1of3ForFork0_push_#t~mem3#1_39|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95|, thr1Thread1of3ForFork0_push_#t~mem6#1=|v_thr1Thread1of3ForFork0_push_#t~mem6#1_19|, thr1Thread1of3ForFork0_push_#t~mem5#1=|v_thr1Thread1of3ForFork0_push_#t~mem5#1_29|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_push_~d#1, thr1Thread1of3ForFork0_push_#in~d#1, thr1Thread1of3ForFork0_push_~oldTop~0#1, #valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, thr1Thread1of3ForFork0_push_#t~mem4#1, #length, thr1Thread1of3ForFork0_push_#t~mem3#1, thr1Thread1of3ForFork0_push_~#newTop~0#1.base, thr1Thread1of3ForFork0_push_#t~mem6#1, thr1Thread1of3ForFork0_push_#t~mem5#1][17], [Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, 210#L708-4true, Black: 233#true, 167#L708-2true, 94#L714-1true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 250#true, Black: 245#(= ~next_alloc_idx~0 1), Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 46#L728-5true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 258#(and (= (select |#length| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 252#(= (select |#valid| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 1)]) [2022-12-13 12:01:33,746 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 12:01:33,746 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 12:01:33,746 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 12:01:33,746 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 12:01:43,418 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1272] L722-9-->L708-2: Formula: (and (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_73| 0) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95| 0)) (= (+ |v_thr1Thread1of3ForFork0_push_~oldTop~0#1_21| 1) 0) (< |v_#StackHeapBarrier_62| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95|) (= (store |v_#length_336| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95| 4) |v_#length_335|) (= |v_#valid_488| (store |v_#valid_489| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95| 1)) (= |v_thr1Thread1of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread1of3ForFork0_push_#in~d#1_13| |v_thr1Thread1of3ForFork0_push_~d#1_19|) (= (select |v_#valid_489| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, #valid=|v_#valid_489|, #length=|v_#length_336|} OutVars{thr1Thread1of3ForFork0_push_~d#1=|v_thr1Thread1of3ForFork0_push_~d#1_19|, thr1Thread1of3ForFork0_push_#in~d#1=|v_thr1Thread1of3ForFork0_push_#in~d#1_13|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, thr1Thread1of3ForFork0_push_~oldTop~0#1=|v_thr1Thread1of3ForFork0_push_~oldTop~0#1_21|, #valid=|v_#valid_488|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_73|, thr1Thread1of3ForFork0_push_#t~mem4#1=|v_thr1Thread1of3ForFork0_push_#t~mem4#1_31|, #length=|v_#length_335|, thr1Thread1of3ForFork0_push_#t~mem3#1=|v_thr1Thread1of3ForFork0_push_#t~mem3#1_39|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_95|, thr1Thread1of3ForFork0_push_#t~mem6#1=|v_thr1Thread1of3ForFork0_push_#t~mem6#1_19|, thr1Thread1of3ForFork0_push_#t~mem5#1=|v_thr1Thread1of3ForFork0_push_#t~mem5#1_29|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_push_~d#1, thr1Thread1of3ForFork0_push_#in~d#1, thr1Thread1of3ForFork0_push_~oldTop~0#1, #valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, thr1Thread1of3ForFork0_push_#t~mem4#1, #length, thr1Thread1of3ForFork0_push_#t~mem3#1, thr1Thread1of3ForFork0_push_~#newTop~0#1.base, thr1Thread1of3ForFork0_push_#t~mem6#1, thr1Thread1of3ForFork0_push_#t~mem5#1][17], [Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 122#L718-1true, 243#true, 210#L708-4true, Black: 233#true, 167#L708-2true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), 250#true, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 46#L728-5true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 252#(= (select |#valid| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 1), 258#(and (= (select |#length| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))]) [2022-12-13 12:01:43,418 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2022-12-13 12:01:43,418 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-13 12:01:43,418 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 12:01:43,418 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-13 12:01:52,580 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([972] L718-1-->L708-4: Formula: (= (store |v_#valid_16| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread3of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread3of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][199], [120#L717-1true, 30#L728-4true, Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, 210#L708-4true, Black: 235#(= (select |#valid| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1), 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 39#L716-1true, 250#true, Black: 245#(= ~next_alloc_idx~0 1), thr1Thread1of3ForFork0InUse, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 252#(= (select |#valid| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 1), 258#(and (= (select |#length| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))]) [2022-12-13 12:01:52,580 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-13 12:01:52,580 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 12:01:52,580 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-12-13 12:01:52,580 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-12-13 12:01:53,148 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([972] L718-1-->L708-4: Formula: (= (store |v_#valid_16| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread3of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread3of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][207], [Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 44#thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 243#true, 210#L708-4true, Black: 235#(= (select |#valid| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1), 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 143#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), 250#true, thr1Thread1of3ForFork0InUse, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 252#(= (select |#valid| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 1), 258#(and (= (select |#length| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))]) [2022-12-13 12:01:53,148 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-13 12:01:53,148 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-12-13 12:01:53,148 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-12-13 12:01:53,148 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-12-13 12:01:53,159 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([972] L718-1-->L708-4: Formula: (= (store |v_#valid_16| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread3of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread3of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][207], [Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, 210#L708-4true, Black: 235#(= (select |#valid| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1), 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 214#thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 143#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 250#true, Black: 245#(= ~next_alloc_idx~0 1), thr1Thread1of3ForFork0InUse, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 258#(and (= (select |#length| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 252#(= (select |#valid| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 1)]) [2022-12-13 12:01:53,159 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-13 12:01:53,159 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-13 12:01:53,159 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-13 12:01:53,159 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-13 12:01:53,171 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([972] L718-1-->L708-4: Formula: (= (store |v_#valid_16| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread3of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread3of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][207], [Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, 210#L708-4true, Black: 235#(= (select |#valid| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1), 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 214#thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 38#thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 250#true, Black: 245#(= ~next_alloc_idx~0 1), thr1Thread1of3ForFork0InUse, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 258#(and (= (select |#length| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 252#(= (select |#valid| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 1)]) [2022-12-13 12:01:53,171 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-12-13 12:01:53,171 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-13 12:01:53,171 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-13 12:01:53,171 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-13 12:01:53,172 INFO L130 PetriNetUnfolder]: 332307/503103 cut-off events. [2022-12-13 12:01:53,173 INFO L131 PetriNetUnfolder]: For 496101/514547 co-relation queries the response was YES. [2022-12-13 12:01:54,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419394 conditions, 503103 events. 332307/503103 cut-off events. For 496101/514547 co-relation queries the response was YES. Maximal size of possible extension queue 14733. Compared 4935069 event pairs, 105303 based on Foata normal form. 49497/414523 useless extension candidates. Maximal degree in co-relation 1419377. Up to 386585 conditions per place. [2022-12-13 12:01:56,933 INFO L137 encePairwiseOnDemand]: 378/387 looper letters, 164 selfloop transitions, 17 changer transitions 0/218 dead transitions. [2022-12-13 12:01:56,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 218 transitions, 1412 flow [2022-12-13 12:01:56,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:01:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:01:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2022-12-13 12:01:56,936 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5693367786391043 [2022-12-13 12:01:56,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 661 transitions. [2022-12-13 12:01:56,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 661 transitions. [2022-12-13 12:01:56,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:01:56,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 661 transitions. [2022-12-13 12:01:56,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:56,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:56,944 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:56,944 INFO L175 Difference]: Start difference. First operand has 117 places, 161 transitions, 808 flow. Second operand 3 states and 661 transitions. [2022-12-13 12:01:56,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 218 transitions, 1412 flow [2022-12-13 12:01:57,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 218 transitions, 1352 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:01:57,433 INFO L231 Difference]: Finished difference. Result has 111 places, 155 transitions, 768 flow [2022-12-13 12:01:57,433 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=111, PETRI_TRANSITIONS=155} [2022-12-13 12:01:57,434 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, -6 predicate places. [2022-12-13 12:01:57,434 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 155 transitions, 768 flow [2022-12-13 12:01:57,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:57,434 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:57,434 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:57,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 12:01:57,434 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 12:01:57,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:57,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1210836261, now seen corresponding path program 1 times [2022-12-13 12:01:57,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:57,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28348438] [2022-12-13 12:01:57,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:57,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:57,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:57,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28348438] [2022-12-13 12:01:57,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28348438] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:01:57,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082005405] [2022-12-13 12:01:57,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:57,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:01:57,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:01:57,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:01:57,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 12:01:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:57,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 12:01:57,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:01:57,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:01:57,757 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 12:01:57,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 12:01:57,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 12:01:57,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 12:01:57,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:01:57,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 12:01:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:57,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:01:57,875 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) is different from false [2022-12-13 12:01:57,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:01:57,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 121 [2022-12-13 12:01:57,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2022-12-13 12:01:57,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2022-12-13 12:01:58,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:01:58,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2022-12-13 12:01:58,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2022-12-13 12:01:58,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 12:01:58,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2022-12-13 12:01:58,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-12-13 12:01:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 12:01:58,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082005405] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:01:58,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:01:58,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-13 12:01:58,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111406571] [2022-12-13 12:01:58,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:01:58,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 12:01:58,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:58,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 12:01:58,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=99, Unknown=1, NotChecked=20, Total=156 [2022-12-13 12:01:58,285 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 387 [2022-12-13 12:01:58,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 155 transitions, 768 flow. Second operand has 13 states, 13 states have (on average 133.84615384615384) internal successors, (1740), 13 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:58,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:58,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 387 [2022-12-13 12:01:58,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:03:03,997 INFO L130 PetriNetUnfolder]: 562118/807797 cut-off events. [2022-12-13 12:03:03,997 INFO L131 PetriNetUnfolder]: For 741795/741845 co-relation queries the response was YES. [2022-12-13 12:03:06,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276006 conditions, 807797 events. 562118/807797 cut-off events. For 741795/741845 co-relation queries the response was YES. Maximal size of possible extension queue 22072. Compared 7421305 event pairs, 235126 based on Foata normal form. 1403/569689 useless extension candidates. Maximal degree in co-relation 2275989. Up to 700470 conditions per place. [2022-12-13 12:03:09,873 INFO L137 encePairwiseOnDemand]: 326/387 looper letters, 366 selfloop transitions, 113 changer transitions 0/493 dead transitions. [2022-12-13 12:03:09,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 493 transitions, 3105 flow [2022-12-13 12:03:09,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 12:03:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 12:03:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1704 transitions. [2022-12-13 12:03:09,878 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44031007751937984 [2022-12-13 12:03:09,878 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1704 transitions. [2022-12-13 12:03:09,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1704 transitions. [2022-12-13 12:03:09,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:03:09,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1704 transitions. [2022-12-13 12:03:09,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 170.4) internal successors, (1704), 10 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:09,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 387.0) internal successors, (4257), 11 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:09,886 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 387.0) internal successors, (4257), 11 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:09,886 INFO L175 Difference]: Start difference. First operand has 111 places, 155 transitions, 768 flow. Second operand 10 states and 1704 transitions. [2022-12-13 12:03:09,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 493 transitions, 3105 flow [2022-12-13 12:03:28,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 493 transitions, 3019 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:03:28,091 INFO L231 Difference]: Finished difference. Result has 125 places, 260 transitions, 1886 flow [2022-12-13 12:03:28,091 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1886, PETRI_PLACES=125, PETRI_TRANSITIONS=260} [2022-12-13 12:03:28,091 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2022-12-13 12:03:28,091 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 260 transitions, 1886 flow [2022-12-13 12:03:28,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.84615384615384) internal successors, (1740), 13 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:28,092 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:03:28,092 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:28,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:03:28,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4181aafa-fba8-4ad9-9a79-299954fcaa54/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 12:03:28,294 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 12:03:28,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:03:28,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1049120806, now seen corresponding path program 1 times [2022-12-13 12:03:28,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:03:28,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788224817] [2022-12-13 12:03:28,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:03:28,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:03:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:03:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 12:03:28,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:03:28,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788224817] [2022-12-13 12:03:28,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788224817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:03:28,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:03:28,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:03:28,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182221939] [2022-12-13 12:03:28,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:03:28,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:03:28,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:03:28,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:03:28,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:03:28,428 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 387 [2022-12-13 12:03:28,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 260 transitions, 1886 flow. Second operand has 4 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:28,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:03:28,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 387 [2022-12-13 12:03:28,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:03:31,961 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), 60#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 233#true, 171#L3true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 128#L708-2true, 46#L728-5true, thr1Thread2of3ForFork0InUse, 356#true, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 250#true, Black: 260#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:03:31,962 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-13 12:03:31,962 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 12:03:31,962 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 12:03:31,962 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 12:03:32,389 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), 60#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 223#true, 243#true, 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 233#true, 171#L3true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), thr1Thread1of3ForFork0InUse, 128#L708-2true, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 46#L728-5true, 356#true, thr1Thread2of3ForFork0InUse, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 260#true, Black: 250#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:03:32,389 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-13 12:03:32,389 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 12:03:32,389 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 12:03:32,389 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 12:03:35,574 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [60#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), 30#L728-4true, Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), 243#true, 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 233#true, 171#L3true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), 128#L708-2true, thr1Thread1of3ForFork0InUse, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 356#true, thr1Thread2of3ForFork0InUse, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 250#true, Black: 260#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:03:35,574 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 12:03:35,574 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 12:03:35,574 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 12:03:35,574 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 12:03:36,180 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [60#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 233#true, 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 171#L3true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 128#L708-2true, thr1Thread2of3ForFork0InUse, 356#true, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 250#true, Black: 260#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:03:36,180 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 12:03:36,180 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 12:03:36,180 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 12:03:36,180 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 12:03:37,884 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [60#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), 189#thr1Err8ASSERT_VIOLATIONARRAY_INDEXtrue, Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, Black: 233#true, 260#true, 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), 128#L708-2true, thr1Thread1of3ForFork0InUse, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread2of3ForFork0InUse, 356#true, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 250#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:03:37,884 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 12:03:37,884 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 12:03:37,884 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 12:03:37,884 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 12:03:44,020 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), 8#L708-3true, Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 223#true, 243#true, 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 233#true, 171#L3true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), thr1Thread1of3ForFork0InUse, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 128#L708-2true, 46#L728-5true, thr1Thread2of3ForFork0InUse, 356#true, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 260#true, Black: 250#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:03:44,021 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 12:03:44,021 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 12:03:44,021 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 12:03:44,021 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 12:03:48,559 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [60#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), 243#true, Black: 233#true, 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 260#true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), 128#L708-2true, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 356#true, thr1Thread2of3ForFork0InUse, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), 68#thr1Err11ASSERT_VIOLATIONARRAY_INDEXtrue, thr1Thread3of3ForFork0InUse, Black: 250#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:03:48,559 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 12:03:48,559 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 12:03:48,559 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 12:03:48,559 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 12:03:49,036 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 233#true, 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 171#L3true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), 180#thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 128#L708-2true, 356#true, thr1Thread2of3ForFork0InUse, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 250#true, Black: 260#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:03:49,036 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 12:03:49,036 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 12:03:49,036 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 12:03:49,037 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 12:03:52,306 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 189#thr1Err8ASSERT_VIOLATIONARRAY_INDEXtrue, Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), 243#true, Black: 233#true, 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 260#true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 180#thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 245#(= ~next_alloc_idx~0 1), 128#L708-2true, thr1Thread1of3ForFork0InUse, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread2of3ForFork0InUse, 356#true, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 250#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:03:52,306 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 12:03:52,306 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 12:03:52,307 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 12:03:52,307 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 12:03:55,655 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [60#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, Black: 233#true, 260#true, 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 185#L717-1true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 128#L708-2true, thr1Thread2of3ForFork0InUse, 356#true, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 250#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:03:55,655 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 12:03:55,655 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 12:03:55,655 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 12:03:55,655 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 12:04:02,308 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [60#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, Black: 233#true, 260#true, 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 140#L718-1true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), 128#L708-2true, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 356#true, thr1Thread2of3ForFork0InUse, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 250#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:04:02,309 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 12:04:02,309 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 12:04:02,309 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 12:04:02,309 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 12:04:06,199 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), 243#true, Black: 233#true, 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 260#true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 128#L708-2true, 58#L716-1true, thr1Thread2of3ForFork0InUse, 356#true, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), 68#thr1Err11ASSERT_VIOLATIONARRAY_INDEXtrue, thr1Thread3of3ForFork0InUse, Black: 250#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:04:06,199 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 12:04:06,199 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 12:04:06,199 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 12:04:06,199 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 12:04:06,200 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, Black: 233#true, 260#true, 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 180#thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 245#(= ~next_alloc_idx~0 1), Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 128#L708-2true, thr1Thread2of3ForFork0InUse, 356#true, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), 68#thr1Err11ASSERT_VIOLATIONARRAY_INDEXtrue, thr1Thread3of3ForFork0InUse, Black: 250#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:04:06,200 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 12:04:06,200 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 12:04:06,200 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 12:04:06,200 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 12:04:12,875 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, Black: 233#true, 260#true, 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 185#L717-1true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 128#L708-2true, 356#true, thr1Thread2of3ForFork0InUse, 58#L716-1true, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 250#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:04:12,875 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2022-12-13 12:04:12,875 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2022-12-13 12:04:12,875 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2022-12-13 12:04:12,875 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2022-12-13 12:04:12,876 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), 243#true, Black: 233#true, 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 260#true, 185#L717-1true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), 180#thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 128#L708-2true, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 356#true, thr1Thread2of3ForFork0InUse, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 250#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:04:12,876 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2022-12-13 12:04:12,876 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2022-12-13 12:04:12,876 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2022-12-13 12:04:12,876 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2022-12-13 12:04:18,889 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, Black: 233#true, 260#true, 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 140#L718-1true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 128#L708-2true, thr1Thread2of3ForFork0InUse, 356#true, 58#L716-1true, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 250#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:04:18,889 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2022-12-13 12:04:18,889 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 12:04:18,889 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 12:04:18,890 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 12:04:18,890 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1278] L722-9-->L708-2: Formula: (and (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 0)) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71| 0) (= (select |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) 0) (= (store |v_#length_348| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 4) |v_#length_347|) (< |v_#StackHeapBarrier_68| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|) (= |v_#valid_506| (store |v_#valid_507| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_507|, #length=|v_#length_348|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_41|, #valid=|v_#valid_506|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_71|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_29|, #length=|v_#length_347|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_91|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_33|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_19|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][22], [Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, Black: 233#true, 260#true, 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 140#L718-1true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 245#(= ~next_alloc_idx~0 1), 180#thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 128#L708-2true, thr1Thread2of3ForFork0InUse, 356#true, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 250#true, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:04:18,890 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2022-12-13 12:04:18,890 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 12:04:18,890 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 12:04:18,890 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 12:04:35,669 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1240] L718-1-->L722-5: Formula: (= (store |v_#valid_445| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_76| 0) |v_#valid_444|) InVars {#valid=|v_#valid_445|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_76|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_59|, #valid=|v_#valid_444|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, #valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.base][273], [Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, Black: 235#(= (select |#valid| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1), 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 260#true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 138#L722-5true, Black: 245#(= ~next_alloc_idx~0 1), thr1Thread1of3ForFork0InUse, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 356#true, 58#L716-1true, thr1Thread2of3ForFork0InUse, 144#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 252#(= (select |#valid| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 1), Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:04:35,669 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2022-12-13 12:04:35,669 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 12:04:35,669 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-12-13 12:04:35,669 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 12:04:38,363 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([972] L718-1-->L708-4: Formula: (= (store |v_#valid_16| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread3of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread3of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][287], [120#L717-1true, Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, 210#L708-4true, Black: 235#(= (select |#valid| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1), 260#true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 39#L716-1true, Black: 245#(= ~next_alloc_idx~0 1), Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, 46#L728-5true, thr1Thread2of3ForFork0InUse, 356#true, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 252#(= (select |#valid| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 1)]) [2022-12-13 12:04:38,363 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-12-13 12:04:38,363 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 12:04:38,364 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 12:04:38,364 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 12:04:38,884 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([972] L718-1-->L708-4: Formula: (= (store |v_#valid_16| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread3of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread3of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][287], [120#L717-1true, Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), 30#L728-4true, Black: 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 243#true, 210#L708-4true, Black: 235#(= (select |#valid| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1), 260#true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 39#L716-1true, Black: 245#(= ~next_alloc_idx~0 1), thr1Thread1of3ForFork0InUse, Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 356#true, thr1Thread2of3ForFork0InUse, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 252#(= (select |#valid| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 1)]) [2022-12-13 12:04:38,885 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-13 12:04:38,885 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-12-13 12:04:38,885 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-12-13 12:04:38,885 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-12-13 12:04:39,042 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([972] L718-1-->L708-4: Formula: (= (store |v_#valid_16| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread3of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread3of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][287], [120#L717-1true, Black: 347#(and (forall ((v_ArrVal_115 (Array Int Int))) (< (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)), Black: 345#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), Black: 305#(< (mod (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65), Black: 225#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 342#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (< (mod ~next_alloc_idx~0 4294967296) 65) (<= 0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), 243#true, 210#L708-4true, Black: 235#(= (select |#valid| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1), 69#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 260#true, 231#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 39#L716-1true, Black: 245#(= ~next_alloc_idx~0 1), Black: 246#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 356#true, Black: 329#(and (or (< (mod ~next_alloc_idx~0 4294967296) 65) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_99|) 0))) (not (< 64 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))), thr1Thread3of3ForFork0InUse, Black: 252#(= (select |#valid| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) 1), Black: 322#(and (< (mod ~next_alloc_idx~0 4294967296) 65) (not (< 64 ~next_alloc_idx~0)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2022-12-13 12:04:39,042 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-13 12:04:39,042 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-12-13 12:04:39,042 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-12-13 12:04:39,043 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-12-13 12:04:39,679 INFO L130 PetriNetUnfolder]: 458418/675197 cut-off events. [2022-12-13 12:04:39,679 INFO L131 PetriNetUnfolder]: For 1555117/1593348 co-relation queries the response was YES. [2022-12-13 12:04:42,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2552082 conditions, 675197 events. 458418/675197 cut-off events. For 1555117/1593348 co-relation queries the response was YES. Maximal size of possible extension queue 19773. Compared 6446971 event pairs, 258780 based on Foata normal form. 6284/558180 useless extension candidates. Maximal degree in co-relation 2552057. Up to 607599 conditions per place. [2022-12-13 12:04:45,453 INFO L137 encePairwiseOnDemand]: 378/387 looper letters, 228 selfloop transitions, 12 changer transitions 0/288 dead transitions. [2022-12-13 12:04:45,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 288 transitions, 2563 flow [2022-12-13 12:04:45,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:04:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:04:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 829 transitions. [2022-12-13 12:04:45,456 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5355297157622739 [2022-12-13 12:04:45,456 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 829 transitions. [2022-12-13 12:04:45,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 829 transitions. [2022-12-13 12:04:45,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:04:45,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 829 transitions. [2022-12-13 12:04:45,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 207.25) internal successors, (829), 4 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:45,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:45,460 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:45,460 INFO L175 Difference]: Start difference. First operand has 125 places, 260 transitions, 1886 flow. Second operand 4 states and 829 transitions. [2022-12-13 12:04:45,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 288 transitions, 2563 flow [2022-12-13 12:05:07,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 288 transitions, 2485 flow, removed 36 selfloop flow, removed 1 redundant places. [2022-12-13 12:05:07,193 INFO L231 Difference]: Finished difference. Result has 128 places, 266 transitions, 1918 flow [2022-12-13 12:05:07,193 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1918, PETRI_PLACES=128, PETRI_TRANSITIONS=266} [2022-12-13 12:05:07,193 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 11 predicate places. [2022-12-13 12:05:07,193 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 266 transitions, 1918 flow [2022-12-13 12:05:07,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:07,194 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:07,194 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-12-13 12:05:07,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 12:05:07,194 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 12:05:07,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:07,194 INFO L85 PathProgramCache]: Analyzing trace with hash -3268986, now seen corresponding path program 1 times [2022-12-13 12:05:07,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:07,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614020092] [2022-12-13 12:05:07,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:07,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:07,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:07,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:07,209 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:05:07,209 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (63 of 64 remaining) [2022-12-13 12:05:07,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 64 remaining) [2022-12-13 12:05:07,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 64 remaining) [2022-12-13 12:05:07,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 64 remaining) [2022-12-13 12:05:07,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 64 remaining) [2022-12-13 12:05:07,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 64 remaining) [2022-12-13 12:05:07,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 64 remaining) [2022-12-13 12:05:07,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 64 remaining) [2022-12-13 12:05:07,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 64 remaining) [2022-12-13 12:05:07,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (54 of 64 remaining) [2022-12-13 12:05:07,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 64 remaining) [2022-12-13 12:05:07,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 64 remaining) [2022-12-13 12:05:07,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (51 of 64 remaining) [2022-12-13 12:05:07,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (50 of 64 remaining) [2022-12-13 12:05:07,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 64 remaining) [2022-12-13 12:05:07,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 64 remaining) [2022-12-13 12:05:07,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 64 remaining) [2022-12-13 12:05:07,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 64 remaining) [2022-12-13 12:05:07,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (45 of 64 remaining) [2022-12-13 12:05:07,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 64 remaining) [2022-12-13 12:05:07,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 64 remaining) [2022-12-13 12:05:07,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 64 remaining) [2022-12-13 12:05:07,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (36 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (33 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (32 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 64 remaining) [2022-12-13 12:05:07,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 64 remaining) [2022-12-13 12:05:07,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 64 remaining) [2022-12-13 12:05:07,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 64 remaining) [2022-12-13 12:05:07,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 64 remaining) [2022-12-13 12:05:07,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (21 of 64 remaining) [2022-12-13 12:05:07,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 64 remaining) [2022-12-13 12:05:07,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 64 remaining) [2022-12-13 12:05:07,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (18 of 64 remaining) [2022-12-13 12:05:07,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (17 of 64 remaining) [2022-12-13 12:05:07,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 64 remaining) [2022-12-13 12:05:07,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 64 remaining) [2022-12-13 12:05:07,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 64 remaining) [2022-12-13 12:05:07,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 64 remaining) [2022-12-13 12:05:07,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 64 remaining) [2022-12-13 12:05:07,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 64 remaining) [2022-12-13 12:05:07,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 64 remaining) [2022-12-13 12:05:07,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 64 remaining) [2022-12-13 12:05:07,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 64 remaining) [2022-12-13 12:05:07,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 64 remaining) [2022-12-13 12:05:07,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (6 of 64 remaining) [2022-12-13 12:05:07,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 64 remaining) [2022-12-13 12:05:07,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 64 remaining) [2022-12-13 12:05:07,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (3 of 64 remaining) [2022-12-13 12:05:07,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (2 of 64 remaining) [2022-12-13 12:05:07,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 64 remaining) [2022-12-13 12:05:07,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 64 remaining) [2022-12-13 12:05:07,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 12:05:07,215 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:07,215 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 12:05:07,215 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-12-13 12:05:07,250 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:05:07,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 281 places, 293 transitions, 618 flow [2022-12-13 12:05:07,290 INFO L130 PetriNetUnfolder]: 25/363 cut-off events. [2022-12-13 12:05:07,290 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 12:05:07,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 363 events. 25/363 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1507 event pairs, 0 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 289. Up to 10 conditions per place. [2022-12-13 12:05:07,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 281 places, 293 transitions, 618 flow [2022-12-13 12:05:07,296 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 281 places, 293 transitions, 618 flow [2022-12-13 12:05:07,296 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 12:05:07,296 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 281 places, 293 transitions, 618 flow [2022-12-13 12:05:07,296 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 281 places, 293 transitions, 618 flow [2022-12-13 12:05:07,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 281 places, 293 transitions, 618 flow [2022-12-13 12:05:07,335 INFO L130 PetriNetUnfolder]: 25/363 cut-off events. [2022-12-13 12:05:07,335 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 12:05:07,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 363 events. 25/363 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1507 event pairs, 0 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 289. Up to 10 conditions per place. [2022-12-13 12:05:07,350 INFO L119 LiptonReduction]: Number of co-enabled transitions 57960 [2022-12-13 12:05:09,718 INFO L134 LiptonReduction]: Checked pairs total: 215058 [2022-12-13 12:05:09,719 INFO L136 LiptonReduction]: Total number of compositions: 208 [2022-12-13 12:05:09,720 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:05:09,720 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;@6f1f034a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:05:09,720 INFO L358 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2022-12-13 12:05:09,721 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 12:05:09,721 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:05:09,721 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:09,721 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 12:05:09,721 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-12-13 12:05:09,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:09,722 INFO L85 PathProgramCache]: Analyzing trace with hash 59921, now seen corresponding path program 1 times [2022-12-13 12:05:09,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:09,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809172822] [2022-12-13 12:05:09,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:09,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:09,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:09,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809172822] [2022-12-13 12:05:09,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809172822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:09,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:09,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:05:09,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408083518] [2022-12-13 12:05:09,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:09,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:05:09,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:09,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:05:09,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:05:09,791 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 501 [2022-12-13 12:05:09,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 153 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:09,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:09,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 501 [2022-12-13 12:05:09,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand