./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix004.oepc.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_ce635e18-6d9f-428f-a5c7-283a7674ab08/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce635e18-6d9f-428f-a5c7-283a7674ab08/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_ce635e18-6d9f-428f-a5c7-283a7674ab08/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce635e18-6d9f-428f-a5c7-283a7674ab08/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix004.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce635e18-6d9f-428f-a5c7-283a7674ab08/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_ce635e18-6d9f-428f-a5c7-283a7674ab08/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 81dfcecae183e47a2274a923e55daf761c46d6146ab2c58970ae115599afe231 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 04:04:53,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 04:04:53,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 04:04:53,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 04:04:53,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 04:04:53,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 04:04:53,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 04:04:53,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 04:04:53,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 04:04:53,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 04:04:53,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 04:04:53,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 04:04:53,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 04:04:53,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 04:04:53,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 04:04:53,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 04:04:53,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 04:04:53,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 04:04:53,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 04:04:53,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 04:04:53,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 04:04:53,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 04:04:53,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 04:04:53,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 04:04:53,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 04:04:53,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 04:04:53,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 04:04:53,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 04:04:53,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 04:04:53,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 04:04:53,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 04:04:53,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 04:04:53,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 04:04:53,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 04:04:53,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 04:04:53,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 04:04:53,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 04:04:53,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 04:04:53,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 04:04:53,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 04:04:53,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 04:04:53,551 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce635e18-6d9f-428f-a5c7-283a7674ab08/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 04:04:53,576 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 04:04:53,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 04:04:53,577 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 04:04:53,577 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 04:04:53,578 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 04:04:53,579 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 04:04:53,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 04:04:53,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 04:04:53,580 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 04:04:53,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 04:04:53,581 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 04:04:53,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 04:04:53,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 04:04:53,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 04:04:53,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 04:04:53,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 04:04:53,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 04:04:53,582 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 04:04:53,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 04:04:53,583 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 04:04:53,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 04:04:53,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 04:04:53,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 04:04:53,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 04:04:53,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 04:04:53,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 04:04:53,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 04:04:53,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 04:04:53,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 04:04:53,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 04:04:53,586 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 04:04:53,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 04:04:53,586 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 04:04:53,587 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 04:04:53,587 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_ce635e18-6d9f-428f-a5c7-283a7674ab08/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_ce635e18-6d9f-428f-a5c7-283a7674ab08/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 -> 81dfcecae183e47a2274a923e55daf761c46d6146ab2c58970ae115599afe231 [2022-11-23 04:04:53,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 04:04:53,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 04:04:53,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 04:04:53,893 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 04:04:53,894 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 04:04:53,895 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce635e18-6d9f-428f-a5c7-283a7674ab08/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix004.oepc.i [2022-11-23 04:04:57,003 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 04:04:57,344 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 04:04:57,345 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce635e18-6d9f-428f-a5c7-283a7674ab08/sv-benchmarks/c/pthread-wmm/mix004.oepc.i [2022-11-23 04:04:57,361 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce635e18-6d9f-428f-a5c7-283a7674ab08/bin/uautomizer-QkZJyEgLgS/data/c77c0b317/a5f9e0c018cc40c49d64fe464d659eb4/FLAGa5737e112 [2022-11-23 04:04:57,377 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce635e18-6d9f-428f-a5c7-283a7674ab08/bin/uautomizer-QkZJyEgLgS/data/c77c0b317/a5f9e0c018cc40c49d64fe464d659eb4 [2022-11-23 04:04:57,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 04:04:57,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 04:04:57,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 04:04:57,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 04:04:57,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 04:04:57,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:04:57" (1/1) ... [2022-11-23 04:04:57,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745505e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:04:57, skipping insertion in model container [2022-11-23 04:04:57,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:04:57" (1/1) ... [2022-11-23 04:04:57,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 04:04:57,460 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 04:04:57,645 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_ce635e18-6d9f-428f-a5c7-283a7674ab08/sv-benchmarks/c/pthread-wmm/mix004.oepc.i[945,958] [2022-11-23 04:04:58,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 04:04:58,026 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 04:04:58,037 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_ce635e18-6d9f-428f-a5c7-283a7674ab08/sv-benchmarks/c/pthread-wmm/mix004.oepc.i[945,958] [2022-11-23 04:04:58,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 04:04:58,128 INFO L208 MainTranslator]: Completed translation [2022-11-23 04:04:58,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:04:58 WrapperNode [2022-11-23 04:04:58,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 04:04:58,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 04:04:58,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 04:04:58,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 04:04:58,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:04:58" (1/1) ... [2022-11-23 04:04:58,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:04:58" (1/1) ... [2022-11-23 04:04:58,184 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-11-23 04:04:58,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 04:04:58,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 04:04:58,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 04:04:58,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 04:04:58,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:04:58" (1/1) ... [2022-11-23 04:04:58,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:04:58" (1/1) ... [2022-11-23 04:04:58,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:04:58" (1/1) ... [2022-11-23 04:04:58,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:04:58" (1/1) ... [2022-11-23 04:04:58,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:04:58" (1/1) ... [2022-11-23 04:04:58,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:04:58" (1/1) ... [2022-11-23 04:04:58,218 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:04:58" (1/1) ... [2022-11-23 04:04:58,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:04:58" (1/1) ... [2022-11-23 04:04:58,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 04:04:58,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 04:04:58,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 04:04:58,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 04:04:58,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:04:58" (1/1) ... [2022-11-23 04:04:58,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 04:04:58,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce635e18-6d9f-428f-a5c7-283a7674ab08/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 04:04:58,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce635e18-6d9f-428f-a5c7-283a7674ab08/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 04:04:58,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce635e18-6d9f-428f-a5c7-283a7674ab08/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 04:04:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 04:04:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 04:04:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 04:04:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 04:04:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 04:04:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 04:04:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 04:04:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 04:04:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 04:04:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 04:04:58,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 04:04:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 04:04:58,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 04:04:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 04:04:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 04:04:58,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 04:04:58,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 04:04:58,325 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 04:04:58,603 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 04:04:58,605 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 04:04:59,189 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 04:04:59,439 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 04:04:59,450 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 04:04:59,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:04:59 BoogieIcfgContainer [2022-11-23 04:04:59,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 04:04:59,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 04:04:59,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 04:04:59,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 04:04:59,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:04:57" (1/3) ... [2022-11-23 04:04:59,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e44b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:04:59, skipping insertion in model container [2022-11-23 04:04:59,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:04:58" (2/3) ... [2022-11-23 04:04:59,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e44b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:04:59, skipping insertion in model container [2022-11-23 04:04:59,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:04:59" (3/3) ... [2022-11-23 04:04:59,468 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.oepc.i [2022-11-23 04:04:59,478 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 04:04:59,489 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 04:04:59,489 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 04:04:59,489 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 04:04:59,568 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 04:04:59,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2022-11-23 04:04:59,688 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2022-11-23 04:04:59,688 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 04:04:59,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-23 04:04:59,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 141 transitions, 302 flow [2022-11-23 04:04:59,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 137 transitions, 286 flow [2022-11-23 04:04:59,703 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 04:04:59,719 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 286 flow [2022-11-23 04:04:59,722 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 286 flow [2022-11-23 04:04:59,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 286 flow [2022-11-23 04:04:59,760 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2022-11-23 04:04:59,760 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 04:04:59,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-23 04:04:59,764 INFO L119 LiptonReduction]: Number of co-enabled transitions 3534 [2022-11-23 04:05:06,153 INFO L134 LiptonReduction]: Checked pairs total: 11290 [2022-11-23 04:05:06,154 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-11-23 04:05:06,191 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 04:05:06,201 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;@57502a27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 04:05:06,202 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-23 04:05:06,204 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-11-23 04:05:06,205 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 04:05:06,206 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:05:06,207 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 04:05:06,207 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 04:05:06,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:05:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash 580958, now seen corresponding path program 1 times [2022-11-23 04:05:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:05:06,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188621885] [2022-11-23 04:05:06,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:05:06,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:05:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:05:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:05:06,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:05:06,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188621885] [2022-11-23 04:05:06,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188621885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:05:06,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:05:06,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 04:05:06,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000381060] [2022-11-23 04:05:06,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:05:06,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 04:05:06,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:05:06,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 04:05:06,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 04:05:06,873 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 261 [2022-11-23 04:05:06,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:06,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:05:06,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 261 [2022-11-23 04:05:06,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:05:08,411 INFO L130 PetriNetUnfolder]: 4903/7152 cut-off events. [2022-11-23 04:05:08,411 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-11-23 04:05:08,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14000 conditions, 7152 events. 4903/7152 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 43239 event pairs, 895 based on Foata normal form. 0/6802 useless extension candidates. Maximal degree in co-relation 13988. Up to 5335 conditions per place. [2022-11-23 04:05:08,472 INFO L137 encePairwiseOnDemand]: 257/261 looper letters, 41 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2022-11-23 04:05:08,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 211 flow [2022-11-23 04:05:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 04:05:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 04:05:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2022-11-23 04:05:08,501 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2022-11-23 04:05:08,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2022-11-23 04:05:08,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2022-11-23 04:05:08,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:05:08,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2022-11-23 04:05:08,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:08,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:08,534 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:08,536 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 423 transitions. [2022-11-23 04:05:08,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 211 flow [2022-11-23 04:05:08,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-23 04:05:08,545 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2022-11-23 04:05:08,547 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2022-11-23 04:05:08,554 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2022-11-23 04:05:08,554 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2022-11-23 04:05:08,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:08,555 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:05:08,555 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:05:08,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 04:05:08,557 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 04:05:08,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:05:08,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2135198280, now seen corresponding path program 1 times [2022-11-23 04:05:08,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:05:08,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618287001] [2022-11-23 04:05:08,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:05:08,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:05:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:05:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:05:09,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:05:09,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618287001] [2022-11-23 04:05:09,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618287001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:05:09,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:05:09,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 04:05:09,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549524625] [2022-11-23 04:05:09,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:05:09,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 04:05:09,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:05:09,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 04:05:09,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 04:05:09,105 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 261 [2022-11-23 04:05:09,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:09,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:05:09,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 261 [2022-11-23 04:05:09,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:05:11,608 INFO L130 PetriNetUnfolder]: 11615/15560 cut-off events. [2022-11-23 04:05:11,609 INFO L131 PetriNetUnfolder]: For 783/783 co-relation queries the response was YES. [2022-11-23 04:05:11,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32270 conditions, 15560 events. 11615/15560 cut-off events. For 783/783 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 72332 event pairs, 5763 based on Foata normal form. 16/15576 useless extension candidates. Maximal degree in co-relation 32260. Up to 15369 conditions per place. [2022-11-23 04:05:11,715 INFO L137 encePairwiseOnDemand]: 255/261 looper letters, 40 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2022-11-23 04:05:11,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 200 flow [2022-11-23 04:05:11,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 04:05:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 04:05:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2022-11-23 04:05:11,718 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49936143039591313 [2022-11-23 04:05:11,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2022-11-23 04:05:11,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2022-11-23 04:05:11,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:05:11,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2022-11-23 04:05:11,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:11,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:11,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:11,725 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 391 transitions. [2022-11-23 04:05:11,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 200 flow [2022-11-23 04:05:11,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 04:05:11,729 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 99 flow [2022-11-23 04:05:11,730 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-11-23 04:05:11,731 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2022-11-23 04:05:11,731 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 99 flow [2022-11-23 04:05:11,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:11,732 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:05:11,732 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:05:11,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 04:05:11,733 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 04:05:11,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:05:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash 534988304, now seen corresponding path program 1 times [2022-11-23 04:05:11,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:05:11,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397259909] [2022-11-23 04:05:11,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:05:11,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:05:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:05:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:05:12,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:05:12,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397259909] [2022-11-23 04:05:12,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397259909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:05:12,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:05:12,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 04:05:12,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645245753] [2022-11-23 04:05:12,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:05:12,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 04:05:12,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:05:12,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 04:05:12,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 04:05:12,071 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 261 [2022-11-23 04:05:12,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:12,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:05:12,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 261 [2022-11-23 04:05:12,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:05:14,254 INFO L130 PetriNetUnfolder]: 10649/14310 cut-off events. [2022-11-23 04:05:14,255 INFO L131 PetriNetUnfolder]: For 2312/2312 co-relation queries the response was YES. [2022-11-23 04:05:14,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32229 conditions, 14310 events. 10649/14310 cut-off events. For 2312/2312 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 65220 event pairs, 3331 based on Foata normal form. 284/14594 useless extension candidates. Maximal degree in co-relation 32218. Up to 9891 conditions per place. [2022-11-23 04:05:14,348 INFO L137 encePairwiseOnDemand]: 258/261 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-11-23 04:05:14,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 231 flow [2022-11-23 04:05:14,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 04:05:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 04:05:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2022-11-23 04:05:14,351 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49808429118773945 [2022-11-23 04:05:14,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2022-11-23 04:05:14,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2022-11-23 04:05:14,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:05:14,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2022-11-23 04:05:14,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:14,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:14,355 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:14,356 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 99 flow. Second operand 3 states and 390 transitions. [2022-11-23 04:05:14,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 231 flow [2022-11-23 04:05:14,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 04:05:14,359 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 105 flow [2022-11-23 04:05:14,359 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-11-23 04:05:14,361 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2022-11-23 04:05:14,361 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 105 flow [2022-11-23 04:05:14,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:14,362 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:05:14,362 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:05:14,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 04:05:14,363 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 04:05:14,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:05:14,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1067310974, now seen corresponding path program 1 times [2022-11-23 04:05:14,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:05:14,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568854551] [2022-11-23 04:05:14,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:05:14,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:05:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:05:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:05:14,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:05:14,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568854551] [2022-11-23 04:05:14,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568854551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:05:14,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:05:14,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 04:05:14,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557839635] [2022-11-23 04:05:14,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:05:14,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 04:05:14,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:05:14,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 04:05:14,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 04:05:14,628 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 261 [2022-11-23 04:05:14,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:14,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:05:14,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 261 [2022-11-23 04:05:14,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:05:16,215 INFO L130 PetriNetUnfolder]: 9979/13440 cut-off events. [2022-11-23 04:05:16,215 INFO L131 PetriNetUnfolder]: For 3795/3795 co-relation queries the response was YES. [2022-11-23 04:05:16,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31281 conditions, 13440 events. 9979/13440 cut-off events. For 3795/3795 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 62823 event pairs, 2909 based on Foata normal form. 200/13640 useless extension candidates. Maximal degree in co-relation 31268. Up to 9741 conditions per place. [2022-11-23 04:05:16,308 INFO L137 encePairwiseOnDemand]: 258/261 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2022-11-23 04:05:16,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 250 flow [2022-11-23 04:05:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 04:05:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 04:05:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2022-11-23 04:05:16,311 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5006385696040868 [2022-11-23 04:05:16,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2022-11-23 04:05:16,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2022-11-23 04:05:16,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:05:16,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2022-11-23 04:05:16,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:16,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:16,322 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:16,322 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 105 flow. Second operand 3 states and 392 transitions. [2022-11-23 04:05:16,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 250 flow [2022-11-23 04:05:16,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 04:05:16,352 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 110 flow [2022-11-23 04:05:16,353 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-11-23 04:05:16,355 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2022-11-23 04:05:16,355 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 110 flow [2022-11-23 04:05:16,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:16,356 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:05:16,356 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:05:16,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 04:05:16,357 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 04:05:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:05:16,358 INFO L85 PathProgramCache]: Analyzing trace with hash -534416442, now seen corresponding path program 1 times [2022-11-23 04:05:16,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:05:16,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983410243] [2022-11-23 04:05:16,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:05:16,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:05:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:05:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:05:16,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:05:16,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983410243] [2022-11-23 04:05:16,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983410243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:05:16,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:05:16,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 04:05:16,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118430936] [2022-11-23 04:05:16,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:05:16,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 04:05:16,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:05:16,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 04:05:16,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 04:05:16,599 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 261 [2022-11-23 04:05:16,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:16,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:05:16,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 261 [2022-11-23 04:05:16,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:05:17,850 INFO L130 PetriNetUnfolder]: 4752/7068 cut-off events. [2022-11-23 04:05:17,851 INFO L131 PetriNetUnfolder]: For 1002/1110 co-relation queries the response was YES. [2022-11-23 04:05:17,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15178 conditions, 7068 events. 4752/7068 cut-off events. For 1002/1110 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 40999 event pairs, 984 based on Foata normal form. 541/7450 useless extension candidates. Maximal degree in co-relation 15164. Up to 4383 conditions per place. [2022-11-23 04:05:17,905 INFO L137 encePairwiseOnDemand]: 254/261 looper letters, 60 selfloop transitions, 10 changer transitions 0/79 dead transitions. [2022-11-23 04:05:17,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 348 flow [2022-11-23 04:05:17,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 04:05:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 04:05:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2022-11-23 04:05:17,909 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5149425287356322 [2022-11-23 04:05:17,909 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2022-11-23 04:05:17,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2022-11-23 04:05:17,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:05:17,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2022-11-23 04:05:17,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:17,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:17,918 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:17,918 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 110 flow. Second operand 5 states and 672 transitions. [2022-11-23 04:05:17,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 348 flow [2022-11-23 04:05:17,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 04:05:17,924 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 179 flow [2022-11-23 04:05:17,924 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2022-11-23 04:05:17,927 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2022-11-23 04:05:17,927 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 179 flow [2022-11-23 04:05:17,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:17,928 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:05:17,928 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:05:17,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 04:05:17,929 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 04:05:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:05:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash -378338043, now seen corresponding path program 1 times [2022-11-23 04:05:17,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:05:17,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556346945] [2022-11-23 04:05:17,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:05:17,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:05:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:05:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:05:18,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:05:18,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556346945] [2022-11-23 04:05:18,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556346945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:05:18,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:05:18,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 04:05:18,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397176902] [2022-11-23 04:05:18,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:05:18,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 04:05:18,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:05:18,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 04:05:18,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 04:05:18,279 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 261 [2022-11-23 04:05:18,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:18,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:05:18,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 261 [2022-11-23 04:05:18,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:05:19,458 INFO L130 PetriNetUnfolder]: 3819/5889 cut-off events. [2022-11-23 04:05:19,459 INFO L131 PetriNetUnfolder]: For 2760/2782 co-relation queries the response was YES. [2022-11-23 04:05:19,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16343 conditions, 5889 events. 3819/5889 cut-off events. For 2760/2782 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 35111 event pairs, 612 based on Foata normal form. 350/6098 useless extension candidates. Maximal degree in co-relation 16326. Up to 1825 conditions per place. [2022-11-23 04:05:19,503 INFO L137 encePairwiseOnDemand]: 254/261 looper letters, 82 selfloop transitions, 19 changer transitions 0/110 dead transitions. [2022-11-23 04:05:19,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 110 transitions, 577 flow [2022-11-23 04:05:19,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 04:05:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 04:05:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 943 transitions. [2022-11-23 04:05:19,507 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5161466885604816 [2022-11-23 04:05:19,507 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 943 transitions. [2022-11-23 04:05:19,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 943 transitions. [2022-11-23 04:05:19,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:05:19,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 943 transitions. [2022-11-23 04:05:19,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.71428571428572) internal successors, (943), 7 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:19,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:19,515 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:19,515 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 179 flow. Second operand 7 states and 943 transitions. [2022-11-23 04:05:19,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 110 transitions, 577 flow [2022-11-23 04:05:19,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 110 transitions, 572 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 04:05:19,532 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 308 flow [2022-11-23 04:05:19,532 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=308, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2022-11-23 04:05:19,535 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2022-11-23 04:05:19,536 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 308 flow [2022-11-23 04:05:19,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:19,536 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:05:19,537 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, 1] [2022-11-23 04:05:19,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 04:05:19,537 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 04:05:19,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:05:19,538 INFO L85 PathProgramCache]: Analyzing trace with hash -664233873, now seen corresponding path program 1 times [2022-11-23 04:05:19,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:05:19,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410185864] [2022-11-23 04:05:19,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:05:19,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:05:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:05:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:05:19,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:05:19,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410185864] [2022-11-23 04:05:19,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410185864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:05:19,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:05:19,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 04:05:19,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25164156] [2022-11-23 04:05:19,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:05:19,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 04:05:19,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:05:19,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 04:05:19,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 04:05:19,871 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 261 [2022-11-23 04:05:19,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 308 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:19,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:05:19,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 261 [2022-11-23 04:05:19,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:05:21,228 INFO L130 PetriNetUnfolder]: 6301/9945 cut-off events. [2022-11-23 04:05:21,228 INFO L131 PetriNetUnfolder]: For 17706/17723 co-relation queries the response was YES. [2022-11-23 04:05:21,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32849 conditions, 9945 events. 6301/9945 cut-off events. For 17706/17723 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 65237 event pairs, 1247 based on Foata normal form. 55/9896 useless extension candidates. Maximal degree in co-relation 32828. Up to 4785 conditions per place. [2022-11-23 04:05:21,286 INFO L137 encePairwiseOnDemand]: 258/261 looper letters, 79 selfloop transitions, 2 changer transitions 26/114 dead transitions. [2022-11-23 04:05:21,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 114 transitions, 949 flow [2022-11-23 04:05:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 04:05:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 04:05:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2022-11-23 04:05:21,291 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5210727969348659 [2022-11-23 04:05:21,291 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2022-11-23 04:05:21,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2022-11-23 04:05:21,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:05:21,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2022-11-23 04:05:21,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:21,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:21,297 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:21,297 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 308 flow. Second operand 4 states and 544 transitions. [2022-11-23 04:05:21,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 114 transitions, 949 flow [2022-11-23 04:05:21,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 114 transitions, 814 flow, removed 47 selfloop flow, removed 3 redundant places. [2022-11-23 04:05:21,771 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 267 flow [2022-11-23 04:05:21,772 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=267, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2022-11-23 04:05:21,772 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2022-11-23 04:05:21,773 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 267 flow [2022-11-23 04:05:21,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:21,774 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:05:21,774 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] [2022-11-23 04:05:21,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 04:05:21,774 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 04:05:21,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:05:21,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1101692039, now seen corresponding path program 1 times [2022-11-23 04:05:21,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:05:21,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37170671] [2022-11-23 04:05:21,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:05:21,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:05:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:05:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:05:22,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:05:22,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37170671] [2022-11-23 04:05:22,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37170671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:05:22,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:05:22,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 04:05:22,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469232266] [2022-11-23 04:05:22,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:05:22,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 04:05:22,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:05:22,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 04:05:22,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 04:05:22,112 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 261 [2022-11-23 04:05:22,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 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 04:05:22,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:05:22,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 261 [2022-11-23 04:05:22,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:05:23,922 INFO L130 PetriNetUnfolder]: 9234/14565 cut-off events. [2022-11-23 04:05:23,922 INFO L131 PetriNetUnfolder]: For 19663/19700 co-relation queries the response was YES. [2022-11-23 04:05:23,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44515 conditions, 14565 events. 9234/14565 cut-off events. For 19663/19700 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 102075 event pairs, 1436 based on Foata normal form. 76/14371 useless extension candidates. Maximal degree in co-relation 44493. Up to 6543 conditions per place. [2022-11-23 04:05:24,000 INFO L137 encePairwiseOnDemand]: 258/261 looper letters, 95 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2022-11-23 04:05:24,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 770 flow [2022-11-23 04:05:24,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 04:05:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 04:05:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2022-11-23 04:05:24,003 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5162835249042146 [2022-11-23 04:05:24,003 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2022-11-23 04:05:24,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2022-11-23 04:05:24,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:05:24,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2022-11-23 04:05:24,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:24,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:24,009 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:24,009 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 267 flow. Second operand 4 states and 539 transitions. [2022-11-23 04:05:24,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 770 flow [2022-11-23 04:05:24,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 768 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 04:05:24,445 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 279 flow [2022-11-23 04:05:24,445 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2022-11-23 04:05:24,446 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2022-11-23 04:05:24,446 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 279 flow [2022-11-23 04:05:24,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 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 04:05:24,447 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:05:24,447 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] [2022-11-23 04:05:24,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 04:05:24,448 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 04:05:24,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:05:24,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1488323355, now seen corresponding path program 2 times [2022-11-23 04:05:24,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:05:24,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423628373] [2022-11-23 04:05:24,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:05:24,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:05:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:05:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:05:24,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:05:24,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423628373] [2022-11-23 04:05:24,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423628373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:05:24,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:05:24,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 04:05:24,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470671748] [2022-11-23 04:05:24,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:05:24,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 04:05:24,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:05:24,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 04:05:24,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 04:05:24,799 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 261 [2022-11-23 04:05:24,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:24,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:05:24,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 261 [2022-11-23 04:05:24,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:05:26,788 INFO L130 PetriNetUnfolder]: 7464/11653 cut-off events. [2022-11-23 04:05:26,789 INFO L131 PetriNetUnfolder]: For 13601/13634 co-relation queries the response was YES. [2022-11-23 04:05:26,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35592 conditions, 11653 events. 7464/11653 cut-off events. For 13601/13634 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 80061 event pairs, 889 based on Foata normal form. 322/11724 useless extension candidates. Maximal degree in co-relation 35568. Up to 2671 conditions per place. [2022-11-23 04:05:26,860 INFO L137 encePairwiseOnDemand]: 254/261 looper letters, 90 selfloop transitions, 26 changer transitions 13/140 dead transitions. [2022-11-23 04:05:26,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 140 transitions, 860 flow [2022-11-23 04:05:26,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 04:05:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 04:05:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1211 transitions. [2022-11-23 04:05:26,866 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5155385270327799 [2022-11-23 04:05:26,866 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1211 transitions. [2022-11-23 04:05:26,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1211 transitions. [2022-11-23 04:05:26,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:05:26,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1211 transitions. [2022-11-23 04:05:26,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.55555555555554) internal successors, (1211), 9 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:26,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:26,879 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:26,879 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 279 flow. Second operand 9 states and 1211 transitions. [2022-11-23 04:05:26,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 140 transitions, 860 flow [2022-11-23 04:05:27,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 140 transitions, 852 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 04:05:27,516 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 442 flow [2022-11-23 04:05:27,516 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=442, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2022-11-23 04:05:27,517 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2022-11-23 04:05:27,517 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 442 flow [2022-11-23 04:05:27,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:27,518 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:05:27,518 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, 1, 1, 1, 1] [2022-11-23 04:05:27,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 04:05:27,518 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 04:05:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:05:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1909684995, now seen corresponding path program 1 times [2022-11-23 04:05:27,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:05:27,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326941623] [2022-11-23 04:05:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:05:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:05:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:05:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:05:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:05:28,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326941623] [2022-11-23 04:05:28,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326941623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:05:28,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:05:28,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 04:05:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411473259] [2022-11-23 04:05:28,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:05:28,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 04:05:28,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:05:28,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 04:05:28,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 04:05:28,713 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 261 [2022-11-23 04:05:28,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 442 flow. Second operand has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:28,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:05:28,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 261 [2022-11-23 04:05:28,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:05:32,174 INFO L130 PetriNetUnfolder]: 13753/22387 cut-off events. [2022-11-23 04:05:32,174 INFO L131 PetriNetUnfolder]: For 53511/53527 co-relation queries the response was YES. [2022-11-23 04:05:32,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79452 conditions, 22387 events. 13753/22387 cut-off events. For 53511/53527 co-relation queries the response was YES. Maximal size of possible extension queue 1410. Compared 181035 event pairs, 3913 based on Foata normal form. 12/21837 useless extension candidates. Maximal degree in co-relation 79424. Up to 10940 conditions per place. [2022-11-23 04:05:32,293 INFO L137 encePairwiseOnDemand]: 253/261 looper letters, 147 selfloop transitions, 12 changer transitions 35/205 dead transitions. [2022-11-23 04:05:32,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 205 transitions, 2026 flow [2022-11-23 04:05:32,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 04:05:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 04:05:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 919 transitions. [2022-11-23 04:05:32,297 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5030103995621237 [2022-11-23 04:05:32,297 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 919 transitions. [2022-11-23 04:05:32,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 919 transitions. [2022-11-23 04:05:32,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:05:32,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 919 transitions. [2022-11-23 04:05:32,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:32,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:32,305 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:32,305 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 442 flow. Second operand 7 states and 919 transitions. [2022-11-23 04:05:32,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 205 transitions, 2026 flow [2022-11-23 04:05:38,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 205 transitions, 1629 flow, removed 138 selfloop flow, removed 4 redundant places. [2022-11-23 04:05:38,242 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 447 flow [2022-11-23 04:05:38,242 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=447, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2022-11-23 04:05:38,243 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2022-11-23 04:05:38,243 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 447 flow [2022-11-23 04:05:38,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:38,244 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:05:38,244 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, 1, 1, 1] [2022-11-23 04:05:38,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 04:05:38,244 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 04:05:38,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:05:38,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1220632106, now seen corresponding path program 1 times [2022-11-23 04:05:38,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:05:38,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238792907] [2022-11-23 04:05:38,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:05:38,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:05:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:05:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:05:39,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:05:39,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238792907] [2022-11-23 04:05:39,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238792907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:05:39,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:05:39,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 04:05:39,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625409149] [2022-11-23 04:05:39,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:05:39,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 04:05:39,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:05:39,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 04:05:39,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 04:05:39,527 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 261 [2022-11-23 04:05:39,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 447 flow. Second operand has 7 states, 7 states have (on average 111.57142857142857) internal successors, (781), 7 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:39,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:05:39,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 261 [2022-11-23 04:05:39,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:05:43,986 INFO L130 PetriNetUnfolder]: 24954/37923 cut-off events. [2022-11-23 04:05:43,986 INFO L131 PetriNetUnfolder]: For 73060/73060 co-relation queries the response was YES. [2022-11-23 04:05:44,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141099 conditions, 37923 events. 24954/37923 cut-off events. For 73060/73060 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 274288 event pairs, 4402 based on Foata normal form. 9/37932 useless extension candidates. Maximal degree in co-relation 141066. Up to 27697 conditions per place. [2022-11-23 04:05:44,171 INFO L137 encePairwiseOnDemand]: 248/261 looper letters, 126 selfloop transitions, 18 changer transitions 109/253 dead transitions. [2022-11-23 04:05:44,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 253 transitions, 1978 flow [2022-11-23 04:05:44,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 04:05:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 04:05:44,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1113 transitions. [2022-11-23 04:05:44,175 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47381864623243936 [2022-11-23 04:05:44,176 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1113 transitions. [2022-11-23 04:05:44,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1113 transitions. [2022-11-23 04:05:44,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:05:44,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1113 transitions. [2022-11-23 04:05:44,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.66666666666667) internal successors, (1113), 9 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:44,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:44,186 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:44,186 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 447 flow. Second operand 9 states and 1113 transitions. [2022-11-23 04:05:44,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 253 transitions, 1978 flow [2022-11-23 04:05:56,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 253 transitions, 1977 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 04:05:56,246 INFO L231 Difference]: Finished difference. Result has 91 places, 68 transitions, 507 flow [2022-11-23 04:05:56,247 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=507, PETRI_PLACES=91, PETRI_TRANSITIONS=68} [2022-11-23 04:05:56,247 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 47 predicate places. [2022-11-23 04:05:56,247 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 68 transitions, 507 flow [2022-11-23 04:05:56,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.57142857142857) internal successors, (781), 7 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:56,248 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:05:56,249 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, 1, 1, 1] [2022-11-23 04:05:56,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 04:05:56,249 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 04:05:56,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:05:56,250 INFO L85 PathProgramCache]: Analyzing trace with hash 775562624, now seen corresponding path program 2 times [2022-11-23 04:05:56,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:05:56,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944447720] [2022-11-23 04:05:56,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:05:56,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:05:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:05:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:05:56,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:05:56,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944447720] [2022-11-23 04:05:56,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944447720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:05:56,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:05:56,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 04:05:56,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377216624] [2022-11-23 04:05:56,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:05:56,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 04:05:56,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:05:56,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 04:05:56,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 04:05:56,721 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 261 [2022-11-23 04:05:56,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 68 transitions, 507 flow. Second operand has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:56,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:05:56,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 261 [2022-11-23 04:05:56,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:05:58,545 INFO L130 PetriNetUnfolder]: 4811/7875 cut-off events. [2022-11-23 04:05:58,545 INFO L131 PetriNetUnfolder]: For 19765/20020 co-relation queries the response was YES. [2022-11-23 04:05:58,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29966 conditions, 7875 events. 4811/7875 cut-off events. For 19765/20020 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 54071 event pairs, 722 based on Foata normal form. 146/7777 useless extension candidates. Maximal degree in co-relation 29928. Up to 3037 conditions per place. [2022-11-23 04:05:58,617 INFO L137 encePairwiseOnDemand]: 254/261 looper letters, 93 selfloop transitions, 18 changer transitions 23/145 dead transitions. [2022-11-23 04:05:58,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 145 transitions, 1151 flow [2022-11-23 04:05:58,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 04:05:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 04:05:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1051 transitions. [2022-11-23 04:05:58,621 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5033524904214559 [2022-11-23 04:05:58,622 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1051 transitions. [2022-11-23 04:05:58,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1051 transitions. [2022-11-23 04:05:58,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:05:58,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1051 transitions. [2022-11-23 04:05:58,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.375) internal successors, (1051), 8 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:58,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:58,633 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:58,633 INFO L175 Difference]: Start difference. First operand has 91 places, 68 transitions, 507 flow. Second operand 8 states and 1051 transitions. [2022-11-23 04:05:58,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 145 transitions, 1151 flow [2022-11-23 04:05:59,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 145 transitions, 1063 flow, removed 36 selfloop flow, removed 10 redundant places. [2022-11-23 04:05:59,035 INFO L231 Difference]: Finished difference. Result has 81 places, 64 transitions, 437 flow [2022-11-23 04:05:59,035 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=437, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2022-11-23 04:05:59,036 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2022-11-23 04:05:59,036 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 437 flow [2022-11-23 04:05:59,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:59,037 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:05:59,037 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:05:59,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 04:05:59,038 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 04:05:59,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:05:59,038 INFO L85 PathProgramCache]: Analyzing trace with hash -176448316, now seen corresponding path program 1 times [2022-11-23 04:05:59,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:05:59,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138924009] [2022-11-23 04:05:59,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:05:59,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:05:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:06:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:06:00,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:06:00,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138924009] [2022-11-23 04:06:00,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138924009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:06:00,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:06:00,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 04:06:00,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329253605] [2022-11-23 04:06:00,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:06:00,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 04:06:00,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:06:00,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 04:06:00,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 04:06:00,492 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 261 [2022-11-23 04:06:00,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 64 transitions, 437 flow. Second operand has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:06:00,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:06:00,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 261 [2022-11-23 04:06:00,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:06:01,498 INFO L130 PetriNetUnfolder]: 3258/5476 cut-off events. [2022-11-23 04:06:01,499 INFO L131 PetriNetUnfolder]: For 12682/12941 co-relation queries the response was YES. [2022-11-23 04:06:01,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22638 conditions, 5476 events. 3258/5476 cut-off events. For 12682/12941 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 35461 event pairs, 764 based on Foata normal form. 72/5420 useless extension candidates. Maximal degree in co-relation 22610. Up to 2816 conditions per place. [2022-11-23 04:06:01,530 INFO L137 encePairwiseOnDemand]: 253/261 looper letters, 94 selfloop transitions, 9 changer transitions 36/149 dead transitions. [2022-11-23 04:06:01,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 149 transitions, 1300 flow [2022-11-23 04:06:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 04:06:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 04:06:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 920 transitions. [2022-11-23 04:06:01,534 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5035577449370553 [2022-11-23 04:06:01,535 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 920 transitions. [2022-11-23 04:06:01,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 920 transitions. [2022-11-23 04:06:01,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:06:01,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 920 transitions. [2022-11-23 04:06:01,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.42857142857142) internal successors, (920), 7 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:06:01,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:06:01,543 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:06:01,544 INFO L175 Difference]: Start difference. First operand has 81 places, 64 transitions, 437 flow. Second operand 7 states and 920 transitions. [2022-11-23 04:06:01,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 149 transitions, 1300 flow [2022-11-23 04:06:01,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 149 transitions, 1071 flow, removed 62 selfloop flow, removed 9 redundant places. [2022-11-23 04:06:01,715 INFO L231 Difference]: Finished difference. Result has 80 places, 64 transitions, 395 flow [2022-11-23 04:06:01,715 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=395, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2022-11-23 04:06:01,716 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2022-11-23 04:06:01,716 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 395 flow [2022-11-23 04:06:01,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:06:01,717 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:06:01,717 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:06:01,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 04:06:01,718 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 04:06:01,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:06:01,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1770568496, now seen corresponding path program 2 times [2022-11-23 04:06:01,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:06:01,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956149437] [2022-11-23 04:06:01,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:06:01,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:06:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:06:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:06:02,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:06:02,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956149437] [2022-11-23 04:06:02,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956149437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:06:02,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:06:02,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 04:06:02,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384931281] [2022-11-23 04:06:02,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:06:02,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 04:06:02,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:06:02,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 04:06:02,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 04:06:02,078 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2022-11-23 04:06:02,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 64 transitions, 395 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:06:02,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:06:02,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2022-11-23 04:06:02,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:06:03,231 INFO L130 PetriNetUnfolder]: 4297/6814 cut-off events. [2022-11-23 04:06:03,231 INFO L131 PetriNetUnfolder]: For 13295/13295 co-relation queries the response was YES. [2022-11-23 04:06:03,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25531 conditions, 6814 events. 4297/6814 cut-off events. For 13295/13295 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 40434 event pairs, 1169 based on Foata normal form. 1/6815 useless extension candidates. Maximal degree in co-relation 25504. Up to 3232 conditions per place. [2022-11-23 04:06:03,255 INFO L137 encePairwiseOnDemand]: 255/261 looper letters, 52 selfloop transitions, 3 changer transitions 104/159 dead transitions. [2022-11-23 04:06:03,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 159 transitions, 1232 flow [2022-11-23 04:06:03,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 04:06:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 04:06:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2022-11-23 04:06:03,258 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49169859514687103 [2022-11-23 04:06:03,258 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 770 transitions. [2022-11-23 04:06:03,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 770 transitions. [2022-11-23 04:06:03,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:06:03,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 770 transitions. [2022-11-23 04:06:03,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:06:03,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:06:03,264 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:06:03,264 INFO L175 Difference]: Start difference. First operand has 80 places, 64 transitions, 395 flow. Second operand 6 states and 770 transitions. [2022-11-23 04:06:03,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 159 transitions, 1232 flow [2022-11-23 04:06:03,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 159 transitions, 1176 flow, removed 20 selfloop flow, removed 6 redundant places. [2022-11-23 04:06:03,384 INFO L231 Difference]: Finished difference. Result has 77 places, 45 transitions, 249 flow [2022-11-23 04:06:03,385 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=77, PETRI_TRANSITIONS=45} [2022-11-23 04:06:03,385 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2022-11-23 04:06:03,385 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 45 transitions, 249 flow [2022-11-23 04:06:03,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:06:03,386 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:06:03,386 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:06:03,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 04:06:03,386 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 04:06:03,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:06:03,387 INFO L85 PathProgramCache]: Analyzing trace with hash 417165798, now seen corresponding path program 3 times [2022-11-23 04:06:03,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:06:03,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142876336] [2022-11-23 04:06:03,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:06:03,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:06:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 04:06:03,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 04:06:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 04:06:03,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 04:06:03,536 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 04:06:03,537 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-23 04:06:03,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-23 04:06:03,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-23 04:06:03,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-23 04:06:03,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-23 04:06:03,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-23 04:06:03,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-23 04:06:03,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 04:06:03,541 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:06:03,548 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 04:06:03,548 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 04:06:03,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:06:03 BasicIcfg [2022-11-23 04:06:03,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 04:06:03,720 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 04:06:03,720 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 04:06:03,720 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 04:06:03,721 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:04:59" (3/4) ... [2022-11-23 04:06:03,723 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 04:06:03,871 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce635e18-6d9f-428f-a5c7-283a7674ab08/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 04:06:03,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 04:06:03,872 INFO L158 Benchmark]: Toolchain (without parser) took 66491.44ms. Allocated memory was 134.2MB in the beginning and 4.7GB in the end (delta: 4.6GB). Free memory was 100.1MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 735.6MB. Max. memory is 16.1GB. [2022-11-23 04:06:03,873 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 111.1MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 04:06:03,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 746.51ms. Allocated memory is still 134.2MB. Free memory was 100.1MB in the beginning and 75.9MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-23 04:06:03,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.42ms. Allocated memory is still 134.2MB. Free memory was 75.9MB in the beginning and 73.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 04:06:03,876 INFO L158 Benchmark]: Boogie Preprocessor took 39.96ms. Allocated memory is still 134.2MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 04:06:03,877 INFO L158 Benchmark]: RCFGBuilder took 1229.27ms. Allocated memory is still 134.2MB. Free memory was 71.2MB in the beginning and 86.7MB in the end (delta: -15.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2022-11-23 04:06:03,877 INFO L158 Benchmark]: TraceAbstraction took 64259.71ms. Allocated memory was 134.2MB in the beginning and 4.7GB in the end (delta: 4.6GB). Free memory was 86.6MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 699.3MB. Max. memory is 16.1GB. [2022-11-23 04:06:03,878 INFO L158 Benchmark]: Witness Printer took 152.21ms. Allocated memory is still 4.7GB. Free memory was 4.0GB in the beginning and 4.0GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-23 04:06:03,879 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.32ms. Allocated memory is still 111.1MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 746.51ms. Allocated memory is still 134.2MB. Free memory was 100.1MB in the beginning and 75.9MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.42ms. Allocated memory is still 134.2MB. Free memory was 75.9MB in the beginning and 73.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.96ms. Allocated memory is still 134.2MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1229.27ms. Allocated memory is still 134.2MB. Free memory was 71.2MB in the beginning and 86.7MB in the end (delta: -15.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 64259.71ms. Allocated memory was 134.2MB in the beginning and 4.7GB in the end (delta: 4.6GB). Free memory was 86.6MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 699.3MB. Max. memory is 16.1GB. * Witness Printer took 152.21ms. Allocated memory is still 4.7GB. Free memory was 4.0GB in the beginning and 4.0GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. 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: 6.4s, 148 PlacesBefore, 44 PlacesAfterwards, 137 TransitionsBefore, 32 TransitionsAfterwards, 3534 CoEnabledTransitionPairs, 8 FixpointIterations, 48 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 11290 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5592, independent: 5294, independent conditional: 0, independent unconditional: 5294, dependent: 298, dependent conditional: 0, dependent unconditional: 298, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2812, independent: 2712, independent conditional: 0, independent unconditional: 2712, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2812, independent: 2686, independent conditional: 0, independent unconditional: 2686, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 126, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 640, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 600, dependent conditional: 0, dependent unconditional: 600, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5592, independent: 2582, independent conditional: 0, independent unconditional: 2582, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 2812, unknown conditional: 0, unknown unconditional: 2812] , Statistics on independence cache: Total cache size (in pairs): 363, Positive cache size: 326, Positive conditional cache size: 0, Positive unconditional cache size: 326, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t89; [L874] FCALL, FORK 0 pthread_create(&t89, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t89, ((void *)0), P0, ((void *)0))=-4, t89={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t90; [L876] FCALL, FORK 0 pthread_create(&t90, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t90, ((void *)0), P1, ((void *)0))=-3, t89={5:0}, t90={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t91; [L878] FCALL, FORK 0 pthread_create(&t91, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t91, ((void *)0), P2, ((void *)0))=-2, t89={5:0}, t90={6:0}, t91={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t92; [L880] FCALL, FORK 0 pthread_create(&t92, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t92, ((void *)0), P3, ((void *)0))=-1, t89={5:0}, t90={6:0}, t91={7:0}, t92={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L806] 3 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 __unbuffered_p2_EBX = z VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t89={5:0}, t90={6:0}, t91={7:0}, t92={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] 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}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=1, unknown-#in~expression-unknown=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 880]: 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: 874]: 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: 876]: 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: 878]: 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 9 procedures, 179 locations, 7 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: 63.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 49.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1044 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 874 mSDsluCounter, 421 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2293 IncrementalHoareTripleChecker+Invalid, 2439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 144 mSDtfsCounter, 2293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=507occurred in iteration=11, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 2239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 04:06:03,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce635e18-6d9f-428f-a5c7-283a7674ab08/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