/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 11:58:03,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 11:58:03,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 11:58:03,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 11:58:03,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 11:58:03,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 11:58:03,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 11:58:03,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 11:58:03,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 11:58:03,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 11:58:03,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 11:58:03,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 11:58:03,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 11:58:03,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 11:58:03,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 11:58:03,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 11:58:03,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 11:58:03,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 11:58:03,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 11:58:03,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 11:58:03,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 11:58:03,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 11:58:03,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 11:58:03,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 11:58:03,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 11:58:03,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 11:58:03,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 11:58:03,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 11:58:03,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 11:58:03,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 11:58:03,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 11:58:03,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 11:58:03,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 11:58:03,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 11:58:03,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 11:58:03,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 11:58:03,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 11:58:03,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 11:58:03,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 11:58:03,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 11:58:03,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 11:58:03,417 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-12 11:58:03,443 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 11:58:03,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 11:58:03,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 11:58:03,445 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 11:58:03,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 11:58:03,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 11:58:03,446 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 11:58:03,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 11:58:03,446 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 11:58:03,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 11:58:03,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 11:58:03,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 11:58:03,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 11:58:03,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 11:58:03,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 11:58:03,456 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 11:58:03,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 11:58:03,456 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 11:58:03,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 11:58:03,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 11:58:03,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 11:58:03,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 11:58:03,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 11:58:03,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:58:03,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 11:58:03,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 11:58:03,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 11:58:03,457 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 11:58:03,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 11:58:03,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 11:58:03,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 11:58:03,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 11:58:03,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 11:58:03,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 11:58:03,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 11:58:03,733 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 11:58:03,736 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 11:58:03,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 11:58:04,728 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 11:58:04,963 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 11:58:04,963 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 11:58:04,978 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b83ce1d0e/5ad23ef2168d464db3c368bba3585fde/FLAG928289331 [2022-12-12 11:58:04,996 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b83ce1d0e/5ad23ef2168d464db3c368bba3585fde [2022-12-12 11:58:04,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 11:58:04,999 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 11:58:05,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 11:58:05,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 11:58:05,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 11:58:05,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:58:04" (1/1) ... [2022-12-12 11:58:05,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@498a9e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:58:05, skipping insertion in model container [2022-12-12 11:58:05,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:58:04" (1/1) ... [2022-12-12 11:58:05,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 11:58:05,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 11:58:05,201 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-12 11:58:05,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:58:05,407 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 11:58:05,416 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-12 11:58:05,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:58:05,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:58:05,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:58:05,493 INFO L208 MainTranslator]: Completed translation [2022-12-12 11:58:05,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:58:05 WrapperNode [2022-12-12 11:58:05,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 11:58:05,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 11:58:05,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 11:58:05,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 11:58:05,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:58:05" (1/1) ... [2022-12-12 11:58:05,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:58:05" (1/1) ... [2022-12-12 11:58:05,558 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2022-12-12 11:58:05,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 11:58:05,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 11:58:05,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 11:58:05,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 11:58:05,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:58:05" (1/1) ... [2022-12-12 11:58:05,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:58:05" (1/1) ... [2022-12-12 11:58:05,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:58:05" (1/1) ... [2022-12-12 11:58:05,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:58:05" (1/1) ... [2022-12-12 11:58:05,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:58:05" (1/1) ... [2022-12-12 11:58:05,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:58:05" (1/1) ... [2022-12-12 11:58:05,580 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:58:05" (1/1) ... [2022-12-12 11:58:05,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:58:05" (1/1) ... [2022-12-12 11:58:05,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 11:58:05,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 11:58:05,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 11:58:05,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 11:58:05,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:58:05" (1/1) ... [2022-12-12 11:58:05,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:58:05,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:58:05,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 11:58:05,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 11:58:05,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 11:58:05,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 11:58:05,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 11:58:05,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 11:58:05,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 11:58:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 11:58:05,648 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 11:58:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 11:58:05,648 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 11:58:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 11:58:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 11:58:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 11:58:05,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 11:58:05,650 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 11:58:05,790 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 11:58:05,792 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 11:58:06,096 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 11:58:06,189 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 11:58:06,190 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 11:58:06,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:58:06 BoogieIcfgContainer [2022-12-12 11:58:06,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 11:58:06,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 11:58:06,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 11:58:06,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 11:58:06,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 11:58:04" (1/3) ... [2022-12-12 11:58:06,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412a198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:58:06, skipping insertion in model container [2022-12-12 11:58:06,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:58:05" (2/3) ... [2022-12-12 11:58:06,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412a198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:58:06, skipping insertion in model container [2022-12-12 11:58:06,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:58:06" (3/3) ... [2022-12-12 11:58:06,197 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 11:58:06,210 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 11:58:06,210 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 11:58:06,210 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 11:58:06,245 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 11:58:06,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-12 11:58:06,324 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-12 11:58:06,324 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:58:06,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-12 11:58:06,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-12 11:58:06,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-12 11:58:06,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 11:58:06,344 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@68ccd1ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 11:58:06,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 11:58:06,366 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-12-12 11:58:06,366 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:58:06,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:58:06,367 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:58:06,368 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:58:06,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:58:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1629231510, now seen corresponding path program 1 times [2022-12-12 11:58:06,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:58:06,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21419116] [2022-12-12 11:58:06,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:58:06,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:58:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:58:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:58:06,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:58:06,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21419116] [2022-12-12 11:58:06,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21419116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:58:06,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:58:06,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 11:58:06,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011622359] [2022-12-12 11:58:06,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:58:06,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:58:06,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:58:06,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:58:06,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:58:06,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 91 [2022-12-12 11:58:06,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:06,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:58:06,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 91 [2022-12-12 11:58:06,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:58:06,923 INFO L130 PetriNetUnfolder]: 17/164 cut-off events. [2022-12-12 11:58:06,924 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 11:58:06,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 164 events. 17/164 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 467 event pairs, 3 based on Foata normal form. 9/166 useless extension candidates. Maximal degree in co-relation 166. Up to 27 conditions per place. [2022-12-12 11:58:06,926 INFO L137 encePairwiseOnDemand]: 86/91 looper letters, 9 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2022-12-12 11:58:06,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 204 flow [2022-12-12 11:58:06,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:58:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:58:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2022-12-12 11:58:06,935 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9267399267399268 [2022-12-12 11:58:06,938 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 0 predicate places. [2022-12-12 11:58:06,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 204 flow [2022-12-12 11:58:06,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 88 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-12 11:58:06,945 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 200 flow [2022-12-12 11:58:06,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:06,945 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:58:06,945 INFO L214 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, 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, 1, 1] [2022-12-12 11:58:06,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 11:58:06,946 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:58:06,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:58:06,946 INFO L85 PathProgramCache]: Analyzing trace with hash 420117524, now seen corresponding path program 1 times [2022-12-12 11:58:06,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:58:06,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090918648] [2022-12-12 11:58:06,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:58:06,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:58:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:58:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:58:07,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:58:07,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090918648] [2022-12-12 11:58:07,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090918648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:58:07,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:58:07,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:58:07,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545484710] [2022-12-12 11:58:07,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:58:07,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:58:07,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:58:07,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:58:07,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:58:07,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 91 [2022-12-12 11:58:07,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 200 flow. Second operand has 7 states, 7 states have (on average 64.57142857142857) internal successors, (452), 7 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:07,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:58:07,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 91 [2022-12-12 11:58:07,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:58:08,055 INFO L130 PetriNetUnfolder]: 205/610 cut-off events. [2022-12-12 11:58:08,055 INFO L131 PetriNetUnfolder]: For 91/142 co-relation queries the response was YES. [2022-12-12 11:58:08,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 610 events. 205/610 cut-off events. For 91/142 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3327 event pairs, 42 based on Foata normal form. 1/590 useless extension candidates. Maximal degree in co-relation 1091. Up to 166 conditions per place. [2022-12-12 11:58:08,063 INFO L137 encePairwiseOnDemand]: 85/91 looper letters, 27 selfloop transitions, 2 changer transitions 45/127 dead transitions. [2022-12-12 11:58:08,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 127 transitions, 448 flow [2022-12-12 11:58:08,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 11:58:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 11:58:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 621 transitions. [2022-12-12 11:58:08,070 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7582417582417582 [2022-12-12 11:58:08,072 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 6 predicate places. [2022-12-12 11:58:08,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 127 transitions, 448 flow [2022-12-12 11:58:08,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 127 transitions, 408 flow, removed 20 selfloop flow, removed 0 redundant places. [2022-12-12 11:58:08,079 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 127 transitions, 408 flow [2022-12-12 11:58:08,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 64.57142857142857) internal successors, (452), 7 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:08,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:58:08,081 INFO L214 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, 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, 1, 1, 1, 1, 1, 1] [2022-12-12 11:58:08,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 11:58:08,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:58:08,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:58:08,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2129815227, now seen corresponding path program 1 times [2022-12-12 11:58:08,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:58:08,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75264282] [2022-12-12 11:58:08,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:58:08,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:58:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:58:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:58:08,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:58:08,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75264282] [2022-12-12 11:58:08,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75264282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:58:08,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:58:08,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-12 11:58:08,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575347485] [2022-12-12 11:58:08,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:58:08,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-12 11:58:08,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:58:08,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-12 11:58:08,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-12 11:58:08,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 91 [2022-12-12 11:58:08,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 127 transitions, 408 flow. Second operand has 12 states, 12 states have (on average 59.833333333333336) internal successors, (718), 12 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:08,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:58:08,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 91 [2022-12-12 11:58:08,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:58:09,951 INFO L130 PetriNetUnfolder]: 649/1798 cut-off events. [2022-12-12 11:58:09,951 INFO L131 PetriNetUnfolder]: For 315/458 co-relation queries the response was YES. [2022-12-12 11:58:09,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3917 conditions, 1798 events. 649/1798 cut-off events. For 315/458 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13694 event pairs, 26 based on Foata normal form. 10/1792 useless extension candidates. Maximal degree in co-relation 3859. Up to 399 conditions per place. [2022-12-12 11:58:09,957 INFO L137 encePairwiseOnDemand]: 73/91 looper letters, 57 selfloop transitions, 21 changer transitions 263/390 dead transitions. [2022-12-12 11:58:09,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 390 transitions, 2182 flow [2022-12-12 11:58:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-12 11:58:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-12 11:58:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1870 transitions. [2022-12-12 11:58:09,961 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7086017430845017 [2022-12-12 11:58:09,962 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 34 predicate places. [2022-12-12 11:58:09,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 390 transitions, 2182 flow [2022-12-12 11:58:09,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 390 transitions, 2102 flow, removed 36 selfloop flow, removed 4 redundant places. [2022-12-12 11:58:09,967 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 390 transitions, 2102 flow [2022-12-12 11:58:09,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 59.833333333333336) internal successors, (718), 12 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:09,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:58:09,968 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:58:09,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 11:58:09,968 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:58:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:58:09,969 INFO L85 PathProgramCache]: Analyzing trace with hash -658198268, now seen corresponding path program 1 times [2022-12-12 11:58:09,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:58:09,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190136949] [2022-12-12 11:58:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:58:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:58:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:58:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:58:10,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:58:10,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190136949] [2022-12-12 11:58:10,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190136949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:58:10,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:58:10,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-12 11:58:10,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431423691] [2022-12-12 11:58:10,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:58:10,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 11:58:10,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:58:10,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 11:58:10,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-12 11:58:10,559 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 91 [2022-12-12 11:58:10,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 390 transitions, 2102 flow. Second operand has 10 states, 10 states have (on average 66.7) internal successors, (667), 10 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:10,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:58:10,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 91 [2022-12-12 11:58:10,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:58:10,923 INFO L130 PetriNetUnfolder]: 853/2183 cut-off events. [2022-12-12 11:58:10,923 INFO L131 PetriNetUnfolder]: For 1116/1216 co-relation queries the response was YES. [2022-12-12 11:58:10,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5633 conditions, 2183 events. 853/2183 cut-off events. For 1116/1216 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 16216 event pairs, 60 based on Foata normal form. 26/2145 useless extension candidates. Maximal degree in co-relation 5577. Up to 502 conditions per place. [2022-12-12 11:58:10,935 INFO L137 encePairwiseOnDemand]: 76/91 looper letters, 67 selfloop transitions, 39 changer transitions 252/424 dead transitions. [2022-12-12 11:58:10,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 424 transitions, 2702 flow [2022-12-12 11:58:10,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 11:58:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 11:58:10,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1123 transitions. [2022-12-12 11:58:10,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7712912087912088 [2022-12-12 11:58:10,943 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 42 predicate places. [2022-12-12 11:58:10,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 424 transitions, 2702 flow [2022-12-12 11:58:10,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 424 transitions, 2484 flow, removed 107 selfloop flow, removed 2 redundant places. [2022-12-12 11:58:10,952 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 424 transitions, 2484 flow [2022-12-12 11:58:10,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 66.7) internal successors, (667), 10 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:10,952 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:58:10,953 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:58:10,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 11:58:10,953 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:58:10,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:58:10,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1657530544, now seen corresponding path program 2 times [2022-12-12 11:58:10,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:58:10,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002458985] [2022-12-12 11:58:10,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:58:10,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:58:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:58:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:58:11,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:58:11,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002458985] [2022-12-12 11:58:11,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002458985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:58:11,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:58:11,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:58:11,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705720754] [2022-12-12 11:58:11,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:58:11,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:58:11,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:58:11,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:58:11,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:58:11,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 91 [2022-12-12 11:58:11,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 424 transitions, 2484 flow. Second operand has 6 states, 6 states have (on average 72.16666666666667) internal successors, (433), 6 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:11,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:58:11,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 91 [2022-12-12 11:58:11,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:58:11,306 INFO L130 PetriNetUnfolder]: 328/846 cut-off events. [2022-12-12 11:58:11,306 INFO L131 PetriNetUnfolder]: For 784/865 co-relation queries the response was YES. [2022-12-12 11:58:11,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 846 events. 328/846 cut-off events. For 784/865 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4589 event pairs, 5 based on Foata normal form. 7/822 useless extension candidates. Maximal degree in co-relation 2682. Up to 297 conditions per place. [2022-12-12 11:58:11,309 INFO L137 encePairwiseOnDemand]: 82/91 looper letters, 35 selfloop transitions, 6 changer transitions 118/230 dead transitions. [2022-12-12 11:58:11,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 230 transitions, 1558 flow [2022-12-12 11:58:11,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:58:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:58:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 764 transitions. [2022-12-12 11:58:11,312 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8395604395604396 [2022-12-12 11:58:11,312 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 34 predicate places. [2022-12-12 11:58:11,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 230 transitions, 1558 flow [2022-12-12 11:58:11,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 230 transitions, 1480 flow, removed 38 selfloop flow, removed 1 redundant places. [2022-12-12 11:58:11,316 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 230 transitions, 1480 flow [2022-12-12 11:58:11,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.16666666666667) internal successors, (433), 6 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:11,316 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:58:11,316 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:58:11,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 11:58:11,316 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:58:11,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:58:11,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1744436315, now seen corresponding path program 1 times [2022-12-12 11:58:11,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:58:11,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474496292] [2022-12-12 11:58:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:58:11,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:58:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:58:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:58:11,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:58:11,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474496292] [2022-12-12 11:58:11,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474496292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:58:11,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:58:11,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:58:11,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444670212] [2022-12-12 11:58:11,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:58:11,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:58:11,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:58:11,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:58:11,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:58:11,445 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 91 [2022-12-12 11:58:11,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 230 transitions, 1480 flow. Second operand has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:11,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:58:11,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 91 [2022-12-12 11:58:11,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:58:11,612 INFO L130 PetriNetUnfolder]: 257/638 cut-off events. [2022-12-12 11:58:11,612 INFO L131 PetriNetUnfolder]: For 865/1021 co-relation queries the response was YES. [2022-12-12 11:58:11,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 638 events. 257/638 cut-off events. For 865/1021 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3345 event pairs, 6 based on Foata normal form. 20/641 useless extension candidates. Maximal degree in co-relation 2421. Up to 218 conditions per place. [2022-12-12 11:58:11,615 INFO L137 encePairwiseOnDemand]: 82/91 looper letters, 25 selfloop transitions, 7 changer transitions 126/229 dead transitions. [2022-12-12 11:58:11,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 229 transitions, 1784 flow [2022-12-12 11:58:11,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 11:58:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 11:58:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 969 transitions. [2022-12-12 11:58:11,617 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8191039729501268 [2022-12-12 11:58:11,617 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 39 predicate places. [2022-12-12 11:58:11,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 229 transitions, 1784 flow [2022-12-12 11:58:11,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 229 transitions, 1510 flow, removed 123 selfloop flow, removed 4 redundant places. [2022-12-12 11:58:11,622 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 229 transitions, 1510 flow [2022-12-12 11:58:11,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:11,622 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:58:11,622 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:58:11,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 11:58:11,623 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:58:11,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:58:11,623 INFO L85 PathProgramCache]: Analyzing trace with hash 264543594, now seen corresponding path program 1 times [2022-12-12 11:58:11,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:58:11,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846159086] [2022-12-12 11:58:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:58:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:58:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:58:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:58:11,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:58:11,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846159086] [2022-12-12 11:58:11,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846159086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:58:11,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:58:11,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:58:11,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002242866] [2022-12-12 11:58:11,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:58:11,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:58:11,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:58:11,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:58:11,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:58:11,784 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 91 [2022-12-12 11:58:11,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 229 transitions, 1510 flow. Second operand has 7 states, 7 states have (on average 72.28571428571429) internal successors, (506), 7 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:11,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:58:11,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 91 [2022-12-12 11:58:11,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:58:11,940 INFO L130 PetriNetUnfolder]: 393/989 cut-off events. [2022-12-12 11:58:11,941 INFO L131 PetriNetUnfolder]: For 1221/1353 co-relation queries the response was YES. [2022-12-12 11:58:11,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3678 conditions, 989 events. 393/989 cut-off events. For 1221/1353 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5913 event pairs, 9 based on Foata normal form. 15/983 useless extension candidates. Maximal degree in co-relation 3618. Up to 335 conditions per place. [2022-12-12 11:58:11,946 INFO L137 encePairwiseOnDemand]: 85/91 looper letters, 21 selfloop transitions, 1 changer transitions 187/273 dead transitions. [2022-12-12 11:58:11,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 273 transitions, 2182 flow [2022-12-12 11:58:11,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 11:58:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 11:58:11,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 520 transitions. [2022-12-12 11:58:11,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8163265306122449 [2022-12-12 11:58:11,949 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 41 predicate places. [2022-12-12 11:58:11,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 273 transitions, 2182 flow [2022-12-12 11:58:11,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 273 transitions, 2134 flow, removed 24 selfloop flow, removed 0 redundant places. [2022-12-12 11:58:11,956 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 273 transitions, 2134 flow [2022-12-12 11:58:11,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 72.28571428571429) internal successors, (506), 7 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:11,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:58:11,957 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:58:11,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 11:58:11,957 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:58:11,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:58:11,957 INFO L85 PathProgramCache]: Analyzing trace with hash -722953116, now seen corresponding path program 2 times [2022-12-12 11:58:11,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:58:11,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625148202] [2022-12-12 11:58:11,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:58:11,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:58:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:58:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:58:12,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:58:12,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625148202] [2022-12-12 11:58:12,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625148202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:58:12,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:58:12,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-12 11:58:12,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317877563] [2022-12-12 11:58:12,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:58:12,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-12 11:58:12,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:58:12,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-12 11:58:12,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-12 11:58:12,906 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 91 [2022-12-12 11:58:12,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 273 transitions, 2134 flow. Second operand has 13 states, 13 states have (on average 62.92307692307692) internal successors, (818), 13 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:12,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:58:12,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 91 [2022-12-12 11:58:12,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:58:13,256 INFO L130 PetriNetUnfolder]: 485/1329 cut-off events. [2022-12-12 11:58:13,256 INFO L131 PetriNetUnfolder]: For 2017/2235 co-relation queries the response was YES. [2022-12-12 11:58:13,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5166 conditions, 1329 events. 485/1329 cut-off events. For 2017/2235 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9146 event pairs, 5 based on Foata normal form. 10/1322 useless extension candidates. Maximal degree in co-relation 5097. Up to 487 conditions per place. [2022-12-12 11:58:13,261 INFO L137 encePairwiseOnDemand]: 80/91 looper letters, 22 selfloop transitions, 7 changer transitions 229/311 dead transitions. [2022-12-12 11:58:13,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 311 transitions, 2900 flow [2022-12-12 11:58:13,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-12 11:58:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-12 11:58:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 770 transitions. [2022-12-12 11:58:13,263 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7051282051282052 [2022-12-12 11:58:13,264 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 52 predicate places. [2022-12-12 11:58:13,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 311 transitions, 2900 flow [2022-12-12 11:58:13,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 311 transitions, 2726 flow, removed 69 selfloop flow, removed 4 redundant places. [2022-12-12 11:58:13,271 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 311 transitions, 2726 flow [2022-12-12 11:58:13,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 62.92307692307692) internal successors, (818), 13 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:58:13,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:58:13,272 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:58:13,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 11:58:13,272 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:58:13,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:58:13,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1598872000, now seen corresponding path program 3 times [2022-12-12 11:58:13,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:58:13,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061410041] [2022-12-12 11:58:13,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:58:13,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:58:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:58:13,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 11:58:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:58:13,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 11:58:13,361 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 11:58:13,362 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 11:58:13,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-12 11:58:13,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 11:58:13,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 11:58:13,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-12 11:58:13,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 11:58:13,364 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2022-12-12 11:58:13,368 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 11:58:13,368 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 11:58:13,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 11:58:13 BasicIcfg [2022-12-12 11:58:13,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 11:58:13,442 INFO L158 Benchmark]: Toolchain (without parser) took 8443.11ms. Allocated memory was 178.3MB in the beginning and 421.5MB in the end (delta: 243.3MB). Free memory was 153.6MB in the beginning and 238.5MB in the end (delta: -84.9MB). Peak memory consumption was 159.0MB. Max. memory is 8.0GB. [2022-12-12 11:58:13,442 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 178.3MB. Free memory was 155.0MB in the beginning and 154.8MB in the end (delta: 175.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 11:58:13,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.26ms. Allocated memory is still 178.3MB. Free memory was 153.6MB in the beginning and 128.1MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-12 11:58:13,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.60ms. Allocated memory is still 178.3MB. Free memory was 128.1MB in the beginning and 125.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 11:58:13,443 INFO L158 Benchmark]: Boogie Preprocessor took 25.13ms. Allocated memory is still 178.3MB. Free memory was 125.4MB in the beginning and 123.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 11:58:13,443 INFO L158 Benchmark]: RCFGBuilder took 607.19ms. Allocated memory is still 178.3MB. Free memory was 123.9MB in the beginning and 141.7MB in the end (delta: -17.9MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. [2022-12-12 11:58:13,443 INFO L158 Benchmark]: TraceAbstraction took 7248.68ms. Allocated memory was 178.3MB in the beginning and 421.5MB in the end (delta: 243.3MB). Free memory was 140.2MB in the beginning and 238.5MB in the end (delta: -98.3MB). Peak memory consumption was 144.9MB. Max. memory is 8.0GB. [2022-12-12 11:58:13,445 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.14ms. Allocated memory is still 178.3MB. Free memory was 155.0MB in the beginning and 154.8MB in the end (delta: 175.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 494.26ms. Allocated memory is still 178.3MB. Free memory was 153.6MB in the beginning and 128.1MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.60ms. Allocated memory is still 178.3MB. Free memory was 128.1MB in the beginning and 125.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.13ms. Allocated memory is still 178.3MB. Free memory was 125.4MB in the beginning and 123.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 607.19ms. Allocated memory is still 178.3MB. Free memory was 123.9MB in the beginning and 141.7MB in the end (delta: -17.9MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7248.68ms. Allocated memory was 178.3MB in the beginning and 421.5MB in the end (delta: 243.3MB). Free memory was 140.2MB in the beginning and 238.5MB in the end (delta: -98.3MB). Peak memory consumption was 144.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L720] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L721] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L722] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L723] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L728] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L729] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L730] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L731] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L732] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L735] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 0 pthread_t t1603; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1603={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1603, ((void *)0), P0, ((void *)0))=-1, t1603={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t1604; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1604, ((void *)0), P1, ((void *)0))=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0: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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0: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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0: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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0: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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0: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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0: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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=53, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 805]: 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: 803]: 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 5 procedures, 111 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 588 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 588 mSDsluCounter, 549 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 450 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 918 IncrementalHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 99 mSDtfsCounter, 918 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2726occurred in iteration=8, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 916 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 586 NumberOfCodeBlocks, 586 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 506 ConstructedInterpolants, 0 QuantifiedInterpolants, 2880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-12-12 11:58:13,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...