/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-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:39:29,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:39:29,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:39:29,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:39:29,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:39:29,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:39:29,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:39:29,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:39:29,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:39:29,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:39:29,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:39:29,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:39:29,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:39:29,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:39:29,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:39:29,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:39:29,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:39:29,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:39:29,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:39:29,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:39:29,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:39:29,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:39:29,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:39:29,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:39:29,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:39:29,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:39:29,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:39:29,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:39:29,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:39:29,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:39:29,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:39:29,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:39:29,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:39:29,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:39:29,839 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:39:29,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:39:29,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:39:29,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:39:29,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:39:29,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:39:29,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:39:29,843 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-SemanticLbe.epf [2022-12-12 21:39:29,873 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:39:29,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:39:29,875 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:39:29,875 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:39:29,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:39:29,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:39:29,877 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:39:29,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:39:29,877 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:39:29,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:39:29,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:39:29,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:39:29,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:39:29,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:39:29,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:39:29,879 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:39:29,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:39:29,879 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:39:29,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:39:29,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:39:29,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:39:29,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:39:29,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:39:29,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:39:29,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:39:29,881 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:39:29,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:39:29,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:39:29,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:39:29,882 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:39:29,882 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_DEAD [2022-12-12 21:39:30,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:39:30,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:39:30,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:39:30,206 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:39:30,207 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:39:30,208 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 21:39:31,431 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:39:31,678 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:39:31,679 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 21:39:31,689 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27762d51e/7c61b39976c1446dab395035dbb7ff3a/FLAG404b47d2e [2022-12-12 21:39:31,705 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27762d51e/7c61b39976c1446dab395035dbb7ff3a [2022-12-12 21:39:31,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:39:31,709 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:39:31,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:39:31,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:39:31,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:39:31,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:39:31" (1/1) ... [2022-12-12 21:39:31,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ec9fcd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:31, skipping insertion in model container [2022-12-12 21:39:31,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:39:31" (1/1) ... [2022-12-12 21:39:31,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:39:31,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:39:31,914 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-12-12 21:39:32,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:39:32,152 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:39:32,165 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-12-12 21:39:32,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:32,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:32,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:39:32,247 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:39:32,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:32 WrapperNode [2022-12-12 21:39:32,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:39:32,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:39:32,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:39:32,250 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:39:32,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:32" (1/1) ... [2022-12-12 21:39:32,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:32" (1/1) ... [2022-12-12 21:39:32,320 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-12 21:39:32,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:39:32,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:39:32,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:39:32,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:39:32,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:32" (1/1) ... [2022-12-12 21:39:32,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:32" (1/1) ... [2022-12-12 21:39:32,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:32" (1/1) ... [2022-12-12 21:39:32,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:32" (1/1) ... [2022-12-12 21:39:32,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:32" (1/1) ... [2022-12-12 21:39:32,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:32" (1/1) ... [2022-12-12 21:39:32,361 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:32" (1/1) ... [2022-12-12 21:39:32,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:32" (1/1) ... [2022-12-12 21:39:32,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:39:32,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:39:32,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:39:32,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:39:32,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:32" (1/1) ... [2022-12-12 21:39:32,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:39:32,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:39:32,413 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 21:39:32,435 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 21:39:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:39:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:39:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:39:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:39:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:39:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:39:32,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:39:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:39:32,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:39:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:39:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:39:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:39:32,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:39:32,454 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 21:39:32,642 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:39:32,644 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:39:32,868 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:39:33,040 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:39:33,040 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:39:33,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:39:33 BoogieIcfgContainer [2022-12-12 21:39:33,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:39:33,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:39:33,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:39:33,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:39:33,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:39:31" (1/3) ... [2022-12-12 21:39:33,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8b4a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:39:33, skipping insertion in model container [2022-12-12 21:39:33,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:32" (2/3) ... [2022-12-12 21:39:33,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8b4a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:39:33, skipping insertion in model container [2022-12-12 21:39:33,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:39:33" (3/3) ... [2022-12-12 21:39:33,058 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 21:39:33,074 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:39:33,075 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:39:33,075 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:39:33,128 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:39:33,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2022-12-12 21:39:33,221 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-12 21:39:33,221 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:39:33,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-12 21:39:33,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2022-12-12 21:39:33,232 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2022-12-12 21:39:33,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:39:33,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-12 21:39:33,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 176 flow [2022-12-12 21:39:33,298 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-12 21:39:33,299 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:39:33,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-12 21:39:33,302 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-12 21:39:33,303 INFO L226 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-12 21:39:40,322 INFO L241 LiptonReduction]: Total number of compositions: 71 [2022-12-12 21:39:40,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:39:40,342 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;@5b046bbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:39:40,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 21:39:40,345 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-12 21:39:40,346 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:39:40,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:40,346 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 21:39:40,347 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 21:39:40,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:40,351 INFO L85 PathProgramCache]: Analyzing trace with hash 379366899, now seen corresponding path program 1 times [2022-12-12 21:39:40,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:40,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441796038] [2022-12-12 21:39:40,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:40,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:40,728 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 21:39:40,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:40,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441796038] [2022-12-12 21:39:40,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441796038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:40,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:40,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:39:40,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394057435] [2022-12-12 21:39:40,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:40,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:39:40,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:40,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:39:40,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:39:40,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 44 [2022-12-12 21:39:40,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 21:39:40,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:40,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 44 [2022-12-12 21:39:40,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:41,249 INFO L130 PetriNetUnfolder]: 944/1804 cut-off events. [2022-12-12 21:39:41,250 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 21:39:41,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 1804 events. 944/1804 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 12073 event pairs, 100 based on Foata normal form. 0/1061 useless extension candidates. Maximal degree in co-relation 3365. Up to 1325 conditions per place. [2022-12-12 21:39:41,257 INFO L137 encePairwiseOnDemand]: 40/44 looper letters, 20 selfloop transitions, 2 changer transitions 40/69 dead transitions. [2022-12-12 21:39:41,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 268 flow [2022-12-12 21:39:41,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:39:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:39:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-12 21:39:41,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2022-12-12 21:39:41,272 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2022-12-12 21:39:41,272 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 69 transitions, 268 flow [2022-12-12 21:39:41,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 29 transitions, 108 flow [2022-12-12 21:39:41,280 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 108 flow [2022-12-12 21:39:41,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 21:39:41,280 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:41,280 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:41,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:39:41,281 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 21:39:41,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:41,288 INFO L85 PathProgramCache]: Analyzing trace with hash -500557936, now seen corresponding path program 1 times [2022-12-12 21:39:41,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:41,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089258479] [2022-12-12 21:39:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:41,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:41,841 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 21:39:41,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:41,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089258479] [2022-12-12 21:39:41,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089258479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:41,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:41,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:39:41,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850359793] [2022-12-12 21:39:41,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:41,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:39:41,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:41,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:39:41,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:39:41,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2022-12-12 21:39:41,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 21:39:41,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:41,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2022-12-12 21:39:41,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:41,923 INFO L130 PetriNetUnfolder]: 173/350 cut-off events. [2022-12-12 21:39:41,924 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-12 21:39:41,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 350 events. 173/350 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1501 event pairs, 25 based on Foata normal form. 2/306 useless extension candidates. Maximal degree in co-relation 943. Up to 290 conditions per place. [2022-12-12 21:39:41,928 INFO L137 encePairwiseOnDemand]: 40/44 looper letters, 26 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-12 21:39:41,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 191 flow [2022-12-12 21:39:41,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:39:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:39:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-12 21:39:41,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2022-12-12 21:39:41,931 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -18 predicate places. [2022-12-12 21:39:41,931 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 35 transitions, 191 flow [2022-12-12 21:39:41,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 35 transitions, 191 flow [2022-12-12 21:39:41,934 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 35 transitions, 191 flow [2022-12-12 21:39:41,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 21:39:41,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:41,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:41,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:39:41,935 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 21:39:41,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:41,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1662571766, now seen corresponding path program 1 times [2022-12-12 21:39:41,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:41,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158943795] [2022-12-12 21:39:41,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:41,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:42,420 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 21:39:42,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:42,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158943795] [2022-12-12 21:39:42,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158943795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:42,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:42,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:39:42,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928055876] [2022-12-12 21:39:42,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:42,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:39:42,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:42,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:39:42,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:39:42,426 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2022-12-12 21:39:42,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 35 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 21:39:42,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:42,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2022-12-12 21:39:42,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:42,545 INFO L130 PetriNetUnfolder]: 169/352 cut-off events. [2022-12-12 21:39:42,545 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-12 21:39:42,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 352 events. 169/352 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1540 event pairs, 11 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 1230. Up to 284 conditions per place. [2022-12-12 21:39:42,547 INFO L137 encePairwiseOnDemand]: 39/44 looper letters, 29 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2022-12-12 21:39:42,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 287 flow [2022-12-12 21:39:42,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:39:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:39:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-12 21:39:42,550 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30113636363636365 [2022-12-12 21:39:42,551 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2022-12-12 21:39:42,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 40 transitions, 287 flow [2022-12-12 21:39:42,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 40 transitions, 287 flow [2022-12-12 21:39:42,554 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 40 transitions, 287 flow [2022-12-12 21:39:42,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 21:39:42,555 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:42,555 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:42,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:39:42,556 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 21:39:42,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:42,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2132275356, now seen corresponding path program 1 times [2022-12-12 21:39:42,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:42,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872854472] [2022-12-12 21:39:42,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:42,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:42,956 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 21:39:42,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:42,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872854472] [2022-12-12 21:39:42,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872854472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:42,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:42,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:39:42,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32123065] [2022-12-12 21:39:42,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:42,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:39:42,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:42,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:39:42,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:39:42,961 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2022-12-12 21:39:42,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 40 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 21:39:42,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:42,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2022-12-12 21:39:42,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:43,073 INFO L130 PetriNetUnfolder]: 204/386 cut-off events. [2022-12-12 21:39:43,076 INFO L131 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2022-12-12 21:39:43,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 386 events. 204/386 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1588 event pairs, 21 based on Foata normal form. 1/337 useless extension candidates. Maximal degree in co-relation 1723. Up to 320 conditions per place. [2022-12-12 21:39:43,079 INFO L137 encePairwiseOnDemand]: 38/44 looper letters, 35 selfloop transitions, 9 changer transitions 0/49 dead transitions. [2022-12-12 21:39:43,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 448 flow [2022-12-12 21:39:43,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:39:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:39:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-12 21:39:43,085 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2022-12-12 21:39:43,086 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -12 predicate places. [2022-12-12 21:39:43,086 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 49 transitions, 448 flow [2022-12-12 21:39:43,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 49 transitions, 448 flow [2022-12-12 21:39:43,089 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 49 transitions, 448 flow [2022-12-12 21:39:43,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 21:39:43,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:43,090 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:43,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:39:43,090 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 21:39:43,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:43,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1299626988, now seen corresponding path program 2 times [2022-12-12 21:39:43,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:43,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509837138] [2022-12-12 21:39:43,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:43,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:43,474 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 21:39:43,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:43,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509837138] [2022-12-12 21:39:43,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509837138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:43,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:43,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:39:43,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449559519] [2022-12-12 21:39:43,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:43,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:39:43,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:43,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:39:43,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:39:43,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2022-12-12 21:39:43,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 49 transitions, 448 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 21:39:43,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:43,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2022-12-12 21:39:43,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:43,658 INFO L130 PetriNetUnfolder]: 212/400 cut-off events. [2022-12-12 21:39:43,659 INFO L131 PetriNetUnfolder]: For 195/195 co-relation queries the response was YES. [2022-12-12 21:39:43,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2156 conditions, 400 events. 212/400 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1636 event pairs, 24 based on Foata normal form. 8/356 useless extension candidates. Maximal degree in co-relation 2134. Up to 324 conditions per place. [2022-12-12 21:39:43,663 INFO L137 encePairwiseOnDemand]: 37/44 looper letters, 40 selfloop transitions, 14 changer transitions 0/59 dead transitions. [2022-12-12 21:39:43,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 648 flow [2022-12-12 21:39:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:39:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:39:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-12 21:39:43,666 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29545454545454547 [2022-12-12 21:39:43,668 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2022-12-12 21:39:43,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 59 transitions, 648 flow [2022-12-12 21:39:43,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 59 transitions, 648 flow [2022-12-12 21:39:43,672 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 59 transitions, 648 flow [2022-12-12 21:39:43,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 21:39:43,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:43,673 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:43,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:39:43,673 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 21:39:43,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1676890108, now seen corresponding path program 1 times [2022-12-12 21:39:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:43,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550506512] [2022-12-12 21:39:43,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:43,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:44,054 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 21:39:44,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:44,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550506512] [2022-12-12 21:39:44,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550506512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:44,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:44,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:39:44,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741205686] [2022-12-12 21:39:44,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:44,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:39:44,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:44,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:39:44,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:39:44,057 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2022-12-12 21:39:44,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 59 transitions, 648 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 21:39:44,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:44,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2022-12-12 21:39:44,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:44,177 INFO L130 PetriNetUnfolder]: 223/418 cut-off events. [2022-12-12 21:39:44,177 INFO L131 PetriNetUnfolder]: For 414/414 co-relation queries the response was YES. [2022-12-12 21:39:44,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 418 events. 223/418 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1717 event pairs, 22 based on Foata normal form. 2/368 useless extension candidates. Maximal degree in co-relation 2580. Up to 339 conditions per place. [2022-12-12 21:39:44,182 INFO L137 encePairwiseOnDemand]: 37/44 looper letters, 46 selfloop transitions, 13 changer transitions 0/66 dead transitions. [2022-12-12 21:39:44,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 850 flow [2022-12-12 21:39:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:39:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:39:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-12 21:39:44,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2909090909090909 [2022-12-12 21:39:44,197 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2022-12-12 21:39:44,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 66 transitions, 850 flow [2022-12-12 21:39:44,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 66 transitions, 850 flow [2022-12-12 21:39:44,201 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 66 transitions, 850 flow [2022-12-12 21:39:44,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 21:39:44,202 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:44,202 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:44,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:39:44,202 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 21:39:44,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:44,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1675938718, now seen corresponding path program 2 times [2022-12-12 21:39:44,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:44,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357847186] [2022-12-12 21:39:44,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:44,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:44,740 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 21:39:44,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:44,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357847186] [2022-12-12 21:39:44,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357847186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:44,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:44,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:39:44,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171114007] [2022-12-12 21:39:44,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:44,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:39:44,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:44,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:39:44,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:39:44,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2022-12-12 21:39:44,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 66 transitions, 850 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 21:39:44,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:44,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2022-12-12 21:39:44,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:44,950 INFO L130 PetriNetUnfolder]: 237/445 cut-off events. [2022-12-12 21:39:44,950 INFO L131 PetriNetUnfolder]: For 382/382 co-relation queries the response was YES. [2022-12-12 21:39:44,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3212 conditions, 445 events. 237/445 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1863 event pairs, 22 based on Foata normal form. 5/394 useless extension candidates. Maximal degree in co-relation 3184. Up to 366 conditions per place. [2022-12-12 21:39:44,955 INFO L137 encePairwiseOnDemand]: 36/44 looper letters, 57 selfloop transitions, 22 changer transitions 0/84 dead transitions. [2022-12-12 21:39:44,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 1224 flow [2022-12-12 21:39:44,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:39:44,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:39:44,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-12-12 21:39:44,957 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.262987012987013 [2022-12-12 21:39:44,957 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2022-12-12 21:39:44,957 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 84 transitions, 1224 flow [2022-12-12 21:39:44,962 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 84 transitions, 1224 flow [2022-12-12 21:39:44,962 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 84 transitions, 1224 flow [2022-12-12 21:39:44,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 21:39:44,963 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:44,963 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:44,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:39:44,963 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 21:39:44,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash 5610311, now seen corresponding path program 1 times [2022-12-12 21:39:44,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:44,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822484184] [2022-12-12 21:39:44,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:44,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:45,052 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 21:39:45,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:45,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822484184] [2022-12-12 21:39:45,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822484184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:45,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:45,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:39:45,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697020420] [2022-12-12 21:39:45,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:45,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:39:45,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:45,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:39:45,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:39:45,054 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2022-12-12 21:39:45,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 84 transitions, 1224 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 21:39:45,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:45,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2022-12-12 21:39:45,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:45,136 INFO L130 PetriNetUnfolder]: 170/358 cut-off events. [2022-12-12 21:39:45,136 INFO L131 PetriNetUnfolder]: For 1031/1033 co-relation queries the response was YES. [2022-12-12 21:39:45,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2812 conditions, 358 events. 170/358 cut-off events. For 1031/1033 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1586 event pairs, 22 based on Foata normal form. 22/344 useless extension candidates. Maximal degree in co-relation 2781. Up to 286 conditions per place. [2022-12-12 21:39:45,140 INFO L137 encePairwiseOnDemand]: 36/44 looper letters, 46 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2022-12-12 21:39:45,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 1115 flow [2022-12-12 21:39:45,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:39:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:39:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-12 21:39:45,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2022-12-12 21:39:45,142 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2022-12-12 21:39:45,142 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 70 transitions, 1115 flow [2022-12-12 21:39:45,145 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 70 transitions, 1115 flow [2022-12-12 21:39:45,146 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 70 transitions, 1115 flow [2022-12-12 21:39:45,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 21:39:45,146 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:45,146 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:45,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:39:45,146 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 21:39:45,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:45,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1507059096, now seen corresponding path program 1 times [2022-12-12 21:39:45,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:45,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500986768] [2022-12-12 21:39:45,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:45,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:45,256 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 21:39:45,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:45,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500986768] [2022-12-12 21:39:45,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500986768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:45,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:45,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:39:45,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719776246] [2022-12-12 21:39:45,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:45,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:39:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:45,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:39:45,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:39:45,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2022-12-12 21:39:45,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 70 transitions, 1115 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 21:39:45,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:45,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2022-12-12 21:39:45,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:45,352 INFO L130 PetriNetUnfolder]: 53/157 cut-off events. [2022-12-12 21:39:45,352 INFO L131 PetriNetUnfolder]: For 791/801 co-relation queries the response was YES. [2022-12-12 21:39:45,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 157 events. 53/157 cut-off events. For 791/801 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 596 event pairs, 2 based on Foata normal form. 40/179 useless extension candidates. Maximal degree in co-relation 1323. Up to 118 conditions per place. [2022-12-12 21:39:45,354 INFO L137 encePairwiseOnDemand]: 36/44 looper letters, 34 selfloop transitions, 19 changer transitions 1/64 dead transitions. [2022-12-12 21:39:45,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 1113 flow [2022-12-12 21:39:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:39:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:39:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-12 21:39:45,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2840909090909091 [2022-12-12 21:39:45,356 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2022-12-12 21:39:45,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 64 transitions, 1113 flow [2022-12-12 21:39:45,358 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 63 transitions, 1111 flow [2022-12-12 21:39:45,359 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 63 transitions, 1111 flow [2022-12-12 21:39:45,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 21:39:45,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:45,359 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:45,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:39:45,359 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 21:39:45,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:45,360 INFO L85 PathProgramCache]: Analyzing trace with hash -830371609, now seen corresponding path program 1 times [2022-12-12 21:39:45,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:45,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65973120] [2022-12-12 21:39:45,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:45,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:45,500 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 21:39:45,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:45,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65973120] [2022-12-12 21:39:45,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65973120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:45,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:45,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:39:45,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219521321] [2022-12-12 21:39:45,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:45,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:39:45,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:45,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:39:45,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:39:45,502 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2022-12-12 21:39:45,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 63 transitions, 1111 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 21:39:45,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:45,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2022-12-12 21:39:45,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:45,578 INFO L130 PetriNetUnfolder]: 74/226 cut-off events. [2022-12-12 21:39:45,578 INFO L131 PetriNetUnfolder]: For 886/887 co-relation queries the response was YES. [2022-12-12 21:39:45,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2171 conditions, 226 events. 74/226 cut-off events. For 886/887 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1074 event pairs, 0 based on Foata normal form. 10/206 useless extension candidates. Maximal degree in co-relation 2134. Up to 179 conditions per place. [2022-12-12 21:39:45,580 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 30 selfloop transitions, 3 changer transitions 50/90 dead transitions. [2022-12-12 21:39:45,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 90 transitions, 1802 flow [2022-12-12 21:39:45,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:39:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:39:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-12 21:39:45,581 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2022-12-12 21:39:45,582 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2022-12-12 21:39:45,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 90 transitions, 1802 flow [2022-12-12 21:39:45,584 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 40 transitions, 774 flow [2022-12-12 21:39:45,584 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 774 flow [2022-12-12 21:39:45,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 21:39:45,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:45,584 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:45,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:39:45,584 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 21:39:45,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:45,585 INFO L85 PathProgramCache]: Analyzing trace with hash -919930953, now seen corresponding path program 2 times [2022-12-12 21:39:45,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:45,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712238886] [2022-12-12 21:39:45,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:39:45,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:39:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:39:45,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:39:45,658 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:39:45,659 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 21:39:45,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-12 21:39:45,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 21:39:45,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 21:39:45,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-12 21:39:45,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:39:45,661 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1] [2022-12-12 21:39:45,666 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:39:45,666 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:39:45,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:39:45 BasicIcfg [2022-12-12 21:39:45,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:39:45,725 INFO L158 Benchmark]: Toolchain (without parser) took 14016.93ms. Allocated memory was 183.5MB in the beginning and 374.3MB in the end (delta: 190.8MB). Free memory was 148.3MB in the beginning and 224.5MB in the end (delta: -76.2MB). Peak memory consumption was 115.7MB. Max. memory is 8.0GB. [2022-12-12 21:39:45,726 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 160.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:39:45,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.69ms. Allocated memory is still 183.5MB. Free memory was 147.8MB in the beginning and 123.1MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-12 21:39:45,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.16ms. Allocated memory is still 183.5MB. Free memory was 123.1MB in the beginning and 120.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 21:39:45,728 INFO L158 Benchmark]: Boogie Preprocessor took 43.81ms. Allocated memory is still 183.5MB. Free memory was 120.5MB in the beginning and 118.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 21:39:45,728 INFO L158 Benchmark]: RCFGBuilder took 683.07ms. Allocated memory is still 183.5MB. Free memory was 118.9MB in the beginning and 87.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-12 21:39:45,728 INFO L158 Benchmark]: TraceAbstraction took 12674.21ms. Allocated memory was 183.5MB in the beginning and 374.3MB in the end (delta: 190.8MB). Free memory was 86.4MB in the beginning and 224.5MB in the end (delta: -138.1MB). Peak memory consumption was 53.8MB. Max. memory is 8.0GB. [2022-12-12 21:39:45,729 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.12ms. Allocated memory is still 183.5MB. Free memory is still 160.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 538.69ms. Allocated memory is still 183.5MB. Free memory was 147.8MB in the beginning and 123.1MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.16ms. Allocated memory is still 183.5MB. Free memory was 123.1MB in the beginning and 120.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.81ms. Allocated memory is still 183.5MB. Free memory was 120.5MB in the beginning and 118.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 683.07ms. Allocated memory is still 183.5MB. Free memory was 118.9MB in the beginning and 87.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 12674.21ms. Allocated memory was 183.5MB in the beginning and 374.3MB in the end (delta: 190.8MB). Free memory was 86.4MB in the beginning and 224.5MB in the end (delta: -138.1MB). Peak memory consumption was 53.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 90 PlacesBefore, 51 PlacesAfterwards, 85 TransitionsBefore, 44 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 32 ConcurrentYvCompositions, 2 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 1427, independent unconditional: 0, dependent: 200, dependent conditional: 200, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 892, independent: 839, independent conditional: 0, independent unconditional: 839, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 892, independent: 822, independent conditional: 0, independent unconditional: 822, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 523, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 501, dependent conditional: 0, dependent unconditional: 501, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1627, independent: 588, independent conditional: 0, independent unconditional: 588, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 892, unknown conditional: 0, unknown unconditional: 892] , Statistics on independence cache: Total cache size (in pairs): 1335, Positive cache size: 1282, Positive conditional cache size: 0, Positive unconditional cache size: 1282, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-2, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=-1, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - 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: 793]: 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: 795]: 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, 105 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 519 IncrementalHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 12 mSDtfsCounter, 519 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1224occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 1190 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 719 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 21:39:45,748 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...