./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011.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_a5992f1e-42fe-4fba-a01c-a369b21177a3/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5992f1e-42fe-4fba-a01c-a369b21177a3/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_a5992f1e-42fe-4fba-a01c-a369b21177a3/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5992f1e-42fe-4fba-a01c-a369b21177a3/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5992f1e-42fe-4fba-a01c-a369b21177a3/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_a5992f1e-42fe-4fba-a01c-a369b21177a3/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 bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c --- 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 02:25:41,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:25:41,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:25:41,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:25:41,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:25:41,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:25:41,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:25:41,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:25:41,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:25:41,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:25:41,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:25:41,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:25:41,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:25:41,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:25:41,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:25:41,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:25:41,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:25:41,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:25:41,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:25:41,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:25:41,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:25:41,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:25:41,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:25:41,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:25:41,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:25:41,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:25:41,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:25:41,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:25:41,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:25:41,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:25:41,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:25:41,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:25:41,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:25:41,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:25:41,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:25:41,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:25:41,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:25:41,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:25:41,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:25:41,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:25:41,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:25:41,905 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5992f1e-42fe-4fba-a01c-a369b21177a3/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 02:25:41,947 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:25:41,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:25:41,953 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:25:41,953 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:25:41,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:25:41,955 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:25:41,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:25:41,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:25:41,956 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:25:41,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:25:41,958 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:25:41,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:25:41,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:25:41,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:25:41,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 02:25:41,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:25:41,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 02:25:41,960 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:25:41,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 02:25:41,961 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:25:41,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 02:25:41,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:25:41,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:25:41,962 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:25:41,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:25:41,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:25:41,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:25:41,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 02:25:41,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:25:41,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:25:41,965 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:25:41,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 02:25:41,966 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:25:41,966 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:25:41,966 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_a5992f1e-42fe-4fba-a01c-a369b21177a3/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_a5992f1e-42fe-4fba-a01c-a369b21177a3/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 -> bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c [2022-11-23 02:25:42,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:25:42,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:25:42,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:25:42,454 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:25:42,455 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:25:42,456 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5992f1e-42fe-4fba-a01c-a369b21177a3/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix011.opt.i [2022-11-23 02:25:46,155 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:25:46,547 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:25:46,548 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5992f1e-42fe-4fba-a01c-a369b21177a3/sv-benchmarks/c/pthread-wmm/mix011.opt.i [2022-11-23 02:25:46,579 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5992f1e-42fe-4fba-a01c-a369b21177a3/bin/uautomizer-QkZJyEgLgS/data/2563d0ffe/9b04deecfa2d4d8388162f8545dfe730/FLAG310746b2b [2022-11-23 02:25:46,605 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5992f1e-42fe-4fba-a01c-a369b21177a3/bin/uautomizer-QkZJyEgLgS/data/2563d0ffe/9b04deecfa2d4d8388162f8545dfe730 [2022-11-23 02:25:46,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:25:46,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:25:46,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:25:46,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:25:46,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:25:46,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:25:46" (1/1) ... [2022-11-23 02:25:46,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa51ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:46, skipping insertion in model container [2022-11-23 02:25:46,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:25:46" (1/1) ... [2022-11-23 02:25:46,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:25:46,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:25:47,019 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_a5992f1e-42fe-4fba-a01c-a369b21177a3/sv-benchmarks/c/pthread-wmm/mix011.opt.i[944,957] [2022-11-23 02:25:47,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:25:47,413 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:25:47,434 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_a5992f1e-42fe-4fba-a01c-a369b21177a3/sv-benchmarks/c/pthread-wmm/mix011.opt.i[944,957] [2022-11-23 02:25:47,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:25:47,531 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:25:47,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:47 WrapperNode [2022-11-23 02:25:47,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:25:47,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:25:47,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:25:47,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:25:47,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:47" (1/1) ... [2022-11-23 02:25:47,566 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:47" (1/1) ... [2022-11-23 02:25:47,595 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2022-11-23 02:25:47,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:25:47,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:25:47,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:25:47,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:25:47,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:47" (1/1) ... [2022-11-23 02:25:47,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:47" (1/1) ... [2022-11-23 02:25:47,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:47" (1/1) ... [2022-11-23 02:25:47,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:47" (1/1) ... [2022-11-23 02:25:47,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:47" (1/1) ... [2022-11-23 02:25:47,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:47" (1/1) ... [2022-11-23 02:25:47,624 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:47" (1/1) ... [2022-11-23 02:25:47,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:47" (1/1) ... [2022-11-23 02:25:47,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:25:47,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:25:47,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:25:47,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:25:47,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:47" (1/1) ... [2022-11-23 02:25:47,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:25:47,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5992f1e-42fe-4fba-a01c-a369b21177a3/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:25:47,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5992f1e-42fe-4fba-a01c-a369b21177a3/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:25:47,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5992f1e-42fe-4fba-a01c-a369b21177a3/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:25:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 02:25:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 02:25:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:25:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:25:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:25:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 02:25:47,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 02:25:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 02:25:47,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 02:25:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 02:25:47,752 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 02:25:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:25:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 02:25:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:25:47,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:25:47,754 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 02:25:47,934 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:25:47,937 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:25:48,531 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:25:48,751 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:25:48,751 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 02:25:48,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:25:48 BoogieIcfgContainer [2022-11-23 02:25:48,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:25:48,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:25:48,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:25:48,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:25:48,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:25:46" (1/3) ... [2022-11-23 02:25:48,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3451f1ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:25:48, skipping insertion in model container [2022-11-23 02:25:48,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:47" (2/3) ... [2022-11-23 02:25:48,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3451f1ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:25:48, skipping insertion in model container [2022-11-23 02:25:48,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:25:48" (3/3) ... [2022-11-23 02:25:48,768 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011.opt.i [2022-11-23 02:25:48,779 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 02:25:48,794 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:25:48,795 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 02:25:48,795 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 02:25:48,867 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 02:25:48,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2022-11-23 02:25:48,993 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2022-11-23 02:25:48,993 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:25:49,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-23 02:25:49,001 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2022-11-23 02:25:49,007 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2022-11-23 02:25:49,011 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 02:25:49,040 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow [2022-11-23 02:25:49,051 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow [2022-11-23 02:25:49,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow [2022-11-23 02:25:49,112 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2022-11-23 02:25:49,112 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:25:49,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-23 02:25:49,116 INFO L119 LiptonReduction]: Number of co-enabled transitions 2146 [2022-11-23 02:25:54,854 INFO L134 LiptonReduction]: Checked pairs total: 5194 [2022-11-23 02:25:54,855 INFO L136 LiptonReduction]: Total number of compositions: 105 [2022-11-23 02:25:54,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:25:54,879 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;@58e72bed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:25:54,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-23 02:25:54,887 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-11-23 02:25:54,887 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:25:54,887 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:25:54,888 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:25:54,889 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:25:54,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:25:54,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1706195468, now seen corresponding path program 1 times [2022-11-23 02:25:54,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:25:54,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241398932] [2022-11-23 02:25:54,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:25:54,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:25:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:25:55,528 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 02:25:55,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:25:55,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241398932] [2022-11-23 02:25:55,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241398932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:25:55,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:25:55,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:25:55,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305103393] [2022-11-23 02:25:55,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:25:55,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:25:55,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:25:55,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:25:55,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:25:55,585 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 224 [2022-11-23 02:25:55,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 02:25:55,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:25:55,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 224 [2022-11-23 02:25:55,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:25:56,053 INFO L130 PetriNetUnfolder]: 994/1573 cut-off events. [2022-11-23 02:25:56,053 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-23 02:25:56,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3097 conditions, 1573 events. 994/1573 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7656 event pairs, 166 based on Foata normal form. 0/1497 useless extension candidates. Maximal degree in co-relation 3086. Up to 1189 conditions per place. [2022-11-23 02:25:56,072 INFO L137 encePairwiseOnDemand]: 220/224 looper letters, 28 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2022-11-23 02:25:56,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 141 flow [2022-11-23 02:25:56,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:25:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:25:56,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2022-11-23 02:25:56,090 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5252976190476191 [2022-11-23 02:25:56,091 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2022-11-23 02:25:56,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2022-11-23 02:25:56,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:25:56,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2022-11-23 02:25:56,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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 02:25:56,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 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 02:25:56,108 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 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 02:25:56,111 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 353 transitions. [2022-11-23 02:25:56,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 141 flow [2022-11-23 02:25:56,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 02:25:56,118 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2022-11-23 02:25:56,121 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, 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 02:25:56,125 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-11-23 02:25:56,125 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2022-11-23 02:25:56,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 02:25:56,126 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:25:56,126 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:25:56,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:25:56,127 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:25:56,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:25:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1666533434, now seen corresponding path program 1 times [2022-11-23 02:25:56,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:25:56,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503393568] [2022-11-23 02:25:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:25:56,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:25:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:25:56,453 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 02:25:56,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:25:56,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503393568] [2022-11-23 02:25:56,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503393568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:25:56,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:25:56,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:25:56,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641009373] [2022-11-23 02:25:56,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:25:56,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:25:56,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:25:56,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:25:56,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:25:56,504 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 224 [2022-11-23 02:25:56,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 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 02:25:56,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:25:56,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 224 [2022-11-23 02:25:56,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:25:57,305 INFO L130 PetriNetUnfolder]: 2125/3230 cut-off events. [2022-11-23 02:25:57,305 INFO L131 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES. [2022-11-23 02:25:57,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6690 conditions, 3230 events. 2125/3230 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 15943 event pairs, 691 based on Foata normal form. 176/3406 useless extension candidates. Maximal degree in co-relation 6680. Up to 2003 conditions per place. [2022-11-23 02:25:57,329 INFO L137 encePairwiseOnDemand]: 215/224 looper letters, 32 selfloop transitions, 7 changer transitions 25/64 dead transitions. [2022-11-23 02:25:57,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 64 transitions, 274 flow [2022-11-23 02:25:57,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:25:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:25:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2022-11-23 02:25:57,339 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4919642857142857 [2022-11-23 02:25:57,340 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2022-11-23 02:25:57,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2022-11-23 02:25:57,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:25:57,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2022-11-23 02:25:57,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:25:57,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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 02:25:57,353 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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 02:25:57,354 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 5 states and 551 transitions. [2022-11-23 02:25:57,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 64 transitions, 274 flow [2022-11-23 02:25:57,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 64 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:25:57,360 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 120 flow [2022-11-23 02:25:57,360 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2022-11-23 02:25:57,362 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-11-23 02:25:57,362 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 120 flow [2022-11-23 02:25:57,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 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 02:25:57,363 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:25:57,363 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:25:57,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:25:57,364 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:25:57,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:25:57,365 INFO L85 PathProgramCache]: Analyzing trace with hash -122955932, now seen corresponding path program 1 times [2022-11-23 02:25:57,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:25:57,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796644988] [2022-11-23 02:25:57,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:25:57,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:25:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:25:57,614 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 02:25:57,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:25:57,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796644988] [2022-11-23 02:25:57,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796644988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:25:57,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:25:57,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:25:57,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316462945] [2022-11-23 02:25:57,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:25:57,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:25:57,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:25:57,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:25:57,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:25:57,651 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 224 [2022-11-23 02:25:57,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 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 02:25:57,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:25:57,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 224 [2022-11-23 02:25:57,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:25:58,310 INFO L130 PetriNetUnfolder]: 1811/2788 cut-off events. [2022-11-23 02:25:58,311 INFO L131 PetriNetUnfolder]: For 1954/1954 co-relation queries the response was YES. [2022-11-23 02:25:58,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7934 conditions, 2788 events. 1811/2788 cut-off events. For 1954/1954 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13767 event pairs, 369 based on Foata normal form. 168/2956 useless extension candidates. Maximal degree in co-relation 7920. Up to 1305 conditions per place. [2022-11-23 02:25:58,332 INFO L137 encePairwiseOnDemand]: 216/224 looper letters, 45 selfloop transitions, 7 changer transitions 33/85 dead transitions. [2022-11-23 02:25:58,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 85 transitions, 498 flow [2022-11-23 02:25:58,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:25:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:25:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 758 transitions. [2022-11-23 02:25:58,335 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48341836734693877 [2022-11-23 02:25:58,335 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 758 transitions. [2022-11-23 02:25:58,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 758 transitions. [2022-11-23 02:25:58,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:25:58,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 758 transitions. [2022-11-23 02:25:58,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:25:58,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 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 02:25:58,344 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 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 02:25:58,344 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 120 flow. Second operand 7 states and 758 transitions. [2022-11-23 02:25:58,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 85 transitions, 498 flow [2022-11-23 02:25:58,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 85 transitions, 456 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-23 02:25:58,366 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 164 flow [2022-11-23 02:25:58,366 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=164, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2022-11-23 02:25:58,368 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-11-23 02:25:58,368 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 164 flow [2022-11-23 02:25:58,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 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 02:25:58,369 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:25:58,369 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:25:58,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 02:25:58,371 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:25:58,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:25:58,372 INFO L85 PathProgramCache]: Analyzing trace with hash -356019408, now seen corresponding path program 1 times [2022-11-23 02:25:58,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:25:58,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918427019] [2022-11-23 02:25:58,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:25:58,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:25:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:25:58,589 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 02:25:58,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:25:58,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918427019] [2022-11-23 02:25:58,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918427019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:25:58,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:25:58,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:25:58,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905687561] [2022-11-23 02:25:58,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:25:58,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:25:58,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:25:58,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:25:58,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:25:58,619 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 224 [2022-11-23 02:25:58,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 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 02:25:58,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:25:58,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 224 [2022-11-23 02:25:58,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:25:59,193 INFO L130 PetriNetUnfolder]: 1551/2396 cut-off events. [2022-11-23 02:25:59,194 INFO L131 PetriNetUnfolder]: For 4017/4017 co-relation queries the response was YES. [2022-11-23 02:25:59,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7376 conditions, 2396 events. 1551/2396 cut-off events. For 4017/4017 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10993 event pairs, 403 based on Foata normal form. 108/2504 useless extension candidates. Maximal degree in co-relation 7356. Up to 1147 conditions per place. [2022-11-23 02:25:59,215 INFO L137 encePairwiseOnDemand]: 215/224 looper letters, 39 selfloop transitions, 11 changer transitions 24/74 dead transitions. [2022-11-23 02:25:59,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 74 transitions, 500 flow [2022-11-23 02:25:59,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:25:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:25:59,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 746 transitions. [2022-11-23 02:25:59,219 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.475765306122449 [2022-11-23 02:25:59,219 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 746 transitions. [2022-11-23 02:25:59,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 746 transitions. [2022-11-23 02:25:59,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:25:59,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 746 transitions. [2022-11-23 02:25:59,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 0 states have call successors, (0), 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 02:25:59,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 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 02:25:59,229 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 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 02:25:59,230 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 164 flow. Second operand 7 states and 746 transitions. [2022-11-23 02:25:59,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 74 transitions, 500 flow [2022-11-23 02:25:59,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 74 transitions, 479 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-23 02:25:59,245 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 252 flow [2022-11-23 02:25:59,245 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2022-11-23 02:25:59,246 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-11-23 02:25:59,247 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 252 flow [2022-11-23 02:25:59,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 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 02:25:59,247 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:25:59,248 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:25:59,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 02:25:59,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:25:59,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:25:59,249 INFO L85 PathProgramCache]: Analyzing trace with hash 657903269, now seen corresponding path program 1 times [2022-11-23 02:25:59,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:25:59,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859064278] [2022-11-23 02:25:59,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:25:59,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:25:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:25:59,564 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 02:25:59,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:25:59,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859064278] [2022-11-23 02:25:59,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859064278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:25:59,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:25:59,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:25:59,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635299733] [2022-11-23 02:25:59,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:25:59,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:25:59,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:25:59,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:25:59,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:25:59,583 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 224 [2022-11-23 02:25:59,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 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 02:25:59,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:25:59,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 224 [2022-11-23 02:25:59,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:26:00,020 INFO L130 PetriNetUnfolder]: 898/1505 cut-off events. [2022-11-23 02:26:00,020 INFO L131 PetriNetUnfolder]: For 3416/3512 co-relation queries the response was YES. [2022-11-23 02:26:00,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5003 conditions, 1505 events. 898/1505 cut-off events. For 3416/3512 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7737 event pairs, 179 based on Foata normal form. 160/1630 useless extension candidates. Maximal degree in co-relation 4978. Up to 625 conditions per place. [2022-11-23 02:26:00,036 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 64 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2022-11-23 02:26:00,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 77 transitions, 650 flow [2022-11-23 02:26:00,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:26:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:26:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2022-11-23 02:26:00,039 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5033482142857143 [2022-11-23 02:26:00,039 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2022-11-23 02:26:00,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2022-11-23 02:26:00,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:26:00,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2022-11-23 02:26:00,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 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 02:26:00,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 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 02:26:00,045 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 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 02:26:00,045 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 252 flow. Second operand 4 states and 451 transitions. [2022-11-23 02:26:00,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 77 transitions, 650 flow [2022-11-23 02:26:00,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 77 transitions, 628 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-23 02:26:00,054 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 274 flow [2022-11-23 02:26:00,055 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2022-11-23 02:26:00,056 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2022-11-23 02:26:00,056 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 274 flow [2022-11-23 02:26:00,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 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 02:26:00,057 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:26:00,057 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:26:00,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 02:26:00,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:26:00,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:26:00,058 INFO L85 PathProgramCache]: Analyzing trace with hash 225951132, now seen corresponding path program 1 times [2022-11-23 02:26:00,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:26:00,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007153210] [2022-11-23 02:26:00,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:26:00,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:26:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:26:00,395 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 02:26:00,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:26:00,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007153210] [2022-11-23 02:26:00,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007153210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:26:00,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:26:00,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:26:00,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380073799] [2022-11-23 02:26:00,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:26:00,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:26:00,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:26:00,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:26:00,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:26:00,417 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 224 [2022-11-23 02:26:00,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:26:00,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:26:00,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 224 [2022-11-23 02:26:00,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:26:00,804 INFO L130 PetriNetUnfolder]: 680/1192 cut-off events. [2022-11-23 02:26:00,804 INFO L131 PetriNetUnfolder]: For 2679/2770 co-relation queries the response was YES. [2022-11-23 02:26:00,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4631 conditions, 1192 events. 680/1192 cut-off events. For 2679/2770 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6089 event pairs, 163 based on Foata normal form. 111/1276 useless extension candidates. Maximal degree in co-relation 4606. Up to 488 conditions per place. [2022-11-23 02:26:00,815 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 74 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2022-11-23 02:26:00,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 90 transitions, 755 flow [2022-11-23 02:26:00,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:26:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:26:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-11-23 02:26:00,819 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5044642857142857 [2022-11-23 02:26:00,819 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 565 transitions. [2022-11-23 02:26:00,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 565 transitions. [2022-11-23 02:26:00,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:26:00,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 565 transitions. [2022-11-23 02:26:00,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 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 02:26:00,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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 02:26:00,826 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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 02:26:00,826 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 274 flow. Second operand 5 states and 565 transitions. [2022-11-23 02:26:00,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 90 transitions, 755 flow [2022-11-23 02:26:00,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 746 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-23 02:26:00,834 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 322 flow [2022-11-23 02:26:00,835 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2022-11-23 02:26:00,836 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2022-11-23 02:26:00,836 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 322 flow [2022-11-23 02:26:00,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:26:00,837 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:26:00,837 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:26:00,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 02:26:00,838 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:26:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:26:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash 560174298, now seen corresponding path program 1 times [2022-11-23 02:26:00,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:26:00,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778003995] [2022-11-23 02:26:00,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:26:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:26:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:26:01,272 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 02:26:01,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:26:01,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778003995] [2022-11-23 02:26:01,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778003995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:26:01,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:26:01,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:26:01,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319062251] [2022-11-23 02:26:01,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:26:01,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:26:01,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:26:01,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:26:01,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:26:01,291 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 224 [2022-11-23 02:26:01,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 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 02:26:01,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:26:01,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 224 [2022-11-23 02:26:01,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:26:01,680 INFO L130 PetriNetUnfolder]: 642/1116 cut-off events. [2022-11-23 02:26:01,680 INFO L131 PetriNetUnfolder]: For 3626/3730 co-relation queries the response was YES. [2022-11-23 02:26:01,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4780 conditions, 1116 events. 642/1116 cut-off events. For 3626/3730 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5671 event pairs, 160 based on Foata normal form. 58/1148 useless extension candidates. Maximal degree in co-relation 4754. Up to 488 conditions per place. [2022-11-23 02:26:01,689 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 57 selfloop transitions, 11 changer transitions 1/77 dead transitions. [2022-11-23 02:26:01,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 77 transitions, 675 flow [2022-11-23 02:26:01,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:26:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:26:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 657 transitions. [2022-11-23 02:26:01,692 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4888392857142857 [2022-11-23 02:26:01,692 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 657 transitions. [2022-11-23 02:26:01,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 657 transitions. [2022-11-23 02:26:01,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:26:01,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 657 transitions. [2022-11-23 02:26:01,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 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 02:26:01,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 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 02:26:01,700 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 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 02:26:01,700 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 322 flow. Second operand 6 states and 657 transitions. [2022-11-23 02:26:01,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 77 transitions, 675 flow [2022-11-23 02:26:01,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 638 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-23 02:26:01,708 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 340 flow [2022-11-23 02:26:01,709 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=340, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-11-23 02:26:01,710 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2022-11-23 02:26:01,710 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 340 flow [2022-11-23 02:26:01,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 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 02:26:01,711 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:26:01,711 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 02:26:01,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 02:26:01,711 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:26:01,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:26:01,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1396727921, now seen corresponding path program 1 times [2022-11-23 02:26:01,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:26:01,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827300609] [2022-11-23 02:26:01,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:26:01,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:26:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:26:02,031 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 02:26:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:26:02,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827300609] [2022-11-23 02:26:02,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827300609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:26:02,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:26:02,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:26:02,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977392709] [2022-11-23 02:26:02,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:26:02,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:26:02,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:26:02,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:26:02,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:26:02,078 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 224 [2022-11-23 02:26:02,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 340 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 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 02:26:02,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:26:02,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 224 [2022-11-23 02:26:02,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:26:02,649 INFO L130 PetriNetUnfolder]: 930/1589 cut-off events. [2022-11-23 02:26:02,649 INFO L131 PetriNetUnfolder]: For 5881/5881 co-relation queries the response was YES. [2022-11-23 02:26:02,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7091 conditions, 1589 events. 930/1589 cut-off events. For 5881/5881 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8132 event pairs, 123 based on Foata normal form. 1/1590 useless extension candidates. Maximal degree in co-relation 7065. Up to 758 conditions per place. [2022-11-23 02:26:02,662 INFO L137 encePairwiseOnDemand]: 214/224 looper letters, 51 selfloop transitions, 20 changer transitions 23/94 dead transitions. [2022-11-23 02:26:02,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 94 transitions, 846 flow [2022-11-23 02:26:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:26:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:26:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 630 transitions. [2022-11-23 02:26:02,665 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-11-23 02:26:02,666 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 630 transitions. [2022-11-23 02:26:02,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 630 transitions. [2022-11-23 02:26:02,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:26:02,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 630 transitions. [2022-11-23 02:26:02,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 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 02:26:02,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 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 02:26:02,673 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 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 02:26:02,673 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 340 flow. Second operand 6 states and 630 transitions. [2022-11-23 02:26:02,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 94 transitions, 846 flow [2022-11-23 02:26:02,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 768 flow, removed 25 selfloop flow, removed 4 redundant places. [2022-11-23 02:26:02,697 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 422 flow [2022-11-23 02:26:02,698 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=422, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2022-11-23 02:26:02,698 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2022-11-23 02:26:02,699 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 422 flow [2022-11-23 02:26:02,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 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 02:26:02,700 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:26:02,700 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 02:26:02,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 02:26:02,700 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:26:02,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:26:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2068943857, now seen corresponding path program 2 times [2022-11-23 02:26:02,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:26:02,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127699929] [2022-11-23 02:26:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:26:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:26:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:26:03,037 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 02:26:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:26:03,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127699929] [2022-11-23 02:26:03,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127699929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:26:03,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:26:03,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:26:03,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668194644] [2022-11-23 02:26:03,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:26:03,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:26:03,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:26:03,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:26:03,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:26:03,086 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 224 [2022-11-23 02:26:03,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 422 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 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 02:26:03,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:26:03,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 224 [2022-11-23 02:26:03,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:26:03,483 INFO L130 PetriNetUnfolder]: 421/780 cut-off events. [2022-11-23 02:26:03,483 INFO L131 PetriNetUnfolder]: For 3170/3170 co-relation queries the response was YES. [2022-11-23 02:26:03,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3747 conditions, 780 events. 421/780 cut-off events. For 3170/3170 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3591 event pairs, 56 based on Foata normal form. 1/781 useless extension candidates. Maximal degree in co-relation 3727. Up to 280 conditions per place. [2022-11-23 02:26:03,490 INFO L137 encePairwiseOnDemand]: 214/224 looper letters, 37 selfloop transitions, 9 changer transitions 56/102 dead transitions. [2022-11-23 02:26:03,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 102 transitions, 988 flow [2022-11-23 02:26:03,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:26:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:26:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 733 transitions. [2022-11-23 02:26:03,494 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4674744897959184 [2022-11-23 02:26:03,494 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 733 transitions. [2022-11-23 02:26:03,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 733 transitions. [2022-11-23 02:26:03,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:26:03,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 733 transitions. [2022-11-23 02:26:03,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 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 02:26:03,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 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 02:26:03,502 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 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 02:26:03,503 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 422 flow. Second operand 7 states and 733 transitions. [2022-11-23 02:26:03,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 102 transitions, 988 flow [2022-11-23 02:26:03,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 102 transitions, 817 flow, removed 21 selfloop flow, removed 10 redundant places. [2022-11-23 02:26:03,518 INFO L231 Difference]: Finished difference. Result has 56 places, 34 transitions, 223 flow [2022-11-23 02:26:03,518 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=56, PETRI_TRANSITIONS=34} [2022-11-23 02:26:03,519 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2022-11-23 02:26:03,519 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 34 transitions, 223 flow [2022-11-23 02:26:03,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 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 02:26:03,520 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:26:03,520 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 02:26:03,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 02:26:03,521 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:26:03,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:26:03,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2004177717, now seen corresponding path program 3 times [2022-11-23 02:26:03,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:26:03,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890432717] [2022-11-23 02:26:03,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:26:03,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:26:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:26:03,818 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 02:26:03,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:26:03,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890432717] [2022-11-23 02:26:03,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890432717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:26:03,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:26:03,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:26:03,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173386218] [2022-11-23 02:26:03,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:26:03,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:26:03,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:26:03,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:26:03,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:26:03,853 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 224 [2022-11-23 02:26:03,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 34 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 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 02:26:03,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:26:03,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 224 [2022-11-23 02:26:03,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:26:04,053 INFO L130 PetriNetUnfolder]: 174/358 cut-off events. [2022-11-23 02:26:04,053 INFO L131 PetriNetUnfolder]: For 1232/1232 co-relation queries the response was YES. [2022-11-23 02:26:04,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 358 events. 174/358 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1448 event pairs, 67 based on Foata normal form. 1/359 useless extension candidates. Maximal degree in co-relation 1447. Up to 223 conditions per place. [2022-11-23 02:26:04,056 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 29 selfloop transitions, 4 changer transitions 18/51 dead transitions. [2022-11-23 02:26:04,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 51 transitions, 388 flow [2022-11-23 02:26:04,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:26:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:26:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 523 transitions. [2022-11-23 02:26:04,059 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4669642857142857 [2022-11-23 02:26:04,060 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 523 transitions. [2022-11-23 02:26:04,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 523 transitions. [2022-11-23 02:26:04,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:26:04,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 523 transitions. [2022-11-23 02:26:04,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 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 02:26:04,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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 02:26:04,066 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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 02:26:04,066 INFO L175 Difference]: Start difference. First operand has 56 places, 34 transitions, 223 flow. Second operand 5 states and 523 transitions. [2022-11-23 02:26:04,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 51 transitions, 388 flow [2022-11-23 02:26:04,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 313 flow, removed 9 selfloop flow, removed 13 redundant places. [2022-11-23 02:26:04,071 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 128 flow [2022-11-23 02:26:04,071 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2022-11-23 02:26:04,072 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-11-23 02:26:04,072 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 128 flow [2022-11-23 02:26:04,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 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 02:26:04,073 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:26:04,073 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 02:26:04,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 02:26:04,074 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:26:04,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:26:04,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1394040459, now seen corresponding path program 4 times [2022-11-23 02:26:04,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:26:04,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337453857] [2022-11-23 02:26:04,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:26:04,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:26:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:26:04,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:26:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:26:04,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:26:04,248 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:26:04,249 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-23 02:26:04,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-23 02:26:04,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-23 02:26:04,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-23 02:26:04,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-23 02:26:04,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-23 02:26:04,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 02:26:04,253 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:26:04,261 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 02:26:04,261 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:26:04,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:26:04 BasicIcfg [2022-11-23 02:26:04,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:26:04,397 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:26:04,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:26:04,397 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:26:04,398 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:25:48" (3/4) ... [2022-11-23 02:26:04,400 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 02:26:04,504 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5992f1e-42fe-4fba-a01c-a369b21177a3/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 02:26:04,505 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:26:04,506 INFO L158 Benchmark]: Toolchain (without parser) took 17891.95ms. Allocated memory was 157.3MB in the beginning and 276.8MB in the end (delta: 119.5MB). Free memory was 117.6MB in the beginning and 195.1MB in the end (delta: -77.5MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2022-11-23 02:26:04,507 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 111.1MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:26:04,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 911.33ms. Allocated memory is still 157.3MB. Free memory was 117.6MB in the beginning and 110.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-23 02:26:04,508 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.77ms. Allocated memory is still 157.3MB. Free memory was 110.3MB in the beginning and 108.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:26:04,508 INFO L158 Benchmark]: Boogie Preprocessor took 42.36ms. Allocated memory is still 157.3MB. Free memory was 108.2MB in the beginning and 105.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:26:04,508 INFO L158 Benchmark]: RCFGBuilder took 1116.10ms. Allocated memory is still 157.3MB. Free memory was 105.8MB in the beginning and 68.3MB in the end (delta: 37.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-23 02:26:04,509 INFO L158 Benchmark]: TraceAbstraction took 15637.72ms. Allocated memory was 157.3MB in the beginning and 276.8MB in the end (delta: 119.5MB). Free memory was 67.7MB in the beginning and 206.7MB in the end (delta: -139.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:26:04,510 INFO L158 Benchmark]: Witness Printer took 108.00ms. Allocated memory is still 276.8MB. Free memory was 206.7MB in the beginning and 195.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 02:26:04,512 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.23ms. Allocated memory is still 111.1MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 911.33ms. Allocated memory is still 157.3MB. Free memory was 117.6MB in the beginning and 110.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.77ms. Allocated memory is still 157.3MB. Free memory was 110.3MB in the beginning and 108.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.36ms. Allocated memory is still 157.3MB. Free memory was 108.2MB in the beginning and 105.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1116.10ms. Allocated memory is still 157.3MB. Free memory was 105.8MB in the beginning and 68.3MB in the end (delta: 37.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15637.72ms. Allocated memory was 157.3MB in the beginning and 276.8MB in the end (delta: 119.5MB). Free memory was 67.7MB in the beginning and 206.7MB in the end (delta: -139.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 108.00ms. Allocated memory is still 276.8MB. Free memory was 206.7MB in the beginning and 195.1MB in the end (delta: 11.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.8s, 124 PlacesBefore, 34 PlacesAfterwards, 116 TransitionsBefore, 25 TransitionsAfterwards, 2146 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 5194 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2917, independent: 2750, independent conditional: 0, independent unconditional: 2750, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1607, independent: 1558, independent conditional: 0, independent unconditional: 1558, 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: 1607, independent: 1540, independent conditional: 0, independent unconditional: 1540, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 519, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 477, dependent conditional: 0, dependent unconditional: 477, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2917, independent: 1192, independent conditional: 0, independent unconditional: 1192, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 1607, unknown conditional: 0, unknown unconditional: 1607] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L851] 0 pthread_t t284; [L852] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t284, ((void *)0), P0, ((void *)0))=-2, t284={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 pthread_t t285; [L854] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t285, ((void *)0), P1, ((void *)0))=-1, t284={5:0}, t285={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t286; [L856] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t286, ((void *)0), P2, ((void *)0))=0, t284={5:0}, t285={6:0}, t286={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff1 = z$w_buff0 [L799] 3 z$w_buff0 = 1 [L800] 3 z$w_buff1_used = z$w_buff0_used [L801] 3 z$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 3 z$r_buff0_thd3 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 z$flush_delayed = weak$$choice2 [L813] 3 z$mem_tmp = z [L814] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L815] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L816] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L817] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L818] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L820] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EAX = z [L822] 3 z = z$flush_delayed ? z$mem_tmp : z [L823] 3 z$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 3 __unbuffered_p2_EBX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 z$flush_delayed = weak$$choice2 [L776] 2 z$mem_tmp = z [L777] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L778] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L779] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L780] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L781] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L783] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = z [L785] 2 z = z$flush_delayed ? z$mem_tmp : z [L786] 2 z$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L829] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L830] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L831] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L832] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 3 return 0; [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L863] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L864] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L865] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L866] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284={5:0}, t285={6:0}, t286={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L871] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 852]: 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: 854]: 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: 856]: 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, 147 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: 15.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 596 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 477 mSDsluCounter, 213 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1061 IncrementalHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 74 mSDtfsCounter, 1061 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=422occurred in iteration=8, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 02:26:04,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5992f1e-42fe-4fba-a01c-a369b21177a3/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