/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 AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 07:03:50,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 07:03:50,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 07:03:50,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 07:03:50,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 07:03:50,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 07:03:50,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 07:03:50,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 07:03:50,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 07:03:50,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 07:03:50,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 07:03:50,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 07:03:50,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 07:03:50,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 07:03:50,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 07:03:50,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 07:03:50,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 07:03:50,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 07:03:50,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 07:03:50,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 07:03:50,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 07:03:50,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 07:03:50,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 07:03:50,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 07:03:50,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 07:03:50,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 07:03:50,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 07:03:50,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 07:03:50,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 07:03:50,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 07:03:50,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 07:03:50,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 07:03:50,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 07:03:50,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 07:03:50,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 07:03:50,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 07:03:50,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 07:03:50,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 07:03:50,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 07:03:50,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 07:03:50,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 07:03:50,843 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 07:03:50,856 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 07:03:50,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 07:03:50,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 07:03:50,857 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 07:03:50,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 07:03:50,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 07:03:50,858 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 07:03:50,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 07:03:50,858 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 07:03:50,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 07:03:50,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 07:03:50,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 07:03:50,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 07:03:50,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 07:03:50,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 07:03:50,859 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 07:03:50,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 07:03:50,859 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 07:03:50,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 07:03:50,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 07:03:50,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 07:03:50,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 07:03:50,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 07:03:50,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:03:50,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 07:03:50,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 07:03:50,860 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 07:03:50,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 07:03:50,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 07:03:50,865 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 07:03:50,865 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 07:03:50,865 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 -> AFTER [2023-01-28 07:03:51,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 07:03:51,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 07:03:51,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 07:03:51,038 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 07:03:51,038 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 07:03:51,039 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 07:03:51,938 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 07:03:52,121 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 07:03:52,122 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 07:03:52,132 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844d4be87/b4de9679c7384c509bbc4e1698087611/FLAGd16bfe85f [2023-01-28 07:03:52,144 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844d4be87/b4de9679c7384c509bbc4e1698087611 [2023-01-28 07:03:52,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 07:03:52,147 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 07:03:52,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 07:03:52,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 07:03:52,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 07:03:52,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:03:52" (1/1) ... [2023-01-28 07:03:52,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71bba965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:52, skipping insertion in model container [2023-01-28 07:03:52,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:03:52" (1/1) ... [2023-01-28 07:03:52,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 07:03:52,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 07:03:52,315 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-01-28 07:03:52,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:03:52,505 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 07:03:52,515 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-01-28 07:03:52,556 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:03:52,582 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:03:52,582 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:03:52,586 INFO L208 MainTranslator]: Completed translation [2023-01-28 07:03:52,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:52 WrapperNode [2023-01-28 07:03:52,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 07:03:52,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 07:03:52,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 07:03:52,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 07:03:52,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:52" (1/1) ... [2023-01-28 07:03:52,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:52" (1/1) ... [2023-01-28 07:03:52,645 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-01-28 07:03:52,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 07:03:52,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 07:03:52,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 07:03:52,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 07:03:52,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:52" (1/1) ... [2023-01-28 07:03:52,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:52" (1/1) ... [2023-01-28 07:03:52,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:52" (1/1) ... [2023-01-28 07:03:52,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:52" (1/1) ... [2023-01-28 07:03:52,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:52" (1/1) ... [2023-01-28 07:03:52,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:52" (1/1) ... [2023-01-28 07:03:52,672 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:52" (1/1) ... [2023-01-28 07:03:52,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:52" (1/1) ... [2023-01-28 07:03:52,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 07:03:52,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 07:03:52,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 07:03:52,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 07:03:52,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:52" (1/1) ... [2023-01-28 07:03:52,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:03:52,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:03:52,708 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 07:03:52,750 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 07:03:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 07:03:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 07:03:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 07:03:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 07:03:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 07:03:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 07:03:52,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 07:03:52,764 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 07:03:52,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 07:03:52,764 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 07:03:52,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 07:03:52,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 07:03:52,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 07:03:52,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 07:03:52,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 07:03:52,765 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 07:03:52,939 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 07:03:52,941 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 07:03:53,202 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 07:03:53,289 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 07:03:53,290 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 07:03:53,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:03:53 BoogieIcfgContainer [2023-01-28 07:03:53,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 07:03:53,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 07:03:53,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 07:03:53,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 07:03:53,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 07:03:52" (1/3) ... [2023-01-28 07:03:53,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425864c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:03:53, skipping insertion in model container [2023-01-28 07:03:53,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:52" (2/3) ... [2023-01-28 07:03:53,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425864c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:03:53, skipping insertion in model container [2023-01-28 07:03:53,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:03:53" (3/3) ... [2023-01-28 07:03:53,300 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 07:03:53,312 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 07:03:53,312 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 07:03:53,312 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 07:03:53,355 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 07:03:53,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2023-01-28 07:03:53,414 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-01-28 07:03:53,414 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:03:53,418 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 69. Up to 2 conditions per place. [2023-01-28 07:03:53,418 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2023-01-28 07:03:53,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2023-01-28 07:03:53,424 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:03:53,430 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2023-01-28 07:03:53,432 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2023-01-28 07:03:53,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2023-01-28 07:03:53,463 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-01-28 07:03:53,464 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:03:53,464 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 69. Up to 2 conditions per place. [2023-01-28 07:03:53,465 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-01-28 07:03:56,171 INFO L134 LiptonReduction]: Checked pairs total: 4970 [2023-01-28 07:03:56,171 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-01-28 07:03:56,182 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:03:56,186 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;@6eee555b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:03:56,186 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 07:03:56,189 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-01-28 07:03:56,189 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:03:56,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:56,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 07:03:56,190 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:03:56,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:56,193 INFO L85 PathProgramCache]: Analyzing trace with hash 462897, now seen corresponding path program 1 times [2023-01-28 07:03:56,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:56,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126600719] [2023-01-28 07:03:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:56,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:56,435 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 07:03:56,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:56,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126600719] [2023-01-28 07:03:56,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126600719] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:56,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:56,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 07:03:56,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879808257] [2023-01-28 07:03:56,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:56,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:03:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:56,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:03:56,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:03:56,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 195 [2023-01-28 07:03:56,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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 07:03:56,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:56,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 195 [2023-01-28 07:03:56,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:56,726 INFO L130 PetriNetUnfolder]: 999/1532 cut-off events. [2023-01-28 07:03:56,727 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-28 07:03:56,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3067 conditions, 1532 events. 999/1532 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7133 event pairs, 419 based on Foata normal form. 64/1461 useless extension candidates. Maximal degree in co-relation 3056. Up to 1207 conditions per place. [2023-01-28 07:03:56,739 INFO L137 encePairwiseOnDemand]: 191/195 looper letters, 31 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2023-01-28 07:03:56,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 169 flow [2023-01-28 07:03:56,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:03:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:03:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-01-28 07:03:56,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5401709401709401 [2023-01-28 07:03:56,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-01-28 07:03:56,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-01-28 07:03:56,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:56,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-01-28 07:03:56,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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 07:03:56,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 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 07:03:56,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 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 07:03:56,766 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 316 transitions. [2023-01-28 07:03:56,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 169 flow [2023-01-28 07:03:56,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 07:03:56,770 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-01-28 07:03:56,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-01-28 07:03:56,774 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-01-28 07:03:56,774 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-01-28 07:03:56,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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 07:03:56,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:56,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:56,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 07:03:56,775 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:03:56,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:56,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1161121739, now seen corresponding path program 1 times [2023-01-28 07:03:56,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:56,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878921635] [2023-01-28 07:03:56,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:56,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:57,495 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 07:03:57,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:57,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878921635] [2023-01-28 07:03:57,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878921635] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:57,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:57,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:03:57,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461220992] [2023-01-28 07:03:57,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:57,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:03:57,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:57,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:03:57,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:03:57,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 195 [2023-01-28 07:03:57,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 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 07:03:57,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:57,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 195 [2023-01-28 07:03:57,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:57,956 INFO L130 PetriNetUnfolder]: 2172/3226 cut-off events. [2023-01-28 07:03:57,957 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2023-01-28 07:03:57,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6709 conditions, 3226 events. 2172/3226 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 15620 event pairs, 279 based on Foata normal form. 167/3393 useless extension candidates. Maximal degree in co-relation 6699. Up to 2131 conditions per place. [2023-01-28 07:03:57,970 INFO L137 encePairwiseOnDemand]: 183/195 looper letters, 42 selfloop transitions, 12 changer transitions 33/87 dead transitions. [2023-01-28 07:03:57,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 87 transitions, 376 flow [2023-01-28 07:03:57,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 07:03:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 07:03:57,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 629 transitions. [2023-01-28 07:03:57,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608058608058608 [2023-01-28 07:03:57,972 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 629 transitions. [2023-01-28 07:03:57,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 629 transitions. [2023-01-28 07:03:57,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:57,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 629 transitions. [2023-01-28 07:03:57,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.85714285714286) internal successors, (629), 7 states have internal predecessors, (629), 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 07:03:57,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 07:03:57,976 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 07:03:57,976 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 7 states and 629 transitions. [2023-01-28 07:03:57,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 87 transitions, 376 flow [2023-01-28 07:03:57,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 87 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:03:57,979 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 160 flow [2023-01-28 07:03:57,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-01-28 07:03:57,979 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2023-01-28 07:03:57,980 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 160 flow [2023-01-28 07:03:57,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 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 07:03:57,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:57,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:57,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 07:03:57,981 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:03:57,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:57,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1635066916, now seen corresponding path program 1 times [2023-01-28 07:03:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:57,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559733759] [2023-01-28 07:03:57,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:58,132 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 07:03:58,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:58,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559733759] [2023-01-28 07:03:58,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559733759] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:58,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:58,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:03:58,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062749639] [2023-01-28 07:03:58,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:58,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:03:58,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:58,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:03:58,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:03:58,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 195 [2023-01-28 07:03:58,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 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 07:03:58,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:58,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 195 [2023-01-28 07:03:58,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:58,400 INFO L130 PetriNetUnfolder]: 1494/2363 cut-off events. [2023-01-28 07:03:58,400 INFO L131 PetriNetUnfolder]: For 3009/3051 co-relation queries the response was YES. [2023-01-28 07:03:58,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7805 conditions, 2363 events. 1494/2363 cut-off events. For 3009/3051 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 12079 event pairs, 303 based on Foata normal form. 152/2512 useless extension candidates. Maximal degree in co-relation 7789. Up to 1802 conditions per place. [2023-01-28 07:03:58,413 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 40 selfloop transitions, 5 changer transitions 26/75 dead transitions. [2023-01-28 07:03:58,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 75 transitions, 516 flow [2023-01-28 07:03:58,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:03:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:03:58,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2023-01-28 07:03:58,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015384615384615 [2023-01-28 07:03:58,415 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 489 transitions. [2023-01-28 07:03:58,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 489 transitions. [2023-01-28 07:03:58,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:58,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 489 transitions. [2023-01-28 07:03:58,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 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 07:03:58,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 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 07:03:58,418 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 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 07:03:58,418 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 160 flow. Second operand 5 states and 489 transitions. [2023-01-28 07:03:58,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 75 transitions, 516 flow [2023-01-28 07:03:58,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 75 transitions, 514 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 07:03:58,430 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 219 flow [2023-01-28 07:03:58,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-01-28 07:03:58,431 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2023-01-28 07:03:58,433 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 219 flow [2023-01-28 07:03:58,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 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 07:03:58,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:58,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:58,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 07:03:58,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:03:58,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:58,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1712078875, now seen corresponding path program 1 times [2023-01-28 07:03:58,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:58,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6170601] [2023-01-28 07:03:58,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:58,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:58,964 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 07:03:58,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:58,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6170601] [2023-01-28 07:03:58,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6170601] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:58,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:58,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:03:58,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808460247] [2023-01-28 07:03:58,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:58,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:03:58,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:58,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:03:58,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:03:58,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 195 [2023-01-28 07:03:58,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 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 07:03:58,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:58,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 195 [2023-01-28 07:03:58,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:59,493 INFO L130 PetriNetUnfolder]: 2627/3958 cut-off events. [2023-01-28 07:03:59,493 INFO L131 PetriNetUnfolder]: For 6469/6469 co-relation queries the response was YES. [2023-01-28 07:03:59,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13837 conditions, 3958 events. 2627/3958 cut-off events. For 6469/6469 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 20235 event pairs, 475 based on Foata normal form. 162/4120 useless extension candidates. Maximal degree in co-relation 13817. Up to 1837 conditions per place. [2023-01-28 07:03:59,513 INFO L137 encePairwiseOnDemand]: 183/195 looper letters, 49 selfloop transitions, 19 changer transitions 30/98 dead transitions. [2023-01-28 07:03:59,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 98 transitions, 700 flow [2023-01-28 07:03:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 07:03:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 07:03:59,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 622 transitions. [2023-01-28 07:03:59,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45567765567765567 [2023-01-28 07:03:59,515 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 622 transitions. [2023-01-28 07:03:59,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 622 transitions. [2023-01-28 07:03:59,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:59,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 622 transitions. [2023-01-28 07:03:59,517 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 07:03:59,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 07:03:59,519 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 07:03:59,519 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 219 flow. Second operand 7 states and 622 transitions. [2023-01-28 07:03:59,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 98 transitions, 700 flow [2023-01-28 07:03:59,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 98 transitions, 678 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-01-28 07:03:59,531 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 370 flow [2023-01-28 07:03:59,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=370, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2023-01-28 07:03:59,532 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2023-01-28 07:03:59,532 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 370 flow [2023-01-28 07:03:59,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 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 07:03:59,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:59,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:59,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 07:03:59,532 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:03:59,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:59,533 INFO L85 PathProgramCache]: Analyzing trace with hash -863751247, now seen corresponding path program 1 times [2023-01-28 07:03:59,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:59,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103721557] [2023-01-28 07:03:59,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:59,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:04:00,073 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 07:04:00,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:04:00,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103721557] [2023-01-28 07:04:00,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103721557] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:04:00,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:04:00,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:04:00,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217944392] [2023-01-28 07:04:00,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:04:00,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:04:00,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:04:00,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:04:00,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:04:00,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 195 [2023-01-28 07:04:00,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 370 flow. Second operand has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 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 07:04:00,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:04:00,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 195 [2023-01-28 07:04:00,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:04:00,568 INFO L130 PetriNetUnfolder]: 2585/3936 cut-off events. [2023-01-28 07:04:00,569 INFO L131 PetriNetUnfolder]: For 14033/14033 co-relation queries the response was YES. [2023-01-28 07:04:00,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16339 conditions, 3936 events. 2585/3936 cut-off events. For 14033/14033 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 20182 event pairs, 837 based on Foata normal form. 180/4116 useless extension candidates. Maximal degree in co-relation 16313. Up to 2741 conditions per place. [2023-01-28 07:04:00,593 INFO L137 encePairwiseOnDemand]: 182/195 looper letters, 52 selfloop transitions, 27 changer transitions 39/118 dead transitions. [2023-01-28 07:04:00,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 118 transitions, 1082 flow [2023-01-28 07:04:00,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 07:04:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 07:04:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 623 transitions. [2023-01-28 07:04:00,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4564102564102564 [2023-01-28 07:04:00,596 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 623 transitions. [2023-01-28 07:04:00,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 623 transitions. [2023-01-28 07:04:00,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:04:00,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 623 transitions. [2023-01-28 07:04:00,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 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 07:04:00,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 07:04:00,601 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 07:04:00,601 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 370 flow. Second operand 7 states and 623 transitions. [2023-01-28 07:04:00,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 118 transitions, 1082 flow [2023-01-28 07:04:00,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 118 transitions, 1056 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-01-28 07:04:00,624 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 592 flow [2023-01-28 07:04:00,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=592, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2023-01-28 07:04:00,626 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 24 predicate places. [2023-01-28 07:04:00,626 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 592 flow [2023-01-28 07:04:00,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 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 07:04:00,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:04:00,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:04:00,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 07:04:00,627 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:04:00,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:04:00,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1255809942, now seen corresponding path program 1 times [2023-01-28 07:04:00,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:04:00,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083551503] [2023-01-28 07:04:00,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:04:00,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:04:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:04:01,058 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 07:04:01,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:04:01,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083551503] [2023-01-28 07:04:01,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083551503] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:04:01,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:04:01,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:04:01,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276047502] [2023-01-28 07:04:01,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:04:01,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:04:01,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:04:01,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:04:01,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:04:01,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 195 [2023-01-28 07:04:01,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 592 flow. Second operand has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:04:01,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:04:01,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 195 [2023-01-28 07:04:01,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:04:01,656 INFO L130 PetriNetUnfolder]: 3417/5240 cut-off events. [2023-01-28 07:04:01,656 INFO L131 PetriNetUnfolder]: For 29044/29044 co-relation queries the response was YES. [2023-01-28 07:04:01,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26238 conditions, 5240 events. 3417/5240 cut-off events. For 29044/29044 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 29187 event pairs, 709 based on Foata normal form. 164/5404 useless extension candidates. Maximal degree in co-relation 26206. Up to 2361 conditions per place. [2023-01-28 07:04:01,684 INFO L137 encePairwiseOnDemand]: 183/195 looper letters, 61 selfloop transitions, 24 changer transitions 32/117 dead transitions. [2023-01-28 07:04:01,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 117 transitions, 1288 flow [2023-01-28 07:04:01,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 07:04:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 07:04:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 622 transitions. [2023-01-28 07:04:01,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45567765567765567 [2023-01-28 07:04:01,686 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 622 transitions. [2023-01-28 07:04:01,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 622 transitions. [2023-01-28 07:04:01,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:04:01,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 622 transitions. [2023-01-28 07:04:01,687 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 07:04:01,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 07:04:01,689 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 07:04:01,689 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 592 flow. Second operand 7 states and 622 transitions. [2023-01-28 07:04:01,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 117 transitions, 1288 flow [2023-01-28 07:04:01,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 117 transitions, 1242 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-28 07:04:01,719 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 733 flow [2023-01-28 07:04:01,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=733, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2023-01-28 07:04:01,719 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 31 predicate places. [2023-01-28 07:04:01,719 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 733 flow [2023-01-28 07:04:01,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:04:01,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:04:01,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:04:01,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 07:04:01,720 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:04:01,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:04:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1201841143, now seen corresponding path program 1 times [2023-01-28 07:04:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:04:01,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704043955] [2023-01-28 07:04:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:04:01,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:04:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:04:02,397 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 07:04:02,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:04:02,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704043955] [2023-01-28 07:04:02,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704043955] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:04:02,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:04:02,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:04:02,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384098833] [2023-01-28 07:04:02,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:04:02,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:04:02,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:04:02,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:04:02,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:04:02,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 195 [2023-01-28 07:04:02,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 733 flow. Second operand has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 states have internal predecessors, (475), 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 07:04:02,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:04:02,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 195 [2023-01-28 07:04:02,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:04:02,998 INFO L130 PetriNetUnfolder]: 3275/5107 cut-off events. [2023-01-28 07:04:02,998 INFO L131 PetriNetUnfolder]: For 44038/44038 co-relation queries the response was YES. [2023-01-28 07:04:03,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27325 conditions, 5107 events. 3275/5107 cut-off events. For 44038/44038 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 28595 event pairs, 961 based on Foata normal form. 238/5345 useless extension candidates. Maximal degree in co-relation 27287. Up to 3642 conditions per place. [2023-01-28 07:04:03,025 INFO L137 encePairwiseOnDemand]: 182/195 looper letters, 63 selfloop transitions, 40 changer transitions 59/162 dead transitions. [2023-01-28 07:04:03,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 162 transitions, 2213 flow [2023-01-28 07:04:03,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 07:04:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 07:04:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 620 transitions. [2023-01-28 07:04:03,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542124542124542 [2023-01-28 07:04:03,027 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 620 transitions. [2023-01-28 07:04:03,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 620 transitions. [2023-01-28 07:04:03,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:04:03,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 620 transitions. [2023-01-28 07:04:03,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.57142857142857) internal successors, (620), 7 states have internal predecessors, (620), 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 07:04:03,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 07:04:03,030 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 07:04:03,030 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 733 flow. Second operand 7 states and 620 transitions. [2023-01-28 07:04:03,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 162 transitions, 2213 flow [2023-01-28 07:04:03,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 162 transitions, 2173 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-01-28 07:04:03,081 INFO L231 Difference]: Finished difference. Result has 72 places, 83 transitions, 1184 flow [2023-01-28 07:04:03,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1184, PETRI_PLACES=72, PETRI_TRANSITIONS=83} [2023-01-28 07:04:03,082 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2023-01-28 07:04:03,082 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 83 transitions, 1184 flow [2023-01-28 07:04:03,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 states have internal predecessors, (475), 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 07:04:03,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:04:03,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:04:03,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 07:04:03,083 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:04:03,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:04:03,083 INFO L85 PathProgramCache]: Analyzing trace with hash -281276943, now seen corresponding path program 1 times [2023-01-28 07:04:03,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:04:03,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274113290] [2023-01-28 07:04:03,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:04:03,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:04:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:04:03,641 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 07:04:03,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:04:03,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274113290] [2023-01-28 07:04:03,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274113290] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:04:03,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:04:03,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:04:03,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337358358] [2023-01-28 07:04:03,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:04:03,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:04:03,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:04:03,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:04:03,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:04:03,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 195 [2023-01-28 07:04:03,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 83 transitions, 1184 flow. Second operand has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 states have internal predecessors, (475), 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 07:04:03,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:04:03,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 195 [2023-01-28 07:04:03,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:04:04,295 INFO L130 PetriNetUnfolder]: 2796/4371 cut-off events. [2023-01-28 07:04:04,295 INFO L131 PetriNetUnfolder]: For 42854/42854 co-relation queries the response was YES. [2023-01-28 07:04:04,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27057 conditions, 4371 events. 2796/4371 cut-off events. For 42854/42854 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 23949 event pairs, 969 based on Foata normal form. 136/4507 useless extension candidates. Maximal degree in co-relation 27014. Up to 3131 conditions per place. [2023-01-28 07:04:04,323 INFO L137 encePairwiseOnDemand]: 182/195 looper letters, 76 selfloop transitions, 55 changer transitions 48/179 dead transitions. [2023-01-28 07:04:04,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 179 transitions, 2663 flow [2023-01-28 07:04:04,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 07:04:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 07:04:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 879 transitions. [2023-01-28 07:04:04,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45076923076923076 [2023-01-28 07:04:04,326 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 879 transitions. [2023-01-28 07:04:04,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 879 transitions. [2023-01-28 07:04:04,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:04:04,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 879 transitions. [2023-01-28 07:04:04,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 87.9) internal successors, (879), 10 states have internal predecessors, (879), 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 07:04:04,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 195.0) internal successors, (2145), 11 states have internal predecessors, (2145), 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 07:04:04,331 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 195.0) internal successors, (2145), 11 states have internal predecessors, (2145), 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 07:04:04,331 INFO L175 Difference]: Start difference. First operand has 72 places, 83 transitions, 1184 flow. Second operand 10 states and 879 transitions. [2023-01-28 07:04:04,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 179 transitions, 2663 flow [2023-01-28 07:04:04,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 179 transitions, 2605 flow, removed 29 selfloop flow, removed 3 redundant places. [2023-01-28 07:04:04,382 INFO L231 Difference]: Finished difference. Result has 82 places, 93 transitions, 1497 flow [2023-01-28 07:04:04,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1497, PETRI_PLACES=82, PETRI_TRANSITIONS=93} [2023-01-28 07:04:04,384 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 47 predicate places. [2023-01-28 07:04:04,385 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 93 transitions, 1497 flow [2023-01-28 07:04:04,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 states have internal predecessors, (475), 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 07:04:04,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:04:04,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:04:04,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 07:04:04,385 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:04:04,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:04:04,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1395975051, now seen corresponding path program 1 times [2023-01-28 07:04:04,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:04:04,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085426063] [2023-01-28 07:04:04,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:04:04,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:04:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:04:04,765 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 07:04:04,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:04:04,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085426063] [2023-01-28 07:04:04,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085426063] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:04:04,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:04:04,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 07:04:04,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344258502] [2023-01-28 07:04:04,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:04:04,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:04:04,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:04:04,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:04:04,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:04:04,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 195 [2023-01-28 07:04:04,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 93 transitions, 1497 flow. Second operand has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 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 07:04:04,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:04:04,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 195 [2023-01-28 07:04:04,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:04:05,398 INFO L130 PetriNetUnfolder]: 2816/4555 cut-off events. [2023-01-28 07:04:05,399 INFO L131 PetriNetUnfolder]: For 64678/65351 co-relation queries the response was YES. [2023-01-28 07:04:05,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31564 conditions, 4555 events. 2816/4555 cut-off events. For 64678/65351 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 27270 event pairs, 783 based on Foata normal form. 598/5105 useless extension candidates. Maximal degree in co-relation 31515. Up to 2847 conditions per place. [2023-01-28 07:04:05,427 INFO L137 encePairwiseOnDemand]: 187/195 looper letters, 86 selfloop transitions, 25 changer transitions 54/176 dead transitions. [2023-01-28 07:04:05,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 176 transitions, 2963 flow [2023-01-28 07:04:05,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 07:04:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 07:04:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 744 transitions. [2023-01-28 07:04:05,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47692307692307695 [2023-01-28 07:04:05,430 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 744 transitions. [2023-01-28 07:04:05,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 744 transitions. [2023-01-28 07:04:05,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:04:05,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 744 transitions. [2023-01-28 07:04:05,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 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 07:04:05,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 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 07:04:05,434 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 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 07:04:05,434 INFO L175 Difference]: Start difference. First operand has 82 places, 93 transitions, 1497 flow. Second operand 8 states and 744 transitions. [2023-01-28 07:04:05,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 176 transitions, 2963 flow [2023-01-28 07:04:05,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 176 transitions, 2893 flow, removed 35 selfloop flow, removed 4 redundant places. [2023-01-28 07:04:05,572 INFO L231 Difference]: Finished difference. Result has 87 places, 96 transitions, 1639 flow [2023-01-28 07:04:05,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1639, PETRI_PLACES=87, PETRI_TRANSITIONS=96} [2023-01-28 07:04:05,573 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 52 predicate places. [2023-01-28 07:04:05,573 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 96 transitions, 1639 flow [2023-01-28 07:04:05,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 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 07:04:05,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:04:05,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:04:05,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 07:04:05,574 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:04:05,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:04:05,574 INFO L85 PathProgramCache]: Analyzing trace with hash -204159740, now seen corresponding path program 1 times [2023-01-28 07:04:05,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:04:05,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177867747] [2023-01-28 07:04:05,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:04:05,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:04:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:04:05,701 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 07:04:05,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:04:05,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177867747] [2023-01-28 07:04:05,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177867747] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:04:05,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:04:05,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:04:05,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849995888] [2023-01-28 07:04:05,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:04:05,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:04:05,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:04:05,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:04:05,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:04:05,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 195 [2023-01-28 07:04:05,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 96 transitions, 1639 flow. Second operand has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 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 07:04:05,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:04:05,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 195 [2023-01-28 07:04:05,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:04:06,034 INFO L130 PetriNetUnfolder]: 1631/2793 cut-off events. [2023-01-28 07:04:06,034 INFO L131 PetriNetUnfolder]: For 51510/52557 co-relation queries the response was YES. [2023-01-28 07:04:06,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20712 conditions, 2793 events. 1631/2793 cut-off events. For 51510/52557 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 17048 event pairs, 251 based on Foata normal form. 914/3685 useless extension candidates. Maximal degree in co-relation 20659. Up to 1684 conditions per place. [2023-01-28 07:04:06,051 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 107 selfloop transitions, 6 changer transitions 91/220 dead transitions. [2023-01-28 07:04:06,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 220 transitions, 4264 flow [2023-01-28 07:04:06,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:04:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:04:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2023-01-28 07:04:06,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48512820512820515 [2023-01-28 07:04:06,053 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 473 transitions. [2023-01-28 07:04:06,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 473 transitions. [2023-01-28 07:04:06,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:04:06,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 473 transitions. [2023-01-28 07:04:06,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:04:06,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 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 07:04:06,056 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 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 07:04:06,056 INFO L175 Difference]: Start difference. First operand has 87 places, 96 transitions, 1639 flow. Second operand 5 states and 473 transitions. [2023-01-28 07:04:06,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 220 transitions, 4264 flow [2023-01-28 07:04:06,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 220 transitions, 4103 flow, removed 28 selfloop flow, removed 6 redundant places. [2023-01-28 07:04:06,105 INFO L231 Difference]: Finished difference. Result has 85 places, 91 transitions, 1497 flow [2023-01-28 07:04:06,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1497, PETRI_PLACES=85, PETRI_TRANSITIONS=91} [2023-01-28 07:04:06,106 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 50 predicate places. [2023-01-28 07:04:06,106 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 91 transitions, 1497 flow [2023-01-28 07:04:06,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 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 07:04:06,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:04:06,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:04:06,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 07:04:06,107 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:04:06,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:04:06,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1856097900, now seen corresponding path program 1 times [2023-01-28 07:04:06,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:04:06,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027037877] [2023-01-28 07:04:06,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:04:06,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:04:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:04:06,255 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 07:04:06,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:04:06,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027037877] [2023-01-28 07:04:06,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027037877] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:04:06,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:04:06,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:04:06,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776187967] [2023-01-28 07:04:06,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:04:06,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:04:06,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:04:06,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:04:06,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:04:06,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 195 [2023-01-28 07:04:06,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 91 transitions, 1497 flow. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 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 07:04:06,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:04:06,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 195 [2023-01-28 07:04:06,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:04:06,549 INFO L130 PetriNetUnfolder]: 979/1757 cut-off events. [2023-01-28 07:04:06,549 INFO L131 PetriNetUnfolder]: For 28855/29361 co-relation queries the response was YES. [2023-01-28 07:04:06,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12972 conditions, 1757 events. 979/1757 cut-off events. For 28855/29361 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 10546 event pairs, 55 based on Foata normal form. 470/2212 useless extension candidates. Maximal degree in co-relation 12920. Up to 899 conditions per place. [2023-01-28 07:04:06,560 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 100 selfloop transitions, 10 changer transitions 119/243 dead transitions. [2023-01-28 07:04:06,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 243 transitions, 4573 flow [2023-01-28 07:04:06,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 07:04:06,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 07:04:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 660 transitions. [2023-01-28 07:04:06,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835164835164835 [2023-01-28 07:04:06,562 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 660 transitions. [2023-01-28 07:04:06,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 660 transitions. [2023-01-28 07:04:06,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:04:06,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 660 transitions. [2023-01-28 07:04:06,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 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 07:04:06,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 07:04:06,565 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 07:04:06,565 INFO L175 Difference]: Start difference. First operand has 85 places, 91 transitions, 1497 flow. Second operand 7 states and 660 transitions. [2023-01-28 07:04:06,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 243 transitions, 4573 flow [2023-01-28 07:04:06,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 243 transitions, 4528 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-01-28 07:04:06,596 INFO L231 Difference]: Finished difference. Result has 93 places, 79 transitions, 1200 flow [2023-01-28 07:04:06,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1200, PETRI_PLACES=93, PETRI_TRANSITIONS=79} [2023-01-28 07:04:06,597 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 58 predicate places. [2023-01-28 07:04:06,597 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 79 transitions, 1200 flow [2023-01-28 07:04:06,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 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 07:04:06,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:04:06,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:04:06,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 07:04:06,598 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:04:06,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:04:06,598 INFO L85 PathProgramCache]: Analyzing trace with hash 662290016, now seen corresponding path program 1 times [2023-01-28 07:04:06,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:04:06,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619387804] [2023-01-28 07:04:06,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:04:06,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:04:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:04:07,513 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 07:04:07,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:04:07,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619387804] [2023-01-28 07:04:07,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619387804] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:04:07,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:04:07,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 07:04:07,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550913517] [2023-01-28 07:04:07,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:04:07,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 07:04:07,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:04:07,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 07:04:07,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-01-28 07:04:07,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 195 [2023-01-28 07:04:07,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 79 transitions, 1200 flow. Second operand has 9 states, 9 states have (on average 76.11111111111111) internal successors, (685), 9 states have internal predecessors, (685), 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 07:04:07,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:04:07,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 195 [2023-01-28 07:04:07,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:04:08,237 INFO L130 PetriNetUnfolder]: 1206/2350 cut-off events. [2023-01-28 07:04:08,238 INFO L131 PetriNetUnfolder]: For 28846/28846 co-relation queries the response was YES. [2023-01-28 07:04:08,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17957 conditions, 2350 events. 1206/2350 cut-off events. For 28846/28846 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15174 event pairs, 210 based on Foata normal form. 15/2365 useless extension candidates. Maximal degree in co-relation 17901. Up to 825 conditions per place. [2023-01-28 07:04:08,252 INFO L137 encePairwiseOnDemand]: 183/195 looper letters, 91 selfloop transitions, 51 changer transitions 74/216 dead transitions. [2023-01-28 07:04:08,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 216 transitions, 3230 flow [2023-01-28 07:04:08,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 07:04:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 07:04:08,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1006 transitions. [2023-01-28 07:04:08,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42991452991452994 [2023-01-28 07:04:08,255 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1006 transitions. [2023-01-28 07:04:08,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1006 transitions. [2023-01-28 07:04:08,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:04:08,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1006 transitions. [2023-01-28 07:04:08,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 83.83333333333333) internal successors, (1006), 12 states have internal predecessors, (1006), 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 07:04:08,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 195.0) internal successors, (2535), 13 states have internal predecessors, (2535), 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 07:04:08,259 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 195.0) internal successors, (2535), 13 states have internal predecessors, (2535), 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 07:04:08,259 INFO L175 Difference]: Start difference. First operand has 93 places, 79 transitions, 1200 flow. Second operand 12 states and 1006 transitions. [2023-01-28 07:04:08,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 216 transitions, 3230 flow [2023-01-28 07:04:08,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 216 transitions, 2865 flow, removed 73 selfloop flow, removed 12 redundant places. [2023-01-28 07:04:08,318 INFO L231 Difference]: Finished difference. Result has 100 places, 89 transitions, 1444 flow [2023-01-28 07:04:08,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1444, PETRI_PLACES=100, PETRI_TRANSITIONS=89} [2023-01-28 07:04:08,318 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 65 predicate places. [2023-01-28 07:04:08,319 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 89 transitions, 1444 flow [2023-01-28 07:04:08,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 76.11111111111111) internal successors, (685), 9 states have internal predecessors, (685), 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 07:04:08,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:04:08,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:04:08,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 07:04:08,319 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:04:08,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:04:08,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2041864984, now seen corresponding path program 1 times [2023-01-28 07:04:08,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:04:08,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432139301] [2023-01-28 07:04:08,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:04:08,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:04:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:04:08,489 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 07:04:08,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:04:08,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432139301] [2023-01-28 07:04:08,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432139301] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:04:08,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:04:08,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 07:04:08,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094864463] [2023-01-28 07:04:08,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:04:08,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:04:08,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:04:08,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:04:08,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:04:08,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 195 [2023-01-28 07:04:08,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 89 transitions, 1444 flow. Second operand has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:04:08,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:04:08,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 195 [2023-01-28 07:04:08,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:04:08,651 INFO L130 PetriNetUnfolder]: 398/860 cut-off events. [2023-01-28 07:04:08,651 INFO L131 PetriNetUnfolder]: For 9482/9522 co-relation queries the response was YES. [2023-01-28 07:04:08,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6189 conditions, 860 events. 398/860 cut-off events. For 9482/9522 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5007 event pairs, 35 based on Foata normal form. 86/931 useless extension candidates. Maximal degree in co-relation 6132. Up to 346 conditions per place. [2023-01-28 07:04:08,656 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 56 selfloop transitions, 10 changer transitions 82/154 dead transitions. [2023-01-28 07:04:08,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 154 transitions, 2751 flow [2023-01-28 07:04:08,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 07:04:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 07:04:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 643 transitions. [2023-01-28 07:04:08,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47106227106227105 [2023-01-28 07:04:08,658 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 643 transitions. [2023-01-28 07:04:08,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 643 transitions. [2023-01-28 07:04:08,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:04:08,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 643 transitions. [2023-01-28 07:04:08,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 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 07:04:08,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 07:04:08,661 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 07:04:08,661 INFO L175 Difference]: Start difference. First operand has 100 places, 89 transitions, 1444 flow. Second operand 7 states and 643 transitions. [2023-01-28 07:04:08,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 154 transitions, 2751 flow [2023-01-28 07:04:08,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 154 transitions, 2495 flow, removed 85 selfloop flow, removed 10 redundant places. [2023-01-28 07:04:08,679 INFO L231 Difference]: Finished difference. Result has 93 places, 48 transitions, 637 flow [2023-01-28 07:04:08,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=637, PETRI_PLACES=93, PETRI_TRANSITIONS=48} [2023-01-28 07:04:08,679 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 58 predicate places. [2023-01-28 07:04:08,679 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 48 transitions, 637 flow [2023-01-28 07:04:08,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:04:08,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:04:08,680 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, 1, 1] [2023-01-28 07:04:08,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 07:04:08,680 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:04:08,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:04:08,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1665644586, now seen corresponding path program 1 times [2023-01-28 07:04:08,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:04:08,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282207595] [2023-01-28 07:04:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:04:08,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:04:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:04:09,292 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 07:04:09,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:04:09,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282207595] [2023-01-28 07:04:09,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282207595] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:04:09,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:04:09,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 07:04:09,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16536921] [2023-01-28 07:04:09,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:04:09,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 07:04:09,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:04:09,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 07:04:09,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-01-28 07:04:09,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 195 [2023-01-28 07:04:09,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 48 transitions, 637 flow. Second operand has 9 states, 9 states have (on average 84.22222222222223) internal successors, (758), 9 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:04:09,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:04:09,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 195 [2023-01-28 07:04:09,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:04:09,418 INFO L130 PetriNetUnfolder]: 160/352 cut-off events. [2023-01-28 07:04:09,419 INFO L131 PetriNetUnfolder]: For 2445/2445 co-relation queries the response was YES. [2023-01-28 07:04:09,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 352 events. 160/352 cut-off events. For 2445/2445 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1379 event pairs, 27 based on Foata normal form. 2/354 useless extension candidates. Maximal degree in co-relation 2267. Up to 194 conditions per place. [2023-01-28 07:04:09,421 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 40 selfloop transitions, 6 changer transitions 23/71 dead transitions. [2023-01-28 07:04:09,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 71 transitions, 944 flow [2023-01-28 07:04:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:04:09,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:04:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 532 transitions. [2023-01-28 07:04:09,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4547008547008547 [2023-01-28 07:04:09,423 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 532 transitions. [2023-01-28 07:04:09,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 532 transitions. [2023-01-28 07:04:09,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:04:09,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 532 transitions. [2023-01-28 07:04:09,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 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 07:04:09,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 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 07:04:09,425 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 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 07:04:09,425 INFO L175 Difference]: Start difference. First operand has 93 places, 48 transitions, 637 flow. Second operand 6 states and 532 transitions. [2023-01-28 07:04:09,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 71 transitions, 944 flow [2023-01-28 07:04:09,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 640 flow, removed 77 selfloop flow, removed 30 redundant places. [2023-01-28 07:04:09,431 INFO L231 Difference]: Finished difference. Result has 67 places, 39 transitions, 317 flow [2023-01-28 07:04:09,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=67, PETRI_TRANSITIONS=39} [2023-01-28 07:04:09,432 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2023-01-28 07:04:09,432 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 39 transitions, 317 flow [2023-01-28 07:04:09,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.22222222222223) internal successors, (758), 9 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:04:09,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:04:09,433 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, 1, 1] [2023-01-28 07:04:09,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 07:04:09,433 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:04:09,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:04:09,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1369968458, now seen corresponding path program 2 times [2023-01-28 07:04:09,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:04:09,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664258771] [2023-01-28 07:04:09,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:04:09,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:04:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:04:09,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 07:04:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:04:09,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 07:04:09,530 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 07:04:09,531 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 07:04:09,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 07:04:09,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 07:04:09,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 07:04:09,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 07:04:09,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 07:04:09,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 07:04:09,536 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:04:09,541 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 07:04:09,541 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 07:04:09,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 07:04:09 BasicIcfg [2023-01-28 07:04:09,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 07:04:09,597 INFO L158 Benchmark]: Toolchain (without parser) took 17450.08ms. Allocated memory was 385.9MB in the beginning and 1.1GB in the end (delta: 721.4MB). Free memory was 329.3MB in the beginning and 687.6MB in the end (delta: -358.3MB). Peak memory consumption was 363.7MB. Max. memory is 16.0GB. [2023-01-28 07:04:09,597 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 385.9MB. Free memory is still 335.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 07:04:09,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.47ms. Allocated memory is still 385.9MB. Free memory was 329.0MB in the beginning and 305.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 07:04:09,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.34ms. Allocated memory is still 385.9MB. Free memory was 305.9MB in the beginning and 303.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:04:09,597 INFO L158 Benchmark]: Boogie Preprocessor took 35.72ms. Allocated memory is still 385.9MB. Free memory was 303.2MB in the beginning and 301.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:04:09,597 INFO L158 Benchmark]: RCFGBuilder took 609.92ms. Allocated memory was 385.9MB in the beginning and 595.6MB in the end (delta: 209.7MB). Free memory was 301.4MB in the beginning and 531.4MB in the end (delta: -229.9MB). Peak memory consumption was 12.5MB. Max. memory is 16.0GB. [2023-01-28 07:04:09,598 INFO L158 Benchmark]: TraceAbstraction took 16303.33ms. Allocated memory was 595.6MB in the beginning and 1.1GB in the end (delta: 511.7MB). Free memory was 530.3MB in the beginning and 687.6MB in the end (delta: -157.3MB). Peak memory consumption was 353.3MB. Max. memory is 16.0GB. [2023-01-28 07:04:09,598 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 385.9MB. Free memory is still 335.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 439.47ms. Allocated memory is still 385.9MB. Free memory was 329.0MB in the beginning and 305.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.34ms. Allocated memory is still 385.9MB. Free memory was 305.9MB in the beginning and 303.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.72ms. Allocated memory is still 385.9MB. Free memory was 303.2MB in the beginning and 301.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 609.92ms. Allocated memory was 385.9MB in the beginning and 595.6MB in the end (delta: 209.7MB). Free memory was 301.4MB in the beginning and 531.4MB in the end (delta: -229.9MB). Peak memory consumption was 12.5MB. Max. memory is 16.0GB. * TraceAbstraction took 16303.33ms. Allocated memory was 595.6MB in the beginning and 1.1GB in the end (delta: 511.7MB). Free memory was 530.3MB in the beginning and 687.6MB in the end (delta: -157.3MB). Peak memory consumption was 353.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 111 PlacesBefore, 35 PlacesAfterwards, 103 TransitionsBefore, 26 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 4970 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2380, independent: 2219, independent conditional: 0, independent unconditional: 2219, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1021, independent: 992, independent conditional: 0, independent unconditional: 992, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2380, independent: 1227, independent conditional: 0, independent unconditional: 1227, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 1021, unknown conditional: 0, unknown unconditional: 1021] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-2, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=-1, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=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=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] 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, 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=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 821]: 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: 819]: 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: 817]: 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, 133 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: 16.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 554 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 554 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1749 IncrementalHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 69 mSDtfsCounter, 1749 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1639occurred in iteration=9, InterpolantAutomatonStates: 98, 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, 5.7s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 2255 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 07:04:09,625 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...