./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94656be5559ee6994f8d95e82c06571dfbe5b53833c4e842ade3fa022ec89a57 --- 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-4e7fbc6 [2022-11-23 04:12:46,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 04:12:46,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 04:12:46,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 04:12:46,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 04:12:46,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 04:12:46,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 04:12:46,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 04:12:46,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 04:12:46,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 04:12:46,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 04:12:46,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 04:12:46,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 04:12:46,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 04:12:46,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 04:12:46,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 04:12:46,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 04:12:46,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 04:12:46,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 04:12:46,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 04:12:46,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 04:12:46,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 04:12:46,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 04:12:46,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 04:12:46,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 04:12:46,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 04:12:46,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 04:12:46,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 04:12:46,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 04:12:46,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 04:12:46,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 04:12:46,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 04:12:46,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 04:12:46,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 04:12:46,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 04:12:46,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 04:12:46,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 04:12:46,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 04:12:46,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 04:12:46,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 04:12:46,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 04:12:46,665 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 04:12:46,704 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 04:12:46,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 04:12:46,705 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 04:12:46,705 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 04:12:46,706 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 04:12:46,707 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 04:12:46,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 04:12:46,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 04:12:46,708 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 04:12:46,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 04:12:46,709 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 04:12:46,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 04:12:46,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 04:12:46,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 04:12:46,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 04:12:46,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 04:12:46,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 04:12:46,711 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 04:12:46,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 04:12:46,711 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 04:12:46,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 04:12:46,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 04:12:46,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 04:12:46,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 04:12:46,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 04:12:46,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 04:12:46,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 04:12:46,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 04:12:46,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 04:12:46,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 04:12:46,715 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 04:12:46,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 04:12:46,715 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 04:12:46,715 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 04:12:46,716 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_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS/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_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS 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 ! call(reach_error())) ) 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 -> 94656be5559ee6994f8d95e82c06571dfbe5b53833c4e842ade3fa022ec89a57 [2022-11-23 04:12:46,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 04:12:46,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 04:12:46,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 04:12:46,999 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 04:12:46,999 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 04:12:47,001 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix042.opt.i [2022-11-23 04:12:50,258 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 04:12:50,560 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 04:12:50,561 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/sv-benchmarks/c/pthread-wmm/mix042.opt.i [2022-11-23 04:12:50,575 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS/data/abb5cb8f8/d073b2c8c9244f3ea93bb78432a2aa05/FLAG23395f055 [2022-11-23 04:12:50,590 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS/data/abb5cb8f8/d073b2c8c9244f3ea93bb78432a2aa05 [2022-11-23 04:12:50,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 04:12:50,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 04:12:50,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 04:12:50,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 04:12:50,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 04:12:50,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:12:50" (1/1) ... [2022-11-23 04:12:50,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ee901e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:50, skipping insertion in model container [2022-11-23 04:12:50,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:12:50" (1/1) ... [2022-11-23 04:12:50,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 04:12:50,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 04:12:50,869 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_0aba286b-c7bb-4934-90dc-ab4eefbb8542/sv-benchmarks/c/pthread-wmm/mix042.opt.i[944,957] [2022-11-23 04:12:51,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 04:12:51,213 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 04:12:51,227 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_0aba286b-c7bb-4934-90dc-ab4eefbb8542/sv-benchmarks/c/pthread-wmm/mix042.opt.i[944,957] [2022-11-23 04:12:51,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 04:12:51,345 INFO L208 MainTranslator]: Completed translation [2022-11-23 04:12:51,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:51 WrapperNode [2022-11-23 04:12:51,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 04:12:51,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 04:12:51,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 04:12:51,348 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 04:12:51,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:51" (1/1) ... [2022-11-23 04:12:51,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:51" (1/1) ... [2022-11-23 04:12:51,419 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2022-11-23 04:12:51,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 04:12:51,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 04:12:51,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 04:12:51,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 04:12:51,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:51" (1/1) ... [2022-11-23 04:12:51,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:51" (1/1) ... [2022-11-23 04:12:51,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:51" (1/1) ... [2022-11-23 04:12:51,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:51" (1/1) ... [2022-11-23 04:12:51,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:51" (1/1) ... [2022-11-23 04:12:51,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:51" (1/1) ... [2022-11-23 04:12:51,466 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:51" (1/1) ... [2022-11-23 04:12:51,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:51" (1/1) ... [2022-11-23 04:12:51,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 04:12:51,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 04:12:51,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 04:12:51,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 04:12:51,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:51" (1/1) ... [2022-11-23 04:12:51,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 04:12:51,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 04:12:51,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 04:12:51,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 04:12:51,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 04:12:51,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 04:12:51,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 04:12:51,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 04:12:51,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 04:12:51,567 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 04:12:51,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 04:12:51,569 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 04:12:51,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 04:12:51,569 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 04:12:51,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 04:12:51,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 04:12:51,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 04:12:51,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 04:12:51,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 04:12:51,572 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 04:12:51,803 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 04:12:51,805 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 04:12:52,132 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 04:12:52,419 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 04:12:52,431 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 04:12:52,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:12:52 BoogieIcfgContainer [2022-11-23 04:12:52,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 04:12:52,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 04:12:52,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 04:12:52,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 04:12:52,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:12:50" (1/3) ... [2022-11-23 04:12:52,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ab3c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:12:52, skipping insertion in model container [2022-11-23 04:12:52,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:51" (2/3) ... [2022-11-23 04:12:52,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ab3c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:12:52, skipping insertion in model container [2022-11-23 04:12:52,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:12:52" (3/3) ... [2022-11-23 04:12:52,443 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.opt.i [2022-11-23 04:12:52,451 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 04:12:52,461 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 04:12:52,462 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 04:12:52,462 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 04:12:52,526 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 04:12:52,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2022-11-23 04:12:52,645 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2022-11-23 04:12:52,645 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 04:12:52,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-23 04:12:52,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2022-11-23 04:12:52,659 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2022-11-23 04:12:52,662 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 04:12:52,676 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow [2022-11-23 04:12:52,679 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow [2022-11-23 04:12:52,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow [2022-11-23 04:12:52,713 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2022-11-23 04:12:52,713 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 04:12:52,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-23 04:12:52,716 INFO L119 LiptonReduction]: Number of co-enabled transitions 2128 [2022-11-23 04:12:58,379 INFO L134 LiptonReduction]: Checked pairs total: 5030 [2022-11-23 04:12:58,379 INFO L136 LiptonReduction]: Total number of compositions: 103 [2022-11-23 04:12:58,396 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 04:12:58,402 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@6bd96e61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 04:12:58,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-23 04:12:58,408 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-11-23 04:12:58,408 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 04:12:58,409 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:12:58,409 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:12:58,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 04:12:58,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:12:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash -658438205, now seen corresponding path program 1 times [2022-11-23 04:12:58,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:12:58,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143680057] [2022-11-23 04:12:58,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:12:58,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:12:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:12:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:12:58,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:12:58,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143680057] [2022-11-23 04:12:58,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143680057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:12:58,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:12:58,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 04:12:58,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443153507] [2022-11-23 04:12:58,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:12:58,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 04:12:58,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:12:58,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 04:12:58,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 04:12:58,973 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 221 [2022-11-23 04:12:58,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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-11-23 04:12:58,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:12:58,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 221 [2022-11-23 04:12:58,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:12:59,272 INFO L130 PetriNetUnfolder]: 615/1082 cut-off events. [2022-11-23 04:12:59,273 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-23 04:12:59,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 1082 events. 615/1082 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5746 event pairs, 129 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 2042. Up to 703 conditions per place. [2022-11-23 04:12:59,288 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 25 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2022-11-23 04:12:59,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 133 flow [2022-11-23 04:12:59,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 04:12:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 04:12:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2022-11-23 04:12:59,311 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5233785822021116 [2022-11-23 04:12:59,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2022-11-23 04:12:59,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2022-11-23 04:12:59,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:12:59,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2022-11-23 04:12:59,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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-11-23 04:12:59,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 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-11-23 04:12:59,334 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 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-11-23 04:12:59,336 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 347 transitions. [2022-11-23 04:12:59,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 133 flow [2022-11-23 04:12:59,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 04:12:59,343 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2022-11-23 04:12:59,345 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-11-23 04:12:59,349 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-11-23 04:12:59,349 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2022-11-23 04:12:59,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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-11-23 04:12:59,350 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:12:59,350 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:12:59,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 04:12:59,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 04:12:59,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:12:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash -415707217, now seen corresponding path program 1 times [2022-11-23 04:12:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:12:59,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236739814] [2022-11-23 04:12:59,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:12:59,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:12:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:13:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:13:00,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:13:00,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236739814] [2022-11-23 04:13:00,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236739814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:13:00,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:13:00,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 04:13:00,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229789535] [2022-11-23 04:13:00,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:13:00,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 04:13:00,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:13:00,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 04:13:00,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 04:13:00,147 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 221 [2022-11-23 04:13:00,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 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-11-23 04:13:00,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:13:00,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 221 [2022-11-23 04:13:00,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:13:00,552 INFO L130 PetriNetUnfolder]: 1079/1636 cut-off events. [2022-11-23 04:13:00,552 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-11-23 04:13:00,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3378 conditions, 1636 events. 1079/1636 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7104 event pairs, 311 based on Foata normal form. 96/1728 useless extension candidates. Maximal degree in co-relation 3368. Up to 1025 conditions per place. [2022-11-23 04:13:00,562 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 27 selfloop transitions, 2 changer transitions 18/48 dead transitions. [2022-11-23 04:13:00,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 202 flow [2022-11-23 04:13:00,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 04:13:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 04:13:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2022-11-23 04:13:00,566 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47420814479638007 [2022-11-23 04:13:00,566 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 524 transitions. [2022-11-23 04:13:00,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 524 transitions. [2022-11-23 04:13:00,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:13:00,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 524 transitions. [2022-11-23 04:13:00,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.8) internal successors, (524), 5 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-11-23 04:13:00,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 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-11-23 04:13:00,574 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 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-11-23 04:13:00,574 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 5 states and 524 transitions. [2022-11-23 04:13:00,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 202 flow [2022-11-23 04:13:00,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 48 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 04:13:00,578 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 62 flow [2022-11-23 04:13:00,578 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2022-11-23 04:13:00,579 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-11-23 04:13:00,580 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 62 flow [2022-11-23 04:13:00,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 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-11-23 04:13:00,581 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:13:00,581 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:13:00,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 04:13:00,581 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 04:13:00,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:13:00,585 INFO L85 PathProgramCache]: Analyzing trace with hash -92901901, now seen corresponding path program 1 times [2022-11-23 04:13:00,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:13:00,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645051540] [2022-11-23 04:13:00,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:13:00,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:13:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:13:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:13:01,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:13:01,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645051540] [2022-11-23 04:13:01,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645051540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:13:01,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:13:01,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 04:13:01,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887628442] [2022-11-23 04:13:01,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:13:01,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 04:13:01,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:13:01,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 04:13:01,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 04:13:01,598 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 221 [2022-11-23 04:13:01,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 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-11-23 04:13:01,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:13:01,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 221 [2022-11-23 04:13:01,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:13:01,885 INFO L130 PetriNetUnfolder]: 605/1036 cut-off events. [2022-11-23 04:13:01,886 INFO L131 PetriNetUnfolder]: For 207/207 co-relation queries the response was YES. [2022-11-23 04:13:01,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2239 conditions, 1036 events. 605/1036 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5051 event pairs, 181 based on Foata normal form. 45/1080 useless extension candidates. Maximal degree in co-relation 2226. Up to 722 conditions per place. [2022-11-23 04:13:01,893 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 30 selfloop transitions, 5 changer transitions 14/52 dead transitions. [2022-11-23 04:13:01,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 224 flow [2022-11-23 04:13:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 04:13:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 04:13:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 663 transitions. [2022-11-23 04:13:01,896 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-11-23 04:13:01,896 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 663 transitions. [2022-11-23 04:13:01,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 663 transitions. [2022-11-23 04:13:01,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:13:01,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 663 transitions. [2022-11-23 04:13:01,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.5) internal successors, (663), 6 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-11-23 04:13:01,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 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-11-23 04:13:01,902 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 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-11-23 04:13:01,903 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 62 flow. Second operand 6 states and 663 transitions. [2022-11-23 04:13:01,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 224 flow [2022-11-23 04:13:01,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 216 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-23 04:13:01,908 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 92 flow [2022-11-23 04:13:01,909 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-11-23 04:13:01,909 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-11-23 04:13:01,910 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 92 flow [2022-11-23 04:13:01,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 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-11-23 04:13:01,910 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:13:01,911 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:13:01,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 04:13:01,911 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 04:13:01,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:13:01,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1388171842, now seen corresponding path program 1 times [2022-11-23 04:13:01,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:13:01,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714573402] [2022-11-23 04:13:01,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:13:01,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:13:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:13:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:13:02,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:13:02,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714573402] [2022-11-23 04:13:02,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714573402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:13:02,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:13:02,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 04:13:02,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571029132] [2022-11-23 04:13:02,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:13:02,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 04:13:02,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:13:02,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 04:13:02,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 04:13:02,357 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 221 [2022-11-23 04:13:02,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 92 flow. Second operand has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 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-11-23 04:13:02,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:13:02,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 221 [2022-11-23 04:13:02,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:13:02,672 INFO L130 PetriNetUnfolder]: 604/1029 cut-off events. [2022-11-23 04:13:02,676 INFO L131 PetriNetUnfolder]: For 456/468 co-relation queries the response was YES. [2022-11-23 04:13:02,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 1029 events. 604/1029 cut-off events. For 456/468 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4973 event pairs, 134 based on Foata normal form. 27/1055 useless extension candidates. Maximal degree in co-relation 2512. Up to 677 conditions per place. [2022-11-23 04:13:02,683 INFO L137 encePairwiseOnDemand]: 213/221 looper letters, 34 selfloop transitions, 10 changer transitions 7/54 dead transitions. [2022-11-23 04:13:02,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 266 flow [2022-11-23 04:13:02,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 04:13:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 04:13:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions. [2022-11-23 04:13:02,690 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4939668174962293 [2022-11-23 04:13:02,690 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 655 transitions. [2022-11-23 04:13:02,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions. [2022-11-23 04:13:02,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:13:02,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions. [2022-11-23 04:13:02,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 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-11-23 04:13:02,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 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-11-23 04:13:02,703 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 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-11-23 04:13:02,703 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 92 flow. Second operand 6 states and 655 transitions. [2022-11-23 04:13:02,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 266 flow [2022-11-23 04:13:02,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 264 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-23 04:13:02,710 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 150 flow [2022-11-23 04:13:02,711 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2022-11-23 04:13:02,713 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-11-23 04:13:02,713 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 150 flow [2022-11-23 04:13:02,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 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-11-23 04:13:02,714 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:13:02,714 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:13:02,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 04:13:02,715 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 04:13:02,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:13:02,715 INFO L85 PathProgramCache]: Analyzing trace with hash 104115834, now seen corresponding path program 2 times [2022-11-23 04:13:02,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:13:02,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167521108] [2022-11-23 04:13:02,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:13:02,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:13:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:13:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:13:03,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:13:03,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167521108] [2022-11-23 04:13:03,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167521108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:13:03,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:13:03,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 04:13:03,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600758780] [2022-11-23 04:13:03,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:13:03,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 04:13:03,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:13:03,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 04:13:03,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 04:13:03,333 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 221 [2022-11-23 04:13:03,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 150 flow. Second operand has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 0 states have call successors, (0), 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-11-23 04:13:03,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:13:03,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 221 [2022-11-23 04:13:03,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:13:03,680 INFO L130 PetriNetUnfolder]: 609/1043 cut-off events. [2022-11-23 04:13:03,680 INFO L131 PetriNetUnfolder]: For 1110/1128 co-relation queries the response was YES. [2022-11-23 04:13:03,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 1043 events. 609/1043 cut-off events. For 1110/1128 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5079 event pairs, 128 based on Foata normal form. 27/1069 useless extension candidates. Maximal degree in co-relation 3026. Up to 680 conditions per place. [2022-11-23 04:13:03,688 INFO L137 encePairwiseOnDemand]: 213/221 looper letters, 35 selfloop transitions, 11 changer transitions 11/60 dead transitions. [2022-11-23 04:13:03,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 366 flow [2022-11-23 04:13:03,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 04:13:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 04:13:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 761 transitions. [2022-11-23 04:13:03,691 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4919198448610213 [2022-11-23 04:13:03,691 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 761 transitions. [2022-11-23 04:13:03,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 761 transitions. [2022-11-23 04:13:03,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:13:03,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 761 transitions. [2022-11-23 04:13:03,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 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-11-23 04:13:03,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 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-11-23 04:13:03,697 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 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-11-23 04:13:03,697 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 150 flow. Second operand 7 states and 761 transitions. [2022-11-23 04:13:03,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 366 flow [2022-11-23 04:13:03,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 352 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-23 04:13:03,702 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 191 flow [2022-11-23 04:13:03,703 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=191, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2022-11-23 04:13:03,703 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2022-11-23 04:13:03,704 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 191 flow [2022-11-23 04:13:03,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 0 states have call successors, (0), 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-11-23 04:13:03,704 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:13:03,704 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:13:03,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 04:13:03,705 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 04:13:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:13:03,705 INFO L85 PathProgramCache]: Analyzing trace with hash 136232454, now seen corresponding path program 3 times [2022-11-23 04:13:03,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:13:03,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969978270] [2022-11-23 04:13:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:13:03,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:13:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:13:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:13:04,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:13:04,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969978270] [2022-11-23 04:13:04,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969978270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:13:04,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:13:04,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 04:13:04,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029424731] [2022-11-23 04:13:04,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:13:04,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 04:13:04,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:13:04,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 04:13:04,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 04:13:04,231 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 221 [2022-11-23 04:13:04,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 191 flow. Second operand has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 0 states have call successors, (0), 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-11-23 04:13:04,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:13:04,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 221 [2022-11-23 04:13:04,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:13:04,578 INFO L130 PetriNetUnfolder]: 614/1051 cut-off events. [2022-11-23 04:13:04,579 INFO L131 PetriNetUnfolder]: For 2145/2169 co-relation queries the response was YES. [2022-11-23 04:13:04,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3436 conditions, 1051 events. 614/1051 cut-off events. For 2145/2169 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5142 event pairs, 132 based on Foata normal form. 33/1083 useless extension candidates. Maximal degree in co-relation 3414. Up to 688 conditions per place. [2022-11-23 04:13:04,586 INFO L137 encePairwiseOnDemand]: 213/221 looper letters, 36 selfloop transitions, 13 changer transitions 7/59 dead transitions. [2022-11-23 04:13:04,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 416 flow [2022-11-23 04:13:04,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 04:13:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 04:13:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 654 transitions. [2022-11-23 04:13:04,589 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49321266968325794 [2022-11-23 04:13:04,589 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 654 transitions. [2022-11-23 04:13:04,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 654 transitions. [2022-11-23 04:13:04,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:13:04,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 654 transitions. [2022-11-23 04:13:04,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 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-11-23 04:13:04,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 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-11-23 04:13:04,595 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 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-11-23 04:13:04,595 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 191 flow. Second operand 6 states and 654 transitions. [2022-11-23 04:13:04,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 416 flow [2022-11-23 04:13:04,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 389 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-23 04:13:04,601 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 244 flow [2022-11-23 04:13:04,602 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2022-11-23 04:13:04,603 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-11-23 04:13:04,603 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 244 flow [2022-11-23 04:13:04,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 0 states have call successors, (0), 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-11-23 04:13:04,604 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:13:04,604 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:13:04,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 04:13:04,605 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 04:13:04,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:13:04,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1328291932, now seen corresponding path program 4 times [2022-11-23 04:13:04,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:13:04,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007653854] [2022-11-23 04:13:04,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:13:04,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:13:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:13:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:13:04,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:13:04,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007653854] [2022-11-23 04:13:04,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007653854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:13:04,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:13:04,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 04:13:04,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826801030] [2022-11-23 04:13:04,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:13:04,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 04:13:04,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:13:04,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 04:13:04,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 04:13:05,002 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 221 [2022-11-23 04:13:05,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 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-11-23 04:13:05,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:13:05,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 221 [2022-11-23 04:13:05,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:13:05,340 INFO L130 PetriNetUnfolder]: 678/1148 cut-off events. [2022-11-23 04:13:05,340 INFO L131 PetriNetUnfolder]: For 3267/3291 co-relation queries the response was YES. [2022-11-23 04:13:05,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4054 conditions, 1148 events. 678/1148 cut-off events. For 3267/3291 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5663 event pairs, 134 based on Foata normal form. 51/1198 useless extension candidates. Maximal degree in co-relation 4031. Up to 688 conditions per place. [2022-11-23 04:13:05,349 INFO L137 encePairwiseOnDemand]: 213/221 looper letters, 38 selfloop transitions, 16 changer transitions 7/64 dead transitions. [2022-11-23 04:13:05,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 488 flow [2022-11-23 04:13:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 04:13:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 04:13:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 758 transitions. [2022-11-23 04:13:05,352 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48998060762766643 [2022-11-23 04:13:05,352 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 758 transitions. [2022-11-23 04:13:05,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 758 transitions. [2022-11-23 04:13:05,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:13:05,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 758 transitions. [2022-11-23 04:13:05,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 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-11-23 04:13:05,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 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-11-23 04:13:05,359 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 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-11-23 04:13:05,359 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 244 flow. Second operand 7 states and 758 transitions. [2022-11-23 04:13:05,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 488 flow [2022-11-23 04:13:05,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 456 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-11-23 04:13:05,370 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 301 flow [2022-11-23 04:13:05,371 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2022-11-23 04:13:05,371 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2022-11-23 04:13:05,372 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 301 flow [2022-11-23 04:13:05,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 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-11-23 04:13:05,372 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:13:05,372 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:13:05,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 04:13:05,373 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 04:13:05,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:13:05,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1963016574, now seen corresponding path program 5 times [2022-11-23 04:13:05,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:13:05,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227323373] [2022-11-23 04:13:05,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:13:05,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:13:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:13:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:13:05,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:13:05,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227323373] [2022-11-23 04:13:05,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227323373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:13:05,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:13:05,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 04:13:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525668180] [2022-11-23 04:13:05,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:13:05,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 04:13:05,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:13:05,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 04:13:05,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 04:13:05,794 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 221 [2022-11-23 04:13:05,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 301 flow. Second operand has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 0 states have call successors, (0), 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-11-23 04:13:05,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:13:05,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 221 [2022-11-23 04:13:05,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:13:06,215 INFO L130 PetriNetUnfolder]: 676/1152 cut-off events. [2022-11-23 04:13:06,218 INFO L131 PetriNetUnfolder]: For 3702/3744 co-relation queries the response was YES. [2022-11-23 04:13:06,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4385 conditions, 1152 events. 676/1152 cut-off events. For 3702/3744 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5733 event pairs, 126 based on Foata normal form. 69/1220 useless extension candidates. Maximal degree in co-relation 4360. Up to 651 conditions per place. [2022-11-23 04:13:06,228 INFO L137 encePairwiseOnDemand]: 214/221 looper letters, 36 selfloop transitions, 20 changer transitions 12/71 dead transitions. [2022-11-23 04:13:06,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 593 flow [2022-11-23 04:13:06,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 04:13:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 04:13:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 864 transitions. [2022-11-23 04:13:06,231 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48868778280542985 [2022-11-23 04:13:06,231 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 864 transitions. [2022-11-23 04:13:06,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 864 transitions. [2022-11-23 04:13:06,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:13:06,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 864 transitions. [2022-11-23 04:13:06,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 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-11-23 04:13:06,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 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-11-23 04:13:06,240 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 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-11-23 04:13:06,240 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 301 flow. Second operand 8 states and 864 transitions. [2022-11-23 04:13:06,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 593 flow [2022-11-23 04:13:06,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 571 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-23 04:13:06,252 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 377 flow [2022-11-23 04:13:06,252 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=377, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2022-11-23 04:13:06,256 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2022-11-23 04:13:06,256 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 377 flow [2022-11-23 04:13:06,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 0 states have call successors, (0), 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-11-23 04:13:06,257 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:13:06,257 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:13:06,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 04:13:06,257 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 04:13:06,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:13:06,259 INFO L85 PathProgramCache]: Analyzing trace with hash -808753194, now seen corresponding path program 1 times [2022-11-23 04:13:06,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:13:06,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372591302] [2022-11-23 04:13:06,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:13:06,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:13:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:13:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:13:06,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:13:06,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372591302] [2022-11-23 04:13:06,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372591302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:13:06,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:13:06,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 04:13:06,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264607495] [2022-11-23 04:13:06,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:13:06,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 04:13:06,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:13:06,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 04:13:06,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 04:13:06,466 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 221 [2022-11-23 04:13:06,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 377 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 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-11-23 04:13:06,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:13:06,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 221 [2022-11-23 04:13:06,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:13:06,670 INFO L130 PetriNetUnfolder]: 428/748 cut-off events. [2022-11-23 04:13:06,670 INFO L131 PetriNetUnfolder]: For 4405/4482 co-relation queries the response was YES. [2022-11-23 04:13:06,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3257 conditions, 748 events. 428/748 cut-off events. For 4405/4482 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3594 event pairs, 69 based on Foata normal form. 138/871 useless extension candidates. Maximal degree in co-relation 3230. Up to 350 conditions per place. [2022-11-23 04:13:06,676 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 68 selfloop transitions, 5 changer transitions 1/80 dead transitions. [2022-11-23 04:13:06,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 859 flow [2022-11-23 04:13:06,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 04:13:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 04:13:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 441 transitions. [2022-11-23 04:13:06,678 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.498868778280543 [2022-11-23 04:13:06,679 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 441 transitions. [2022-11-23 04:13:06,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 441 transitions. [2022-11-23 04:13:06,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:13:06,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 441 transitions. [2022-11-23 04:13:06,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 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-11-23 04:13:06,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 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-11-23 04:13:06,717 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 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-11-23 04:13:06,717 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 377 flow. Second operand 4 states and 441 transitions. [2022-11-23 04:13:06,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 859 flow [2022-11-23 04:13:06,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 80 transitions, 772 flow, removed 21 selfloop flow, removed 6 redundant places. [2022-11-23 04:13:06,727 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 378 flow [2022-11-23 04:13:06,727 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=378, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2022-11-23 04:13:06,729 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2022-11-23 04:13:06,729 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 378 flow [2022-11-23 04:13:06,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 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-11-23 04:13:06,731 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:13:06,731 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:13:06,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 04:13:06,733 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 04:13:06,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:13:06,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1065337481, now seen corresponding path program 1 times [2022-11-23 04:13:06,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:13:06,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121119984] [2022-11-23 04:13:06,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:13:06,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:13:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:13:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:13:06,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:13:06,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121119984] [2022-11-23 04:13:06,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121119984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:13:06,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:13:06,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 04:13:06,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999907633] [2022-11-23 04:13:06,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:13:06,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 04:13:06,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:13:06,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 04:13:06,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 04:13:06,940 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 221 [2022-11-23 04:13:06,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 378 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 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-11-23 04:13:06,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:13:06,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 221 [2022-11-23 04:13:06,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:13:07,144 INFO L130 PetriNetUnfolder]: 199/386 cut-off events. [2022-11-23 04:13:07,144 INFO L131 PetriNetUnfolder]: For 1835/1877 co-relation queries the response was YES. [2022-11-23 04:13:07,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 386 events. 199/386 cut-off events. For 1835/1877 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1634 event pairs, 33 based on Foata normal form. 83/463 useless extension candidates. Maximal degree in co-relation 1628. Up to 148 conditions per place. [2022-11-23 04:13:07,148 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 60 selfloop transitions, 8 changer transitions 1/75 dead transitions. [2022-11-23 04:13:07,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 709 flow [2022-11-23 04:13:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 04:13:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 04:13:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2022-11-23 04:13:07,150 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4986425339366516 [2022-11-23 04:13:07,150 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2022-11-23 04:13:07,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2022-11-23 04:13:07,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:13:07,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2022-11-23 04:13:07,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 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-11-23 04:13:07,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 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-11-23 04:13:07,155 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 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-11-23 04:13:07,155 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 378 flow. Second operand 5 states and 551 transitions. [2022-11-23 04:13:07,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 709 flow [2022-11-23 04:13:07,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 618 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-11-23 04:13:07,164 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 289 flow [2022-11-23 04:13:07,165 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2022-11-23 04:13:07,165 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2022-11-23 04:13:07,166 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 289 flow [2022-11-23 04:13:07,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 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-11-23 04:13:07,166 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:13:07,166 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:13:07,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 04:13:07,166 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 04:13:07,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:13:07,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2126383144, now seen corresponding path program 1 times [2022-11-23 04:13:07,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:13:07,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090445383] [2022-11-23 04:13:07,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:13:07,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:13:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:13:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:13:07,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:13:07,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090445383] [2022-11-23 04:13:07,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090445383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:13:07,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:13:07,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 04:13:07,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501506932] [2022-11-23 04:13:07,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:13:07,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 04:13:07,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:13:07,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 04:13:07,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 04:13:07,335 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 221 [2022-11-23 04:13:07,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 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-11-23 04:13:07,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:13:07,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 221 [2022-11-23 04:13:07,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:13:07,557 INFO L130 PetriNetUnfolder]: 228/478 cut-off events. [2022-11-23 04:13:07,557 INFO L131 PetriNetUnfolder]: For 1661/1695 co-relation queries the response was YES. [2022-11-23 04:13:07,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2082 conditions, 478 events. 228/478 cut-off events. For 1661/1695 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2269 event pairs, 25 based on Foata normal form. 42/517 useless extension candidates. Maximal degree in co-relation 2056. Up to 244 conditions per place. [2022-11-23 04:13:07,561 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 61 selfloop transitions, 2 changer transitions 27/95 dead transitions. [2022-11-23 04:13:07,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 900 flow [2022-11-23 04:13:07,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 04:13:07,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 04:13:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 556 transitions. [2022-11-23 04:13:07,563 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5031674208144796 [2022-11-23 04:13:07,563 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 556 transitions. [2022-11-23 04:13:07,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 556 transitions. [2022-11-23 04:13:07,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:13:07,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 556 transitions. [2022-11-23 04:13:07,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 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-11-23 04:13:07,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 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-11-23 04:13:07,569 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 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-11-23 04:13:07,570 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 289 flow. Second operand 5 states and 556 transitions. [2022-11-23 04:13:07,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 900 flow [2022-11-23 04:13:07,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 95 transitions, 839 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-11-23 04:13:07,581 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 280 flow [2022-11-23 04:13:07,582 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2022-11-23 04:13:07,583 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2022-11-23 04:13:07,583 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 280 flow [2022-11-23 04:13:07,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 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-11-23 04:13:07,583 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:13:07,584 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:13:07,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 04:13:07,584 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 04:13:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:13:07,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1059436484, now seen corresponding path program 2 times [2022-11-23 04:13:07,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:13:07,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970588173] [2022-11-23 04:13:07,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:13:07,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:13:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:13:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:13:07,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:13:07,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970588173] [2022-11-23 04:13:07,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970588173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:13:07,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:13:07,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 04:13:07,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212426645] [2022-11-23 04:13:07,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:13:07,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 04:13:07,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:13:07,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 04:13:07,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 04:13:07,823 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 221 [2022-11-23 04:13:07,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 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-11-23 04:13:07,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:13:07,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 221 [2022-11-23 04:13:07,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:13:08,000 INFO L130 PetriNetUnfolder]: 163/333 cut-off events. [2022-11-23 04:13:08,001 INFO L131 PetriNetUnfolder]: For 1152/1178 co-relation queries the response was YES. [2022-11-23 04:13:08,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 333 events. 163/333 cut-off events. For 1152/1178 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1436 event pairs, 32 based on Foata normal form. 46/375 useless extension candidates. Maximal degree in co-relation 1340. Up to 119 conditions per place. [2022-11-23 04:13:08,003 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 38 selfloop transitions, 11 changer transitions 10/65 dead transitions. [2022-11-23 04:13:08,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 554 flow [2022-11-23 04:13:08,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 04:13:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 04:13:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2022-11-23 04:13:08,006 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48491704374057315 [2022-11-23 04:13:08,006 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 643 transitions. [2022-11-23 04:13:08,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions. [2022-11-23 04:13:08,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:13:08,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions. [2022-11-23 04:13:08,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 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-11-23 04:13:08,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 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-11-23 04:13:08,011 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 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-11-23 04:13:08,012 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 280 flow. Second operand 6 states and 643 transitions. [2022-11-23 04:13:08,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 554 flow [2022-11-23 04:13:08,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 489 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-11-23 04:13:08,016 INFO L231 Difference]: Finished difference. Result has 60 places, 38 transitions, 252 flow [2022-11-23 04:13:08,016 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=60, PETRI_TRANSITIONS=38} [2022-11-23 04:13:08,017 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 26 predicate places. [2022-11-23 04:13:08,017 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 38 transitions, 252 flow [2022-11-23 04:13:08,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 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-11-23 04:13:08,018 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:13:08,018 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:13:08,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 04:13:08,018 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 04:13:08,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:13:08,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1253229209, now seen corresponding path program 1 times [2022-11-23 04:13:08,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:13:08,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488378817] [2022-11-23 04:13:08,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:13:08,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:13:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:13:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:13:08,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:13:08,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488378817] [2022-11-23 04:13:08,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488378817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:13:08,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:13:08,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 04:13:08,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546645810] [2022-11-23 04:13:08,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:13:08,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 04:13:08,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:13:08,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 04:13:08,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 04:13:08,596 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 221 [2022-11-23 04:13:08,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 38 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 96.5) internal successors, (579), 6 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:13:08,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:13:08,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 221 [2022-11-23 04:13:08,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:13:08,958 INFO L130 PetriNetUnfolder]: 263/511 cut-off events. [2022-11-23 04:13:08,959 INFO L131 PetriNetUnfolder]: For 1246/1263 co-relation queries the response was YES. [2022-11-23 04:13:08,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2096 conditions, 511 events. 263/511 cut-off events. For 1246/1263 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2228 event pairs, 46 based on Foata normal form. 18/527 useless extension candidates. Maximal degree in co-relation 2071. Up to 256 conditions per place. [2022-11-23 04:13:08,962 INFO L137 encePairwiseOnDemand]: 214/221 looper letters, 32 selfloop transitions, 3 changer transitions 54/91 dead transitions. [2022-11-23 04:13:08,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 749 flow [2022-11-23 04:13:08,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 04:13:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 04:13:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 709 transitions. [2022-11-23 04:13:08,964 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45830639948287005 [2022-11-23 04:13:08,965 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 709 transitions. [2022-11-23 04:13:08,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 709 transitions. [2022-11-23 04:13:08,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:13:08,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 709 transitions. [2022-11-23 04:13:08,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.28571428571429) internal successors, (709), 7 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:13:08,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 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-11-23 04:13:08,970 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 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-11-23 04:13:08,971 INFO L175 Difference]: Start difference. First operand has 60 places, 38 transitions, 252 flow. Second operand 7 states and 709 transitions. [2022-11-23 04:13:08,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 749 flow [2022-11-23 04:13:08,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 597 flow, removed 30 selfloop flow, removed 11 redundant places. [2022-11-23 04:13:08,977 INFO L231 Difference]: Finished difference. Result has 59 places, 32 transitions, 159 flow [2022-11-23 04:13:08,977 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=59, PETRI_TRANSITIONS=32} [2022-11-23 04:13:08,977 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2022-11-23 04:13:08,978 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 32 transitions, 159 flow [2022-11-23 04:13:08,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.5) internal successors, (579), 6 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:13:08,978 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:13:08,978 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:13:08,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 04:13:08,979 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 04:13:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:13:08,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1333807615, now seen corresponding path program 2 times [2022-11-23 04:13:08,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:13:08,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583933037] [2022-11-23 04:13:08,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:13:08,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:13:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 04:13:09,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 04:13:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 04:13:09,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 04:13:09,084 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 04:13:09,085 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-23 04:13:09,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-23 04:13:09,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-23 04:13:09,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-23 04:13:09,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-23 04:13:09,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-23 04:13:09,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 04:13:09,088 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1] [2022-11-23 04:13:09,095 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 04:13:09,095 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 04:13:09,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:13:09 BasicIcfg [2022-11-23 04:13:09,197 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 04:13:09,198 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 04:13:09,198 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 04:13:09,199 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 04:13:09,199 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:12:52" (3/4) ... [2022-11-23 04:13:09,201 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 04:13:09,326 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 04:13:09,326 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 04:13:09,327 INFO L158 Benchmark]: Toolchain (without parser) took 18732.46ms. Allocated memory was 197.1MB in the beginning and 358.6MB in the end (delta: 161.5MB). Free memory was 150.5MB in the beginning and 234.8MB in the end (delta: -84.2MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2022-11-23 04:13:09,327 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 132.1MB. Free memory was 74.7MB in the beginning and 74.6MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 04:13:09,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 750.45ms. Allocated memory is still 197.1MB. Free memory was 150.0MB in the beginning and 126.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 04:13:09,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.40ms. Allocated memory is still 197.1MB. Free memory was 126.9MB in the beginning and 124.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 04:13:09,328 INFO L158 Benchmark]: Boogie Preprocessor took 48.73ms. Allocated memory is still 197.1MB. Free memory was 124.4MB in the beginning and 122.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 04:13:09,329 INFO L158 Benchmark]: RCFGBuilder took 962.10ms. Allocated memory is still 197.1MB. Free memory was 122.7MB in the beginning and 138.8MB in the end (delta: -16.0MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2022-11-23 04:13:09,329 INFO L158 Benchmark]: TraceAbstraction took 16761.20ms. Allocated memory was 197.1MB in the beginning and 358.6MB in the end (delta: 161.5MB). Free memory was 138.8MB in the beginning and 246.3MB in the end (delta: -107.5MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. [2022-11-23 04:13:09,329 INFO L158 Benchmark]: Witness Printer took 128.01ms. Allocated memory is still 358.6MB. Free memory was 246.3MB in the beginning and 234.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 04:13:09,334 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 132.1MB. Free memory was 74.7MB in the beginning and 74.6MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 750.45ms. Allocated memory is still 197.1MB. Free memory was 150.0MB in the beginning and 126.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.40ms. Allocated memory is still 197.1MB. Free memory was 126.9MB in the beginning and 124.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.73ms. Allocated memory is still 197.1MB. Free memory was 124.4MB in the beginning and 122.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 962.10ms. Allocated memory is still 197.1MB. Free memory was 122.7MB in the beginning and 138.8MB in the end (delta: -16.0MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 16761.20ms. Allocated memory was 197.1MB in the beginning and 358.6MB in the end (delta: 161.5MB). Free memory was 138.8MB in the beginning and 246.3MB in the end (delta: -107.5MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. * Witness Printer took 128.01ms. Allocated memory is still 358.6MB. Free memory was 246.3MB in the beginning and 234.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 123 PlacesBefore, 34 PlacesAfterwards, 115 TransitionsBefore, 25 TransitionsAfterwards, 2128 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 5030 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2548, independent: 2396, independent conditional: 0, independent unconditional: 2396, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1510, independent: 1454, independent conditional: 0, independent unconditional: 1454, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1510, independent: 1439, independent conditional: 0, independent unconditional: 1439, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 543, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 507, dependent conditional: 0, dependent unconditional: 507, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2548, independent: 942, independent conditional: 0, independent unconditional: 942, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 1510, unknown conditional: 0, unknown unconditional: 1510] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1108; [L826] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1108, ((void *)0), P0, ((void *)0))=-2, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1109; [L828] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1109, ((void *)0), P1, ((void *)0))=-1, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t1110; [L830] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1110, ((void *)0), P2, ((void *)0))=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L786] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L786] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 [L794] 3 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 __unbuffered_p2_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 146 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 697 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 611 mSDsluCounter, 285 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 254 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1592 IncrementalHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 31 mSDtfsCounter, 1592 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=378occurred in iteration=9, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 1227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 04:13:09,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aba286b-c7bb-4934-90dc-ab4eefbb8542/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE