./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.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_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/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_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/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_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/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 10a668ec1ea7995e15ba3bf7e664e16993ba1d6d90153ec7cf305acc426b53b6 --- 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 03:50:44,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:50:44,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:50:44,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:50:44,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:50:44,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:50:44,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:50:44,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:50:44,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:50:44,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:50:44,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:50:44,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:50:44,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:50:44,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:50:44,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:50:44,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:50:44,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:50:44,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:50:44,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:50:44,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:50:44,686 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:50:44,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:50:44,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:50:44,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:50:44,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:50:44,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:50:44,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:50:44,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:50:44,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:50:44,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:50:44,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:50:44,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:50:44,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:50:44,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:50:44,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:50:44,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:50:44,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:50:44,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:50:44,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:50:44,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:50:44,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:50:44,723 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 03:50:44,769 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:50:44,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:50:44,770 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:50:44,770 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:50:44,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:50:44,771 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:50:44,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:50:44,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:50:44,772 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:50:44,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:50:44,773 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:50:44,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:50:44,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:50:44,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:50:44,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:50:44,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:50:44,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:50:44,775 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:50:44,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:50:44,775 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:50:44,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:50:44,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:50:44,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:50:44,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:50:44,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:50:44,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:50:44,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:50:44,777 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:50:44,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:50:44,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:50:44,778 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:50:44,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:50:44,779 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:50:44,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:50:44,779 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_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/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_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/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 -> 10a668ec1ea7995e15ba3bf7e664e16993ba1d6d90153ec7cf305acc426b53b6 [2022-11-23 03:50:45,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:50:45,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:50:45,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:50:45,141 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:50:45,142 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:50:45,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i [2022-11-23 03:50:48,228 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:50:48,576 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:50:48,579 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i [2022-11-23 03:50:48,600 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/bin/uautomizer-QkZJyEgLgS/data/1209567ba/9083c3da9a8145d2aeaf1e5369f9f0ff/FLAGa7a2d5abd [2022-11-23 03:50:48,619 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/bin/uautomizer-QkZJyEgLgS/data/1209567ba/9083c3da9a8145d2aeaf1e5369f9f0ff [2022-11-23 03:50:48,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:50:48,624 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:50:48,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:50:48,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:50:48,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:50:48,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:50:48" (1/1) ... [2022-11-23 03:50:48,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e999ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:48, skipping insertion in model container [2022-11-23 03:50:48,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:50:48" (1/1) ... [2022-11-23 03:50:48,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:50:48,709 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:50:48,977 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_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i[959,972] [2022-11-23 03:50:49,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:50:49,344 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:50:49,366 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_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i[959,972] [2022-11-23 03:50:49,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:50:49,497 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:50:49,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:49 WrapperNode [2022-11-23 03:50:49,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:50:49,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:50:49,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:50:49,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:50:49,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:49" (1/1) ... [2022-11-23 03:50:49,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:49" (1/1) ... [2022-11-23 03:50:49,596 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-23 03:50:49,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:50:49,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:50:49,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:50:49,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:50:49,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:49" (1/1) ... [2022-11-23 03:50:49,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:49" (1/1) ... [2022-11-23 03:50:49,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:49" (1/1) ... [2022-11-23 03:50:49,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:49" (1/1) ... [2022-11-23 03:50:49,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:49" (1/1) ... [2022-11-23 03:50:49,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:49" (1/1) ... [2022-11-23 03:50:49,646 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:49" (1/1) ... [2022-11-23 03:50:49,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:49" (1/1) ... [2022-11-23 03:50:49,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:50:49,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:50:49,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:50:49,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:50:49,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:49" (1/1) ... [2022-11-23 03:50:49,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:50:49,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:50:49,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:50:49,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:50:49,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:50:49,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 03:50:49,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:50:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:50:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:50:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 03:50:49,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 03:50:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 03:50:49,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 03:50:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 03:50:49,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 03:50:49,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:50:49,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 03:50:49,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:50:49,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:50:49,761 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 03:50:49,940 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:50:49,942 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:50:50,447 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:50:50,615 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:50:50,615 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 03:50:50,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:50:50 BoogieIcfgContainer [2022-11-23 03:50:50,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:50:50,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:50:50,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:50:50,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:50:50,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:50:48" (1/3) ... [2022-11-23 03:50:50,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a923baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:50:50, skipping insertion in model container [2022-11-23 03:50:50,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:49" (2/3) ... [2022-11-23 03:50:50,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a923baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:50:50, skipping insertion in model container [2022-11-23 03:50:50,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:50:50" (3/3) ... [2022-11-23 03:50:50,634 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.opt_pso.opt.i [2022-11-23 03:50:50,642 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 03:50:50,653 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:50:50,653 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 03:50:50,653 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 03:50:50,719 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 03:50:50,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-11-23 03:50:50,839 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-23 03:50:50,840 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:50:50,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-23 03:50:50,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-11-23 03:50:50,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-11-23 03:50:50,857 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 03:50:50,886 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-11-23 03:50:50,898 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-11-23 03:50:50,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-11-23 03:50:50,960 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-23 03:50:50,961 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:50:50,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-23 03:50:50,968 INFO L119 LiptonReduction]: Number of co-enabled transitions 2082 [2022-11-23 03:50:55,921 INFO L134 LiptonReduction]: Checked pairs total: 5224 [2022-11-23 03:50:55,922 INFO L136 LiptonReduction]: Total number of compositions: 101 [2022-11-23 03:50:55,944 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:50:55,952 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;@2842ac94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:50:55,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-23 03:50:55,956 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-11-23 03:50:55,956 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:50:55,957 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:55,957 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 03:50:55,958 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:50:55,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:55,962 INFO L85 PathProgramCache]: Analyzing trace with hash 473110182, now seen corresponding path program 1 times [2022-11-23 03:50:55,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:55,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930816018] [2022-11-23 03:50:55,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:55,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:56,469 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 03:50:56,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:56,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930816018] [2022-11-23 03:50:56,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930816018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:56,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:56,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:50:56,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436224228] [2022-11-23 03:50:56,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:56,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:50:56,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:56,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:50:56,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:50:56,512 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 216 [2022-11-23 03:50:56,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 03:50:56,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:56,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 216 [2022-11-23 03:50:56,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:56,904 INFO L130 PetriNetUnfolder]: 855/1389 cut-off events. [2022-11-23 03:50:56,904 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-23 03:50:56,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2716 conditions, 1389 events. 855/1389 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7273 event pairs, 141 based on Foata normal form. 0/1320 useless extension candidates. Maximal degree in co-relation 2705. Up to 1027 conditions per place. [2022-11-23 03:50:56,925 INFO L137 encePairwiseOnDemand]: 212/216 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2022-11-23 03:50:56,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 150 flow [2022-11-23 03:50:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:50:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:50:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2022-11-23 03:50:56,958 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2022-11-23 03:50:56,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2022-11-23 03:50:56,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2022-11-23 03:50:56,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:56,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2022-11-23 03:50:56,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 03:50:56,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 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 03:50:56,984 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 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 03:50:56,987 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 339 transitions. [2022-11-23 03:50:56,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 150 flow [2022-11-23 03:50:56,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 03:50:56,993 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2022-11-23 03:50:56,995 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, 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 03:50:56,999 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-11-23 03:50:56,999 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2022-11-23 03:50:57,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 03:50:57,000 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:57,000 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:50:57,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:50:57,001 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:50:57,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:57,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1825098083, now seen corresponding path program 1 times [2022-11-23 03:50:57,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:57,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528728272] [2022-11-23 03:50:57,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:57,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:57,742 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 03:50:57,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:57,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528728272] [2022-11-23 03:50:57,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528728272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:57,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:57,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:50:57,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124256948] [2022-11-23 03:50:57,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:57,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:50:57,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:57,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:50:57,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:50:57,819 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 216 [2022-11-23 03:50:57,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 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 03:50:57,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:57,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 216 [2022-11-23 03:50:57,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:58,247 INFO L130 PetriNetUnfolder]: 935/1428 cut-off events. [2022-11-23 03:50:58,248 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-11-23 03:50:58,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3018 conditions, 1428 events. 935/1428 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6568 event pairs, 207 based on Foata normal form. 80/1503 useless extension candidates. Maximal degree in co-relation 3008. Up to 1025 conditions per place. [2022-11-23 03:50:58,258 INFO L137 encePairwiseOnDemand]: 212/216 looper letters, 26 selfloop transitions, 2 changer transitions 17/47 dead transitions. [2022-11-23 03:50:58,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 200 flow [2022-11-23 03:50:58,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:50:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:50:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-11-23 03:50:58,262 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2022-11-23 03:50:58,262 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2022-11-23 03:50:58,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2022-11-23 03:50:58,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:58,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2022-11-23 03:50:58,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 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 03:50:58,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 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 03:50:58,270 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 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 03:50:58,270 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 5 states and 512 transitions. [2022-11-23 03:50:58,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 200 flow [2022-11-23 03:50:58,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:50:58,274 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 62 flow [2022-11-23 03:50:58,275 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, 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 03:50:58,276 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-11-23 03:50:58,276 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 62 flow [2022-11-23 03:50:58,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 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 03:50:58,277 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:58,277 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:50:58,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:50:58,277 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:50:58,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:58,278 INFO L85 PathProgramCache]: Analyzing trace with hash -743500397, now seen corresponding path program 1 times [2022-11-23 03:50:58,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:58,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662129486] [2022-11-23 03:50:58,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:58,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:58,959 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 03:50:58,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:58,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662129486] [2022-11-23 03:50:58,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662129486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:58,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:58,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:50:58,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299220126] [2022-11-23 03:50:58,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:58,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:50:58,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:58,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:50:58,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:50:59,072 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 216 [2022-11-23 03:50:59,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 0 states have call successors, (0), 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 03:50:59,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:59,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 216 [2022-11-23 03:50:59,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:59,901 INFO L130 PetriNetUnfolder]: 1250/1882 cut-off events. [2022-11-23 03:50:59,902 INFO L131 PetriNetUnfolder]: For 564/564 co-relation queries the response was YES. [2022-11-23 03:50:59,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4192 conditions, 1882 events. 1250/1882 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8874 event pairs, 148 based on Foata normal form. 90/1971 useless extension candidates. Maximal degree in co-relation 4179. Up to 1013 conditions per place. [2022-11-23 03:50:59,916 INFO L137 encePairwiseOnDemand]: 206/216 looper letters, 42 selfloop transitions, 12 changer transitions 29/84 dead transitions. [2022-11-23 03:50:59,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 84 transitions, 374 flow [2022-11-23 03:50:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:50:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 03:50:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 906 transitions. [2022-11-23 03:50:59,920 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4660493827160494 [2022-11-23 03:50:59,921 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 906 transitions. [2022-11-23 03:50:59,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 906 transitions. [2022-11-23 03:50:59,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:59,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 906 transitions. [2022-11-23 03:50:59,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.66666666666667) internal successors, (906), 9 states have internal predecessors, (906), 0 states have call successors, (0), 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 03:50:59,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 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 03:50:59,931 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 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 03:50:59,931 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 62 flow. Second operand 9 states and 906 transitions. [2022-11-23 03:50:59,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 84 transitions, 374 flow [2022-11-23 03:50:59,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 84 transitions, 358 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-23 03:50:59,938 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 159 flow [2022-11-23 03:50:59,939 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, 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=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=159, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-11-23 03:50:59,940 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-11-23 03:50:59,940 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 159 flow [2022-11-23 03:50:59,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 0 states have call successors, (0), 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 03:50:59,941 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:59,941 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:50:59,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:50:59,942 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:50:59,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:59,942 INFO L85 PathProgramCache]: Analyzing trace with hash -793866407, now seen corresponding path program 2 times [2022-11-23 03:50:59,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:59,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222406068] [2022-11-23 03:50:59,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:59,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:00,402 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 03:51:00,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:51:00,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222406068] [2022-11-23 03:51:00,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222406068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:51:00,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:51:00,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:51:00,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725431629] [2022-11-23 03:51:00,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:51:00,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:51:00,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:51:00,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:51:00,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:51:00,493 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 216 [2022-11-23 03:51:00,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 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 03:51:00,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:51:00,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 216 [2022-11-23 03:51:00,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:51:01,057 INFO L130 PetriNetUnfolder]: 1405/2107 cut-off events. [2022-11-23 03:51:01,058 INFO L131 PetriNetUnfolder]: For 3984/3984 co-relation queries the response was YES. [2022-11-23 03:51:01,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7317 conditions, 2107 events. 1405/2107 cut-off events. For 3984/3984 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9865 event pairs, 234 based on Foata normal form. 80/2186 useless extension candidates. Maximal degree in co-relation 7299. Up to 763 conditions per place. [2022-11-23 03:51:01,071 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 35 selfloop transitions, 3 changer transitions 32/71 dead transitions. [2022-11-23 03:51:01,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 481 flow [2022-11-23 03:51:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:51:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 03:51:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 608 transitions. [2022-11-23 03:51:01,074 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2022-11-23 03:51:01,074 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 608 transitions. [2022-11-23 03:51:01,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 608 transitions. [2022-11-23 03:51:01,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:51:01,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 608 transitions. [2022-11-23 03:51:01,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 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 03:51:01,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 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 03:51:01,085 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 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 03:51:01,085 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 159 flow. Second operand 6 states and 608 transitions. [2022-11-23 03:51:01,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 481 flow [2022-11-23 03:51:01,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 71 transitions, 470 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-23 03:51:01,099 INFO L231 Difference]: Finished difference. Result has 47 places, 25 transitions, 132 flow [2022-11-23 03:51:01,099 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=25} [2022-11-23 03:51:01,100 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-11-23 03:51:01,100 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 25 transitions, 132 flow [2022-11-23 03:51:01,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 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 03:51:01,101 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:51:01,101 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:51:01,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:51:01,101 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:51:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:01,102 INFO L85 PathProgramCache]: Analyzing trace with hash 461725165, now seen corresponding path program 1 times [2022-11-23 03:51:01,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:01,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63289158] [2022-11-23 03:51:01,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:01,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:01,969 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 03:51:01,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:51:01,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63289158] [2022-11-23 03:51:01,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63289158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:51:01,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:51:01,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:51:01,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753020601] [2022-11-23 03:51:01,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:51:01,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:51:01,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:51:01,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:51:01,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:51:02,014 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 216 [2022-11-23 03:51:02,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 25 transitions, 132 flow. Second operand has 6 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 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 03:51:02,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:51:02,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 216 [2022-11-23 03:51:02,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:51:02,479 INFO L130 PetriNetUnfolder]: 821/1309 cut-off events. [2022-11-23 03:51:02,480 INFO L131 PetriNetUnfolder]: For 3009/3011 co-relation queries the response was YES. [2022-11-23 03:51:02,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4608 conditions, 1309 events. 821/1309 cut-off events. For 3009/3011 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5567 event pairs, 393 based on Foata normal form. 60/1354 useless extension candidates. Maximal degree in co-relation 4587. Up to 1001 conditions per place. [2022-11-23 03:51:02,492 INFO L137 encePairwiseOnDemand]: 208/216 looper letters, 39 selfloop transitions, 11 changer transitions 14/66 dead transitions. [2022-11-23 03:51:02,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 432 flow [2022-11-23 03:51:02,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:51:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:51:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 749 transitions. [2022-11-23 03:51:02,496 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49537037037037035 [2022-11-23 03:51:02,496 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 749 transitions. [2022-11-23 03:51:02,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 749 transitions. [2022-11-23 03:51:02,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:51:02,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 749 transitions. [2022-11-23 03:51:02,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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 03:51:02,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 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 03:51:02,503 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 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 03:51:02,504 INFO L175 Difference]: Start difference. First operand has 47 places, 25 transitions, 132 flow. Second operand 7 states and 749 transitions. [2022-11-23 03:51:02,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 432 flow [2022-11-23 03:51:02,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 66 transitions, 394 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-11-23 03:51:02,513 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 203 flow [2022-11-23 03:51:02,513 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-11-23 03:51:02,515 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2022-11-23 03:51:02,516 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 203 flow [2022-11-23 03:51:02,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 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 03:51:02,516 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:51:02,517 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:51:02,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:51:02,517 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:51:02,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1311853409, now seen corresponding path program 1 times [2022-11-23 03:51:02,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:02,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908246368] [2022-11-23 03:51:02,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:02,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:02,771 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 03:51:02,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:51:02,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908246368] [2022-11-23 03:51:02,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908246368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:51:02,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:51:02,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:51:02,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025482835] [2022-11-23 03:51:02,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:51:02,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:51:02,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:51:02,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:51:02,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:51:02,790 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 216 [2022-11-23 03:51:02,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 03:51:02,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:51:02,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 216 [2022-11-23 03:51:02,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:51:03,025 INFO L130 PetriNetUnfolder]: 425/712 cut-off events. [2022-11-23 03:51:03,026 INFO L131 PetriNetUnfolder]: For 2252/2282 co-relation queries the response was YES. [2022-11-23 03:51:03,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2895 conditions, 712 events. 425/712 cut-off events. For 2252/2282 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2958 event pairs, 143 based on Foata normal form. 27/723 useless extension candidates. Maximal degree in co-relation 2875. Up to 550 conditions per place. [2022-11-23 03:51:03,033 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 34 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2022-11-23 03:51:03,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 305 flow [2022-11-23 03:51:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:51:03,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:51:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-11-23 03:51:03,037 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5046296296296297 [2022-11-23 03:51:03,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2022-11-23 03:51:03,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2022-11-23 03:51:03,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:51:03,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2022-11-23 03:51:03,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:51:03,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 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 03:51:03,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 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 03:51:03,041 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 203 flow. Second operand 3 states and 327 transitions. [2022-11-23 03:51:03,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 305 flow [2022-11-23 03:51:03,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 295 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-23 03:51:03,046 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 187 flow [2022-11-23 03:51:03,046 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-11-23 03:51:03,049 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-11-23 03:51:03,049 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 187 flow [2022-11-23 03:51:03,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 03:51:03,050 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:51:03,050 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:51:03,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 03:51:03,052 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:51:03,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:03,053 INFO L85 PathProgramCache]: Analyzing trace with hash 971943779, now seen corresponding path program 1 times [2022-11-23 03:51:03,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:03,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123806709] [2022-11-23 03:51:03,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:03,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:03,371 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 03:51:03,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:51:03,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123806709] [2022-11-23 03:51:03,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123806709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:51:03,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:51:03,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:51:03,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243773614] [2022-11-23 03:51:03,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:51:03,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:51:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:51:03,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:51:03,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:51:03,382 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 216 [2022-11-23 03:51:03,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 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 03:51:03,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:51:03,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 216 [2022-11-23 03:51:03,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:51:03,547 INFO L130 PetriNetUnfolder]: 196/369 cut-off events. [2022-11-23 03:51:03,547 INFO L131 PetriNetUnfolder]: For 1129/1131 co-relation queries the response was YES. [2022-11-23 03:51:03,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1585 conditions, 369 events. 196/369 cut-off events. For 1129/1131 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1413 event pairs, 51 based on Foata normal form. 29/392 useless extension candidates. Maximal degree in co-relation 1564. Up to 126 conditions per place. [2022-11-23 03:51:03,551 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 41 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2022-11-23 03:51:03,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 387 flow [2022-11-23 03:51:03,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:51:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:51:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2022-11-23 03:51:03,553 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2022-11-23 03:51:03,553 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 435 transitions. [2022-11-23 03:51:03,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 435 transitions. [2022-11-23 03:51:03,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:51:03,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 435 transitions. [2022-11-23 03:51:03,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:51:03,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 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 03:51:03,557 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 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 03:51:03,558 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 187 flow. Second operand 4 states and 435 transitions. [2022-11-23 03:51:03,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 387 flow [2022-11-23 03:51:03,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 371 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-11-23 03:51:03,561 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 215 flow [2022-11-23 03:51:03,561 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2022-11-23 03:51:03,561 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-11-23 03:51:03,562 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 215 flow [2022-11-23 03:51:03,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 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 03:51:03,562 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:51:03,562 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 03:51:03,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 03:51:03,563 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:51:03,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:03,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1503503163, now seen corresponding path program 1 times [2022-11-23 03:51:03,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:03,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854528628] [2022-11-23 03:51:03,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:03,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:03,828 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 03:51:03,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:51:03,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854528628] [2022-11-23 03:51:03,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854528628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:51:03,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:51:03,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:51:03,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189508954] [2022-11-23 03:51:03,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:51:03,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:51:03,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:51:03,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:51:03,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:51:03,839 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 216 [2022-11-23 03:51:03,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 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 03:51:03,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:51:03,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 216 [2022-11-23 03:51:03,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:51:03,976 INFO L130 PetriNetUnfolder]: 157/292 cut-off events. [2022-11-23 03:51:03,976 INFO L131 PetriNetUnfolder]: For 937/937 co-relation queries the response was YES. [2022-11-23 03:51:03,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 292 events. 157/292 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1074 event pairs, 44 based on Foata normal form. 10/297 useless extension candidates. Maximal degree in co-relation 1227. Up to 126 conditions per place. [2022-11-23 03:51:03,979 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 38 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2022-11-23 03:51:03,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 399 flow [2022-11-23 03:51:03,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:51:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:51:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2022-11-23 03:51:03,982 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4935185185185185 [2022-11-23 03:51:03,982 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 533 transitions. [2022-11-23 03:51:03,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 533 transitions. [2022-11-23 03:51:03,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:51:03,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 533 transitions. [2022-11-23 03:51:03,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 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 03:51:03,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 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 03:51:03,987 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 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 03:51:03,987 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 215 flow. Second operand 5 states and 533 transitions. [2022-11-23 03:51:03,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 399 flow [2022-11-23 03:51:03,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 365 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-11-23 03:51:03,990 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 211 flow [2022-11-23 03:51:03,991 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2022-11-23 03:51:03,991 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2022-11-23 03:51:03,991 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 211 flow [2022-11-23 03:51:03,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 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 03:51:03,992 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:51:03,992 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 03:51:03,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 03:51:03,993 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:51:03,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:03,993 INFO L85 PathProgramCache]: Analyzing trace with hash -482055139, now seen corresponding path program 1 times [2022-11-23 03:51:03,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:03,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002072451] [2022-11-23 03:51:03,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:03,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:04,279 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 03:51:04,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:51:04,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002072451] [2022-11-23 03:51:04,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002072451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:51:04,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:51:04,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:51:04,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206154586] [2022-11-23 03:51:04,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:51:04,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:51:04,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:51:04,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:51:04,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:51:04,297 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 216 [2022-11-23 03:51:04,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 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 03:51:04,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:51:04,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 216 [2022-11-23 03:51:04,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:51:04,489 INFO L130 PetriNetUnfolder]: 193/375 cut-off events. [2022-11-23 03:51:04,490 INFO L131 PetriNetUnfolder]: For 1197/1197 co-relation queries the response was YES. [2022-11-23 03:51:04,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 375 events. 193/375 cut-off events. For 1197/1197 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1460 event pairs, 34 based on Foata normal form. 1/375 useless extension candidates. Maximal degree in co-relation 1607. Up to 222 conditions per place. [2022-11-23 03:51:04,492 INFO L137 encePairwiseOnDemand]: 212/216 looper letters, 36 selfloop transitions, 1 changer transitions 29/68 dead transitions. [2022-11-23 03:51:04,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 566 flow [2022-11-23 03:51:04,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:51:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:51:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 526 transitions. [2022-11-23 03:51:04,496 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48703703703703705 [2022-11-23 03:51:04,496 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 526 transitions. [2022-11-23 03:51:04,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 526 transitions. [2022-11-23 03:51:04,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:51:04,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 526 transitions. [2022-11-23 03:51:04,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 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 03:51:04,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 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 03:51:04,502 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 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 03:51:04,502 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 211 flow. Second operand 5 states and 526 transitions. [2022-11-23 03:51:04,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 566 flow [2022-11-23 03:51:04,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 474 flow, removed 30 selfloop flow, removed 5 redundant places. [2022-11-23 03:51:04,507 INFO L231 Difference]: Finished difference. Result has 51 places, 31 transitions, 159 flow [2022-11-23 03:51:04,507 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=51, PETRI_TRANSITIONS=31} [2022-11-23 03:51:04,508 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-11-23 03:51:04,508 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 159 flow [2022-11-23 03:51:04,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 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 03:51:04,511 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:51:04,511 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 03:51:04,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 03:51:04,513 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:51:04,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:04,513 INFO L85 PathProgramCache]: Analyzing trace with hash -323375645, now seen corresponding path program 2 times [2022-11-23 03:51:04,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:04,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22312801] [2022-11-23 03:51:04,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:04,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:04,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:51:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:04,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:51:04,677 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 03:51:04,679 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-23 03:51:04,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-23 03:51:04,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-23 03:51:04,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-23 03:51:04,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-23 03:51:04,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-23 03:51:04,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 03:51:04,684 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-11-23 03:51:04,692 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 03:51:04,692 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:51:04,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:51:04 BasicIcfg [2022-11-23 03:51:04,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:51:04,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:51:04,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:51:04,804 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:51:04,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:50:50" (3/4) ... [2022-11-23 03:51:04,807 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 03:51:04,914 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 03:51:04,914 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:51:04,915 INFO L158 Benchmark]: Toolchain (without parser) took 16290.80ms. Allocated memory was 130.0MB in the beginning and 306.2MB in the end (delta: 176.2MB). Free memory was 98.0MB in the beginning and 241.5MB in the end (delta: -143.6MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2022-11-23 03:51:04,915 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 96.5MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:51:04,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 872.10ms. Allocated memory is still 130.0MB. Free memory was 98.0MB in the beginning and 74.5MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 03:51:04,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.85ms. Allocated memory is still 130.0MB. Free memory was 74.5MB in the beginning and 72.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:51:04,916 INFO L158 Benchmark]: Boogie Preprocessor took 55.20ms. Allocated memory is still 130.0MB. Free memory was 72.0MB in the beginning and 69.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:51:04,916 INFO L158 Benchmark]: RCFGBuilder took 964.67ms. Allocated memory is still 130.0MB. Free memory was 69.9MB in the beginning and 73.3MB in the end (delta: -3.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-11-23 03:51:04,917 INFO L158 Benchmark]: TraceAbstraction took 14180.07ms. Allocated memory was 130.0MB in the beginning and 306.2MB in the end (delta: 176.2MB). Free memory was 72.4MB in the beginning and 252.0MB in the end (delta: -179.6MB). Peak memory consumption was 163.0MB. Max. memory is 16.1GB. [2022-11-23 03:51:04,917 INFO L158 Benchmark]: Witness Printer took 110.13ms. Allocated memory is still 306.2MB. Free memory was 252.0MB in the beginning and 241.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 03:51:04,919 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.33ms. Allocated memory is still 96.5MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 872.10ms. Allocated memory is still 130.0MB. Free memory was 98.0MB in the beginning and 74.5MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.85ms. Allocated memory is still 130.0MB. Free memory was 74.5MB in the beginning and 72.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.20ms. Allocated memory is still 130.0MB. Free memory was 72.0MB in the beginning and 69.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 964.67ms. Allocated memory is still 130.0MB. Free memory was 69.9MB in the beginning and 73.3MB in the end (delta: -3.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14180.07ms. Allocated memory was 130.0MB in the beginning and 306.2MB in the end (delta: 176.2MB). Free memory was 72.4MB in the beginning and 252.0MB in the end (delta: -179.6MB). Peak memory consumption was 163.0MB. Max. memory is 16.1GB. * Witness Printer took 110.13ms. Allocated memory is still 306.2MB. Free memory was 252.0MB in the beginning and 241.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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.0s, 120 PlacesBefore, 34 PlacesAfterwards, 112 TransitionsBefore, 25 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, 5224 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2569, independent: 2420, independent conditional: 0, independent unconditional: 2420, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1491, independent: 1442, independent conditional: 0, independent unconditional: 1442, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1491, independent: 1423, independent conditional: 0, independent unconditional: 1423, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 362, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 339, dependent conditional: 0, dependent unconditional: 339, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2569, independent: 978, independent conditional: 0, independent unconditional: 978, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 1491, unknown conditional: 0, unknown unconditional: 1491] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t2284; [L821] FCALL, FORK 0 pthread_create(&t2284, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2284, ((void *)0), P0, ((void *)0))=-2, t2284={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2285; [L823] FCALL, FORK 0 pthread_create(&t2285, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2285, ((void *)0), P1, ((void *)0))=-1, t2284={5:0}, t2285={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t2286; [L825] FCALL, FORK 0 pthread_create(&t2286, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2286, ((void *)0), P2, ((void *)0))=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L795] 3 __unbuffered_p2_EBX = z VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] 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_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=1, unknown-#in~expression-unknown=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, 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: 823]: 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: 821]: 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: 825]: 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, 142 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: 13.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 450 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 348 mSDsluCounter, 285 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 251 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 911 IncrementalHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 34 mSDtfsCounter, 911 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=7, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 786 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 03:51:04,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bc8637e-7c91-4ac7-a9a6-335f1b2828bc/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