/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:49:31,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:49:31,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:49:31,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:49:31,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:49:31,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:49:31,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:49:31,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:49:31,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:49:31,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:49:31,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:49:31,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:49:31,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:49:31,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:49:31,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:49:31,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:49:31,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:49:31,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:49:31,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:49:31,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:49:31,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:49:31,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:49:31,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:49:31,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:49:31,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:49:31,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:49:31,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:49:31,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:49:31,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:49:31,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:49:31,736 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:49:31,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:49:31,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:49:31,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:49:31,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:49:31,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:49:31,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:49:31,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:49:31,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:49:31,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:49:31,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:49:31,740 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-VariableLbe.epf [2023-01-28 00:49:31,752 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:49:31,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:49:31,753 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:49:31,753 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:49:31,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:49:31,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:49:31,754 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:49:31,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:49:31,754 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:49:31,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:49:31,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:49:31,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:49:31,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:49:31,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:49:31,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:49:31,754 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:49:31,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:49:31,755 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:49:31,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:49:31,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:49:31,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:49:31,755 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:49:31,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:49:31,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:49:31,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:49:31,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:49:31,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:49:31,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:49:31,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:49:31,756 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:49:31,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:49:31,756 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:49:31,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:49:31,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:49:31,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:49:31,933 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:49:31,935 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:49:31,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2023-01-28 00:49:32,905 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:49:33,188 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:49:33,189 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2023-01-28 00:49:33,204 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79a8c8c8/85b89768ef514d45a0d3ac533811c177/FLAG77169349c [2023-01-28 00:49:33,219 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79a8c8c8/85b89768ef514d45a0d3ac533811c177 [2023-01-28 00:49:33,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:49:33,223 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:49:33,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:49:33,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:49:33,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:49:33,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:49:33" (1/1) ... [2023-01-28 00:49:33,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5dfb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:33, skipping insertion in model container [2023-01-28 00:49:33,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:49:33" (1/1) ... [2023-01-28 00:49:33,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:49:33,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:49:33,396 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2023-01-28 00:49:33,569 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:49:33,578 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:49:33,587 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2023-01-28 00:49:33,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:49:33,660 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:49:33,660 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:49:33,664 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:49:33,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:33 WrapperNode [2023-01-28 00:49:33,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:49:33,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:49:33,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:49:33,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:49:33,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:33" (1/1) ... [2023-01-28 00:49:33,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:33" (1/1) ... [2023-01-28 00:49:33,719 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-01-28 00:49:33,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:49:33,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:49:33,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:49:33,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:49:33,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:33" (1/1) ... [2023-01-28 00:49:33,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:33" (1/1) ... [2023-01-28 00:49:33,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:33" (1/1) ... [2023-01-28 00:49:33,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:33" (1/1) ... [2023-01-28 00:49:33,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:33" (1/1) ... [2023-01-28 00:49:33,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:33" (1/1) ... [2023-01-28 00:49:33,751 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:33" (1/1) ... [2023-01-28 00:49:33,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:33" (1/1) ... [2023-01-28 00:49:33,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:49:33,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:49:33,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:49:33,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:49:33,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:33" (1/1) ... [2023-01-28 00:49:33,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:49:33,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:49:33,786 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) [2023-01-28 00:49:33,792 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 [2023-01-28 00:49:33,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:49:33,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:49:33,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:49:33,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:49:33,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:49:33,812 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:49:33,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:49:33,813 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:49:33,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:49:33,813 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:49:33,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:49:33,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:49:33,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:49:33,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:49:33,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:49:33,815 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:49:33,924 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:49:33,926 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:49:34,152 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:49:34,251 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:49:34,251 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:49:34,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:49:34 BoogieIcfgContainer [2023-01-28 00:49:34,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:49:34,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:49:34,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:49:34,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:49:34,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:49:33" (1/3) ... [2023-01-28 00:49:34,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8b2fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:49:34, skipping insertion in model container [2023-01-28 00:49:34,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:33" (2/3) ... [2023-01-28 00:49:34,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8b2fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:49:34, skipping insertion in model container [2023-01-28 00:49:34,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:49:34" (3/3) ... [2023-01-28 00:49:34,260 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2023-01-28 00:49:34,272 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:49:34,272 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:49:34,272 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:49:34,303 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:49:34,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2023-01-28 00:49:34,351 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-01-28 00:49:34,351 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:49:34,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 00:49:34,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2023-01-28 00:49:34,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2023-01-28 00:49:34,360 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:49:34,366 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2023-01-28 00:49:34,368 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2023-01-28 00:49:34,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2023-01-28 00:49:34,383 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-01-28 00:49:34,383 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:49:34,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 00:49:34,385 INFO L119 LiptonReduction]: Number of co-enabled transitions 1776 [2023-01-28 00:49:37,592 INFO L134 LiptonReduction]: Checked pairs total: 4380 [2023-01-28 00:49:37,592 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-01-28 00:49:37,602 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:49:37,606 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;@12b28d79, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:49:37,606 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 00:49:37,610 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2023-01-28 00:49:37,610 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:49:37,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:37,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:37,612 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:37,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:37,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1908164489, now seen corresponding path program 1 times [2023-01-28 00:49:37,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:37,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270153229] [2023-01-28 00:49:37,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:37,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:37,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:37,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270153229] [2023-01-28 00:49:37,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270153229] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:37,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:37,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:49:37,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046702569] [2023-01-28 00:49:37,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:37,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:49:37,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:37,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:49:37,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:49:37,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 200 [2023-01-28 00:49:37,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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) [2023-01-28 00:49:37,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:37,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 200 [2023-01-28 00:49:37,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:38,060 INFO L130 PetriNetUnfolder]: 511/847 cut-off events. [2023-01-28 00:49:38,060 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-01-28 00:49:38,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 847 events. 511/847 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4011 event pairs, 112 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1655. Up to 580 conditions per place. [2023-01-28 00:49:38,065 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 23 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2023-01-28 00:49:38,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 123 flow [2023-01-28 00:49:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:49:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:49:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-01-28 00:49:38,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5116666666666667 [2023-01-28 00:49:38,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-01-28 00:49:38,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-01-28 00:49:38,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:38,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-01-28 00:49:38,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:38,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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) [2023-01-28 00:49:38,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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) [2023-01-28 00:49:38,085 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 307 transitions. [2023-01-28 00:49:38,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 123 flow [2023-01-28 00:49:38,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:49:38,088 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-01-28 00:49:38,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-01-28 00:49:38,091 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-01-28 00:49:38,091 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-01-28 00:49:38,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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) [2023-01-28 00:49:38,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:38,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:38,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:49:38,092 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:38,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:38,092 INFO L85 PathProgramCache]: Analyzing trace with hash -204910542, now seen corresponding path program 1 times [2023-01-28 00:49:38,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:38,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885959811] [2023-01-28 00:49:38,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:38,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:38,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:38,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885959811] [2023-01-28 00:49:38,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885959811] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:38,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:38,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:49:38,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930485247] [2023-01-28 00:49:38,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:38,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:49:38,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:38,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:49:38,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:49:38,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 200 [2023-01-28 00:49:38,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 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) [2023-01-28 00:49:38,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:38,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 200 [2023-01-28 00:49:38,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:39,021 INFO L130 PetriNetUnfolder]: 1018/1526 cut-off events. [2023-01-28 00:49:39,022 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2023-01-28 00:49:39,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3181 conditions, 1526 events. 1018/1526 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6386 event pairs, 201 based on Foata normal form. 30/1556 useless extension candidates. Maximal degree in co-relation 3171. Up to 1286 conditions per place. [2023-01-28 00:49:39,029 INFO L137 encePairwiseOnDemand]: 192/200 looper letters, 34 selfloop transitions, 9 changer transitions 0/43 dead transitions. [2023-01-28 00:49:39,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 43 transitions, 188 flow [2023-01-28 00:49:39,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:49:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:49:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2023-01-28 00:49:39,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46125 [2023-01-28 00:49:39,034 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 369 transitions. [2023-01-28 00:49:39,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 369 transitions. [2023-01-28 00:49:39,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:39,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 369 transitions. [2023-01-28 00:49:39,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 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) [2023-01-28 00:49:39,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 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) [2023-01-28 00:49:39,039 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 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) [2023-01-28 00:49:39,039 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 4 states and 369 transitions. [2023-01-28 00:49:39,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 43 transitions, 188 flow [2023-01-28 00:49:39,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 43 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:49:39,041 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 102 flow [2023-01-28 00:49:39,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2023-01-28 00:49:39,042 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-01-28 00:49:39,042 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 102 flow [2023-01-28 00:49:39,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 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) [2023-01-28 00:49:39,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:39,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:39,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:49:39,043 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:39,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:39,046 INFO L85 PathProgramCache]: Analyzing trace with hash -2057260820, now seen corresponding path program 1 times [2023-01-28 00:49:39,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:39,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267010808] [2023-01-28 00:49:39,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:39,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:39,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:39,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267010808] [2023-01-28 00:49:39,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267010808] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:39,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:39,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:49:39,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027288239] [2023-01-28 00:49:39,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:39,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:49:39,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:39,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:49:39,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:49:39,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 200 [2023-01-28 00:49:39,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 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) [2023-01-28 00:49:39,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:39,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 200 [2023-01-28 00:49:39,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:39,693 INFO L130 PetriNetUnfolder]: 821/1286 cut-off events. [2023-01-28 00:49:39,693 INFO L131 PetriNetUnfolder]: For 518/518 co-relation queries the response was YES. [2023-01-28 00:49:39,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3472 conditions, 1286 events. 821/1286 cut-off events. For 518/518 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5793 event pairs, 194 based on Foata normal form. 15/1247 useless extension candidates. Maximal degree in co-relation 3460. Up to 930 conditions per place. [2023-01-28 00:49:39,700 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 29 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-01-28 00:49:39,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 187 flow [2023-01-28 00:49:39,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:49:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:49:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2023-01-28 00:49:39,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49 [2023-01-28 00:49:39,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 294 transitions. [2023-01-28 00:49:39,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 294 transitions. [2023-01-28 00:49:39,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:39,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 294 transitions. [2023-01-28 00:49:39,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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) [2023-01-28 00:49:39,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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) [2023-01-28 00:49:39,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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) [2023-01-28 00:49:39,704 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 102 flow. Second operand 3 states and 294 transitions. [2023-01-28 00:49:39,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 187 flow [2023-01-28 00:49:39,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 187 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 00:49:39,707 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 110 flow [2023-01-28 00:49:39,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-01-28 00:49:39,708 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-01-28 00:49:39,711 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 110 flow [2023-01-28 00:49:39,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 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) [2023-01-28 00:49:39,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:39,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:39,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:49:39,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:39,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:39,712 INFO L85 PathProgramCache]: Analyzing trace with hash -537290992, now seen corresponding path program 1 times [2023-01-28 00:49:39,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:39,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199406973] [2023-01-28 00:49:39,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:39,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:40,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:40,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199406973] [2023-01-28 00:49:40,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199406973] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:40,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:40,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:49:40,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95228864] [2023-01-28 00:49:40,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:40,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:49:40,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:40,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:49:40,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:49:40,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-01-28 00:49:40,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:40,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:40,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-01-28 00:49:40,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:40,274 INFO L130 PetriNetUnfolder]: 842/1327 cut-off events. [2023-01-28 00:49:40,274 INFO L131 PetriNetUnfolder]: For 794/808 co-relation queries the response was YES. [2023-01-28 00:49:40,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3745 conditions, 1327 events. 842/1327 cut-off events. For 794/808 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6195 event pairs, 184 based on Foata normal form. 46/1316 useless extension candidates. Maximal degree in co-relation 3730. Up to 714 conditions per place. [2023-01-28 00:49:40,310 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 38 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2023-01-28 00:49:40,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 267 flow [2023-01-28 00:49:40,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:49:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:49:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 388 transitions. [2023-01-28 00:49:40,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.485 [2023-01-28 00:49:40,312 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 388 transitions. [2023-01-28 00:49:40,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 388 transitions. [2023-01-28 00:49:40,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:40,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 388 transitions. [2023-01-28 00:49:40,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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) [2023-01-28 00:49:40,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 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) [2023-01-28 00:49:40,314 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 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) [2023-01-28 00:49:40,314 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 110 flow. Second operand 4 states and 388 transitions. [2023-01-28 00:49:40,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 267 flow [2023-01-28 00:49:40,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:49:40,317 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 144 flow [2023-01-28 00:49:40,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-01-28 00:49:40,317 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-01-28 00:49:40,318 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 144 flow [2023-01-28 00:49:40,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:40,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:40,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:40,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:49:40,318 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:40,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:40,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1342710007, now seen corresponding path program 1 times [2023-01-28 00:49:40,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:40,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198885086] [2023-01-28 00:49:40,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:40,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:40,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198885086] [2023-01-28 00:49:40,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198885086] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:40,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:40,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:49:40,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556322676] [2023-01-28 00:49:40,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:40,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:49:40,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:40,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:49:40,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:49:40,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 200 [2023-01-28 00:49:40,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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) [2023-01-28 00:49:40,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:40,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 200 [2023-01-28 00:49:40,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:40,609 INFO L130 PetriNetUnfolder]: 929/1481 cut-off events. [2023-01-28 00:49:40,609 INFO L131 PetriNetUnfolder]: For 1409/1409 co-relation queries the response was YES. [2023-01-28 00:49:40,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4549 conditions, 1481 events. 929/1481 cut-off events. For 1409/1409 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7387 event pairs, 420 based on Foata normal form. 40/1483 useless extension candidates. Maximal degree in co-relation 4533. Up to 744 conditions per place. [2023-01-28 00:49:40,615 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 33 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-01-28 00:49:40,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 258 flow [2023-01-28 00:49:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:49:40,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:49:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2023-01-28 00:49:40,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016666666666667 [2023-01-28 00:49:40,617 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2023-01-28 00:49:40,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2023-01-28 00:49:40,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:40,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2023-01-28 00:49:40,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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) [2023-01-28 00:49:40,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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) [2023-01-28 00:49:40,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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) [2023-01-28 00:49:40,620 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 144 flow. Second operand 3 states and 301 transitions. [2023-01-28 00:49:40,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 258 flow [2023-01-28 00:49:40,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:49:40,622 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 151 flow [2023-01-28 00:49:40,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-01-28 00:49:40,624 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2023-01-28 00:49:40,624 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 151 flow [2023-01-28 00:49:40,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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) [2023-01-28 00:49:40,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:40,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:40,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:49:40,625 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:40,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:40,625 INFO L85 PathProgramCache]: Analyzing trace with hash -115031331, now seen corresponding path program 1 times [2023-01-28 00:49:40,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:40,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864965808] [2023-01-28 00:49:40,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:40,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:40,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:40,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864965808] [2023-01-28 00:49:40,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864965808] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:40,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:40,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:49:40,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027253157] [2023-01-28 00:49:40,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:40,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:49:40,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:40,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:49:40,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:49:40,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-01-28 00:49:40,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 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) [2023-01-28 00:49:40,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:40,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-01-28 00:49:40,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:40,962 INFO L130 PetriNetUnfolder]: 706/1195 cut-off events. [2023-01-28 00:49:40,962 INFO L131 PetriNetUnfolder]: For 1435/1509 co-relation queries the response was YES. [2023-01-28 00:49:40,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 1195 events. 706/1195 cut-off events. For 1435/1509 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6434 event pairs, 144 based on Foata normal form. 189/1333 useless extension candidates. Maximal degree in co-relation 3705. Up to 713 conditions per place. [2023-01-28 00:49:40,966 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 39 selfloop transitions, 5 changer transitions 31/80 dead transitions. [2023-01-28 00:49:40,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 80 transitions, 549 flow [2023-01-28 00:49:40,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:49:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:49:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2023-01-28 00:49:40,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483 [2023-01-28 00:49:40,968 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions. [2023-01-28 00:49:40,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions. [2023-01-28 00:49:40,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:40,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions. [2023-01-28 00:49:40,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 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) [2023-01-28 00:49:40,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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) [2023-01-28 00:49:40,972 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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) [2023-01-28 00:49:40,972 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 151 flow. Second operand 5 states and 483 transitions. [2023-01-28 00:49:40,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 80 transitions, 549 flow [2023-01-28 00:49:40,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 80 transitions, 539 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:49:40,976 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 193 flow [2023-01-28 00:49:40,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-01-28 00:49:40,977 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-01-28 00:49:40,977 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 193 flow [2023-01-28 00:49:40,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 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) [2023-01-28 00:49:40,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:40,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:40,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:49:40,978 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:40,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:40,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1343625227, now seen corresponding path program 1 times [2023-01-28 00:49:40,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:40,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095302551] [2023-01-28 00:49:40,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:40,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:41,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:41,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095302551] [2023-01-28 00:49:41,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095302551] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:41,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:41,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:49:41,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369730679] [2023-01-28 00:49:41,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:41,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:49:41,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:41,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:49:41,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:49:41,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-01-28 00:49:41,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 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) [2023-01-28 00:49:41,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:41,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-01-28 00:49:41,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:41,307 INFO L130 PetriNetUnfolder]: 425/766 cut-off events. [2023-01-28 00:49:41,308 INFO L131 PetriNetUnfolder]: For 1456/1543 co-relation queries the response was YES. [2023-01-28 00:49:41,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2926 conditions, 766 events. 425/766 cut-off events. For 1456/1543 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3919 event pairs, 58 based on Foata normal form. 147/887 useless extension candidates. Maximal degree in co-relation 2906. Up to 298 conditions per place. [2023-01-28 00:49:41,311 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 46 selfloop transitions, 9 changer transitions 42/102 dead transitions. [2023-01-28 00:49:41,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 102 transitions, 763 flow [2023-01-28 00:49:41,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:49:41,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:49:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 673 transitions. [2023-01-28 00:49:41,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807142857142857 [2023-01-28 00:49:41,313 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 673 transitions. [2023-01-28 00:49:41,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 673 transitions. [2023-01-28 00:49:41,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:41,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 673 transitions. [2023-01-28 00:49:41,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 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) [2023-01-28 00:49:41,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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) [2023-01-28 00:49:41,316 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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) [2023-01-28 00:49:41,316 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 193 flow. Second operand 7 states and 673 transitions. [2023-01-28 00:49:41,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 102 transitions, 763 flow [2023-01-28 00:49:41,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 102 transitions, 747 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-01-28 00:49:41,321 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 239 flow [2023-01-28 00:49:41,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-01-28 00:49:41,322 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2023-01-28 00:49:41,322 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 239 flow [2023-01-28 00:49:41,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 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) [2023-01-28 00:49:41,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:41,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:41,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:49:41,323 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:41,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:41,323 INFO L85 PathProgramCache]: Analyzing trace with hash 318972699, now seen corresponding path program 1 times [2023-01-28 00:49:41,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:41,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081090339] [2023-01-28 00:49:41,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:41,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:41,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:41,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081090339] [2023-01-28 00:49:41,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081090339] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:41,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:41,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:49:41,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326849452] [2023-01-28 00:49:41,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:41,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:49:41,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:41,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:49:41,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:49:41,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-01-28 00:49:41,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 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) [2023-01-28 00:49:41,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:41,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-01-28 00:49:41,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:41,639 INFO L130 PetriNetUnfolder]: 345/630 cut-off events. [2023-01-28 00:49:41,639 INFO L131 PetriNetUnfolder]: For 1493/1560 co-relation queries the response was YES. [2023-01-28 00:49:41,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2621 conditions, 630 events. 345/630 cut-off events. For 1493/1560 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3237 event pairs, 46 based on Foata normal form. 58/657 useless extension candidates. Maximal degree in co-relation 2599. Up to 234 conditions per place. [2023-01-28 00:49:41,644 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 44 selfloop transitions, 12 changer transitions 40/99 dead transitions. [2023-01-28 00:49:41,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 99 transitions, 778 flow [2023-01-28 00:49:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:49:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:49:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 845 transitions. [2023-01-28 00:49:41,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2023-01-28 00:49:41,646 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 845 transitions. [2023-01-28 00:49:41,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 845 transitions. [2023-01-28 00:49:41,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:41,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 845 transitions. [2023-01-28 00:49:41,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.88888888888889) internal successors, (845), 9 states have internal predecessors, (845), 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) [2023-01-28 00:49:41,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 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) [2023-01-28 00:49:41,650 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 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) [2023-01-28 00:49:41,650 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 239 flow. Second operand 9 states and 845 transitions. [2023-01-28 00:49:41,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 99 transitions, 778 flow [2023-01-28 00:49:41,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 99 transitions, 740 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-01-28 00:49:41,655 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 226 flow [2023-01-28 00:49:41,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=226, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2023-01-28 00:49:41,657 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2023-01-28 00:49:41,657 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 226 flow [2023-01-28 00:49:41,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 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) [2023-01-28 00:49:41,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:41,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:41,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:49:41,658 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:41,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:41,658 INFO L85 PathProgramCache]: Analyzing trace with hash 913233209, now seen corresponding path program 1 times [2023-01-28 00:49:41,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:41,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365650322] [2023-01-28 00:49:41,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:41,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:42,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:42,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:42,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365650322] [2023-01-28 00:49:42,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365650322] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:42,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:42,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:49:42,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191173617] [2023-01-28 00:49:42,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:42,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:49:42,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:42,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:49:42,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:49:42,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 200 [2023-01-28 00:49:42,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 34 transitions, 226 flow. Second operand has 8 states, 8 states have (on average 80.5) internal successors, (644), 8 states have internal predecessors, (644), 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) [2023-01-28 00:49:42,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:42,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 200 [2023-01-28 00:49:42,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:42,637 INFO L130 PetriNetUnfolder]: 256/468 cut-off events. [2023-01-28 00:49:42,637 INFO L131 PetriNetUnfolder]: For 1068/1068 co-relation queries the response was YES. [2023-01-28 00:49:42,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1933 conditions, 468 events. 256/468 cut-off events. For 1068/1068 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1938 event pairs, 15 based on Foata normal form. 1/469 useless extension candidates. Maximal degree in co-relation 1910. Up to 244 conditions per place. [2023-01-28 00:49:42,639 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 29 selfloop transitions, 6 changer transitions 49/84 dead transitions. [2023-01-28 00:49:42,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 736 flow [2023-01-28 00:49:42,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:49:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:49:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 761 transitions. [2023-01-28 00:49:42,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42277777777777775 [2023-01-28 00:49:42,642 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 761 transitions. [2023-01-28 00:49:42,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 761 transitions. [2023-01-28 00:49:42,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:42,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 761 transitions. [2023-01-28 00:49:42,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 84.55555555555556) internal successors, (761), 9 states have internal predecessors, (761), 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) [2023-01-28 00:49:42,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 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) [2023-01-28 00:49:42,646 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 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) [2023-01-28 00:49:42,647 INFO L175 Difference]: Start difference. First operand has 55 places, 34 transitions, 226 flow. Second operand 9 states and 761 transitions. [2023-01-28 00:49:42,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 736 flow [2023-01-28 00:49:42,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 615 flow, removed 29 selfloop flow, removed 8 redundant places. [2023-01-28 00:49:42,651 INFO L231 Difference]: Finished difference. Result has 56 places, 30 transitions, 162 flow [2023-01-28 00:49:42,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=162, PETRI_PLACES=56, PETRI_TRANSITIONS=30} [2023-01-28 00:49:42,652 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2023-01-28 00:49:42,652 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 30 transitions, 162 flow [2023-01-28 00:49:42,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 80.5) internal successors, (644), 8 states have internal predecessors, (644), 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) [2023-01-28 00:49:42,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:42,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:42,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:49:42,652 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:42,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1297222461, now seen corresponding path program 2 times [2023-01-28 00:49:42,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:42,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112625682] [2023-01-28 00:49:42,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:42,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:43,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:43,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112625682] [2023-01-28 00:49:43,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112625682] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:43,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:43,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:49:43,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614470460] [2023-01-28 00:49:43,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:43,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:49:43,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:43,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:49:43,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:49:43,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 200 [2023-01-28 00:49:43,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 30 transitions, 162 flow. Second operand has 8 states, 8 states have (on average 86.25) internal successors, (690), 8 states have internal predecessors, (690), 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) [2023-01-28 00:49:43,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:43,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 200 [2023-01-28 00:49:43,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:43,481 INFO L130 PetriNetUnfolder]: 62/151 cut-off events. [2023-01-28 00:49:43,482 INFO L131 PetriNetUnfolder]: For 232/234 co-relation queries the response was YES. [2023-01-28 00:49:43,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 151 events. 62/151 cut-off events. For 232/234 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 536 event pairs, 3 based on Foata normal form. 1/151 useless extension candidates. Maximal degree in co-relation 560. Up to 69 conditions per place. [2023-01-28 00:49:43,482 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 26 selfloop transitions, 5 changer transitions 18/51 dead transitions. [2023-01-28 00:49:43,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 379 flow [2023-01-28 00:49:43,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:49:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:49:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 622 transitions. [2023-01-28 00:49:43,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4442857142857143 [2023-01-28 00:49:43,484 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 622 transitions. [2023-01-28 00:49:43,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 622 transitions. [2023-01-28 00:49:43,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:43,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 622 transitions. [2023-01-28 00:49:43,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.85714285714286) internal successors, (622), 7 states have internal predecessors, (622), 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) [2023-01-28 00:49:43,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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) [2023-01-28 00:49:43,487 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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) [2023-01-28 00:49:43,487 INFO L175 Difference]: Start difference. First operand has 56 places, 30 transitions, 162 flow. Second operand 7 states and 622 transitions. [2023-01-28 00:49:43,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 379 flow [2023-01-28 00:49:43,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 356 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-01-28 00:49:43,489 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 147 flow [2023-01-28 00:49:43,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=147, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-01-28 00:49:43,489 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2023-01-28 00:49:43,489 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 147 flow [2023-01-28 00:49:43,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.25) internal successors, (690), 8 states have internal predecessors, (690), 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) [2023-01-28 00:49:43,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:43,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:43,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:49:43,490 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:43,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:43,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1554954407, now seen corresponding path program 3 times [2023-01-28 00:49:43,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:43,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610553947] [2023-01-28 00:49:43,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:43,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:49:43,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:49:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:49:43,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:49:43,555 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:49:43,556 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 00:49:43,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 00:49:43,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 00:49:43,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 00:49:43,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 00:49:43,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 00:49:43,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:49:43,558 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:43,562 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:49:43,562 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:49:43,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:49:43 BasicIcfg [2023-01-28 00:49:43,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:49:43,617 INFO L158 Benchmark]: Toolchain (without parser) took 10394.76ms. Allocated memory was 541.1MB in the beginning and 780.1MB in the end (delta: 239.1MB). Free memory was 499.6MB in the beginning and 493.0MB in the end (delta: 6.5MB). Peak memory consumption was 248.5MB. Max. memory is 16.0GB. [2023-01-28 00:49:43,618 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 348.1MB. Free memory is still 294.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:49:43,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.04ms. Allocated memory is still 541.1MB. Free memory was 499.6MB in the beginning and 476.8MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:49:43,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.12ms. Allocated memory is still 541.1MB. Free memory was 476.8MB in the beginning and 474.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:49:43,618 INFO L158 Benchmark]: Boogie Preprocessor took 33.70ms. Allocated memory is still 541.1MB. Free memory was 474.2MB in the beginning and 472.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:49:43,618 INFO L158 Benchmark]: RCFGBuilder took 498.37ms. Allocated memory is still 541.1MB. Free memory was 472.1MB in the beginning and 491.1MB in the end (delta: -19.0MB). Peak memory consumption was 27.6MB. Max. memory is 16.0GB. [2023-01-28 00:49:43,618 INFO L158 Benchmark]: TraceAbstraction took 9363.34ms. Allocated memory was 541.1MB in the beginning and 780.1MB in the end (delta: 239.1MB). Free memory was 490.6MB in the beginning and 493.0MB in the end (delta: -2.4MB). Peak memory consumption was 237.7MB. Max. memory is 16.0GB. [2023-01-28 00:49:43,619 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.11ms. Allocated memory is still 348.1MB. Free memory is still 294.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 441.04ms. Allocated memory is still 541.1MB. Free memory was 499.6MB in the beginning and 476.8MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.12ms. Allocated memory is still 541.1MB. Free memory was 476.8MB in the beginning and 474.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.70ms. Allocated memory is still 541.1MB. Free memory was 474.2MB in the beginning and 472.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 498.37ms. Allocated memory is still 541.1MB. Free memory was 472.1MB in the beginning and 491.1MB in the end (delta: -19.0MB). Peak memory consumption was 27.6MB. Max. memory is 16.0GB. * TraceAbstraction took 9363.34ms. Allocated memory was 541.1MB in the beginning and 780.1MB in the end (delta: 239.1MB). Free memory was 490.6MB in the beginning and 493.0MB in the end (delta: -2.4MB). Peak memory consumption was 237.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 111 PlacesBefore, 32 PlacesAfterwards, 103 TransitionsBefore, 22 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 4380 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2228, independent: 2081, independent conditional: 0, independent unconditional: 2081, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 983, independent: 942, independent conditional: 0, independent unconditional: 942, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2228, independent: 1139, independent conditional: 0, independent unconditional: 1139, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 983, unknown conditional: 0, unknown unconditional: 983] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2516, ((void *)0), P0, ((void *)0))=-2, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2517, ((void *)0), P1, ((void *)0))=-1, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2518, ((void *)0), P2, ((void *)0))=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - 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: 820]: 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: 818]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 677 IncrementalHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 13 mSDtfsCounter, 677 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=7, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 1380 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! [2023-01-28 00:49:43,641 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...