/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/mix002.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:46:38,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:46:38,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:46:38,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:46:38,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:46:38,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:46:38,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:46:38,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:46:38,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:46:38,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:46:38,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:46:38,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:46:38,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:46:38,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:46:38,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:46:38,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:46:38,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:46:38,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:46:38,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:46:38,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:46:38,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:46:38,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:46:38,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:46:38,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:46:38,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:46:38,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:46:38,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:46:38,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:46:38,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:46:38,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:46:38,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:46:38,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:46:38,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:46:38,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:46:38,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:46:38,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:46:38,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:46:38,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:46:38,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:46:38,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:46:38,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:46:38,893 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 06:46:38,918 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:46:38,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:46:38,919 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:46:38,920 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:46:38,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:46:38,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:46:38,921 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:46:38,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:46:38,921 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:46:38,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:46:38,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:46:38,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:46:38,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:46:38,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:46:38,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:46:38,922 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:46:38,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:46:38,922 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:46:38,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:46:38,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:46:38,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:46:38,923 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:46:38,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:46:38,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:46:38,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:46:38,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:46:38,923 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:46:38,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:46:38,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:46:38,924 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:46:38,924 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:46:38,924 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 06:46:39,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:46:39,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:46:39,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:46:39,157 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:46:39,157 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:46:39,158 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2023-01-28 06:46:40,220 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:46:40,470 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:46:40,470 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2023-01-28 06:46:40,481 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/798357eff/3c788aeb625f4e56bb4bceafd6309644/FLAG1e4181189 [2023-01-28 06:46:40,492 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/798357eff/3c788aeb625f4e56bb4bceafd6309644 [2023-01-28 06:46:40,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:46:40,495 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:46:40,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:46:40,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:46:40,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:46:40,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:46:40" (1/1) ... [2023-01-28 06:46:40,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf11be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:46:40, skipping insertion in model container [2023-01-28 06:46:40,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:46:40" (1/1) ... [2023-01-28 06:46:40,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:46:40,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:46:40,691 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/mix002.opt.i[944,957] [2023-01-28 06:46:40,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:46:40,913 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:46:40,924 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/mix002.opt.i[944,957] [2023-01-28 06:46:40,986 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:46:41,015 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:46:41,015 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:46:41,021 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:46:41,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:46:41 WrapperNode [2023-01-28 06:46:41,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:46:41,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:46:41,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:46:41,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:46:41,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:46:41" (1/1) ... [2023-01-28 06:46:41,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:46:41" (1/1) ... [2023-01-28 06:46:41,084 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2023-01-28 06:46:41,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:46:41,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:46:41,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:46:41,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:46:41,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:46:41" (1/1) ... [2023-01-28 06:46:41,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:46:41" (1/1) ... [2023-01-28 06:46:41,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:46:41" (1/1) ... [2023-01-28 06:46:41,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:46:41" (1/1) ... [2023-01-28 06:46:41,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:46:41" (1/1) ... [2023-01-28 06:46:41,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:46:41" (1/1) ... [2023-01-28 06:46:41,104 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:46:41" (1/1) ... [2023-01-28 06:46:41,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:46:41" (1/1) ... [2023-01-28 06:46:41,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:46:41,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:46:41,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:46:41,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:46:41,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:46:41" (1/1) ... [2023-01-28 06:46:41,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:46:41,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:46:41,137 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 06:46:41,157 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 06:46:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:46:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:46:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:46:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:46:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:46:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:46:41,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:46:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:46:41,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:46:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:46:41,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:46:41,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:46:41,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:46:41,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:46:41,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:46:41,171 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 06:46:41,279 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:46:41,280 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:46:41,624 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:46:41,791 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:46:41,791 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:46:41,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:46:41 BoogieIcfgContainer [2023-01-28 06:46:41,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:46:41,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:46:41,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:46:41,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:46:41,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:46:40" (1/3) ... [2023-01-28 06:46:41,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e6d300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:46:41, skipping insertion in model container [2023-01-28 06:46:41,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:46:41" (2/3) ... [2023-01-28 06:46:41,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e6d300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:46:41, skipping insertion in model container [2023-01-28 06:46:41,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:46:41" (3/3) ... [2023-01-28 06:46:41,807 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.opt.i [2023-01-28 06:46:41,822 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:46:41,822 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:46:41,823 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:46:41,898 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:46:41,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2023-01-28 06:46:42,002 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-01-28 06:46:42,003 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:46:42,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-01-28 06:46:42,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2023-01-28 06:46:42,018 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2023-01-28 06:46:42,021 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:46:42,040 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2023-01-28 06:46:42,046 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2023-01-28 06:46:42,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2023-01-28 06:46:42,080 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-01-28 06:46:42,081 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:46:42,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-01-28 06:46:42,083 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2023-01-28 06:46:45,702 INFO L134 LiptonReduction]: Checked pairs total: 5803 [2023-01-28 06:46:45,703 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-01-28 06:46:45,714 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:46:45,719 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;@438b88b4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:46:45,720 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 06:46:45,725 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2023-01-28 06:46:45,725 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:46:45,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:46:45,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:46:45,726 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:46:45,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:46:45,730 INFO L85 PathProgramCache]: Analyzing trace with hash -420123915, now seen corresponding path program 1 times [2023-01-28 06:46:45,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:46:45,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299326338] [2023-01-28 06:46:45,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:46:45,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:46:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:46:46,167 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 06:46:46,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:46:46,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299326338] [2023-01-28 06:46:46,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299326338] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:46:46,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:46:46,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:46:46,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290932830] [2023-01-28 06:46:46,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:46:46,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:46:46,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:46:46,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:46:46,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:46:46,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 216 [2023-01-28 06:46:46,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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 06:46:46,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:46:46,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 216 [2023-01-28 06:46:46,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:46:46,440 INFO L130 PetriNetUnfolder]: 644/1045 cut-off events. [2023-01-28 06:46:46,441 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-01-28 06:46:46,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 1045 events. 644/1045 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5339 event pairs, 112 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 2046. Up to 773 conditions per place. [2023-01-28 06:46:46,452 INFO L137 encePairwiseOnDemand]: 212/216 looper letters, 24 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2023-01-28 06:46:46,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 129 flow [2023-01-28 06:46:46,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:46:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:46:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2023-01-28 06:46:46,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5200617283950617 [2023-01-28 06:46:46,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2023-01-28 06:46:46,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2023-01-28 06:46:46,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:46:46,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2023-01-28 06:46:46,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 06:46:46,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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 06:46:46,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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 06:46:46,487 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 337 transitions. [2023-01-28 06:46:46,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 129 flow [2023-01-28 06:46:46,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 06:46:46,491 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-01-28 06:46:46,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-01-28 06:46:46,497 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-28 06:46:46,497 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-01-28 06:46:46,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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 06:46:46,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:46:46,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:46:46,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:46:46,498 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:46:46,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:46:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash -12109673, now seen corresponding path program 1 times [2023-01-28 06:46:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:46:46,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990695697] [2023-01-28 06:46:46,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:46:46,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:46:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:46:46,874 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 06:46:46,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:46:46,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990695697] [2023-01-28 06:46:46,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990695697] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:46:46,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:46:46,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:46:46,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472083440] [2023-01-28 06:46:46,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:46:46,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:46:46,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:46:46,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:46:46,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:46:46,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2023-01-28 06:46:46,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:46:46,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:46:46,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2023-01-28 06:46:46,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:46:47,107 INFO L130 PetriNetUnfolder]: 1375/2028 cut-off events. [2023-01-28 06:46:47,107 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2023-01-28 06:46:47,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4218 conditions, 2028 events. 1375/2028 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8323 event pairs, 597 based on Foata normal form. 8/2036 useless extension candidates. Maximal degree in co-relation 4208. Up to 1953 conditions per place. [2023-01-28 06:46:47,118 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2023-01-28 06:46:47,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 152 flow [2023-01-28 06:46:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:46:47,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:46:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-01-28 06:46:47,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4799382716049383 [2023-01-28 06:46:47,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-01-28 06:46:47,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-01-28 06:46:47,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:46:47,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-01-28 06:46:47,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 06:46:47,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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 06:46:47,126 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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 06:46:47,126 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 311 transitions. [2023-01-28 06:46:47,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 152 flow [2023-01-28 06:46:47,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:46:47,129 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 76 flow [2023-01-28 06:46:47,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2023-01-28 06:46:47,130 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-28 06:46:47,130 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 76 flow [2023-01-28 06:46:47,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:46:47,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:46:47,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:46:47,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:46:47,131 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:46:47,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:46:47,134 INFO L85 PathProgramCache]: Analyzing trace with hash 17336372, now seen corresponding path program 1 times [2023-01-28 06:46:47,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:46:47,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121205992] [2023-01-28 06:46:47,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:46:47,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:46:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:46:47,370 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 06:46:47,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:46:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121205992] [2023-01-28 06:46:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121205992] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:46:47,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:46:47,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:46:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083546997] [2023-01-28 06:46:47,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:46:47,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:46:47,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:46:47,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:46:47,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:46:47,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2023-01-28 06:46:47,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 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 06:46:47,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:46:47,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2023-01-28 06:46:47,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:46:47,623 INFO L130 PetriNetUnfolder]: 1269/1880 cut-off events. [2023-01-28 06:46:47,623 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2023-01-28 06:46:47,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 1880 events. 1269/1880 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7453 event pairs, 405 based on Foata normal form. 42/1922 useless extension candidates. Maximal degree in co-relation 4279. Up to 1316 conditions per place. [2023-01-28 06:46:47,634 INFO L137 encePairwiseOnDemand]: 213/216 looper letters, 32 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-01-28 06:46:47,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 170 flow [2023-01-28 06:46:47,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:46:47,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:46:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-01-28 06:46:47,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47685185185185186 [2023-01-28 06:46:47,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-01-28 06:46:47,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-01-28 06:46:47,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:46:47,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-01-28 06:46:47,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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 06:46:47,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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 06:46:47,639 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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 06:46:47,639 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 76 flow. Second operand 3 states and 309 transitions. [2023-01-28 06:46:47,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 170 flow [2023-01-28 06:46:47,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:46:47,640 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 83 flow [2023-01-28 06:46:47,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2023-01-28 06:46:47,641 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2023-01-28 06:46:47,644 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 83 flow [2023-01-28 06:46:47,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 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 06:46:47,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:46:47,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:46:47,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:46:47,645 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:46:47,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:46:47,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1217666721, now seen corresponding path program 1 times [2023-01-28 06:46:47,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:46:47,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313082070] [2023-01-28 06:46:47,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:46:47,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:46:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:46:47,849 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 06:46:47,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:46:47,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313082070] [2023-01-28 06:46:47,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313082070] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:46:47,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:46:47,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:46:47,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518334759] [2023-01-28 06:46:47,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:46:47,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:46:47,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:46:47,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:46:47,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:46:47,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2023-01-28 06:46:47,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 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 06:46:47,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:46:47,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2023-01-28 06:46:47,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:46:48,059 INFO L130 PetriNetUnfolder]: 1167/1738 cut-off events. [2023-01-28 06:46:48,059 INFO L131 PetriNetUnfolder]: For 583/583 co-relation queries the response was YES. [2023-01-28 06:46:48,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 1738 events. 1167/1738 cut-off events. For 583/583 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6910 event pairs, 726 based on Foata normal form. 40/1778 useless extension candidates. Maximal degree in co-relation 4091. Up to 1181 conditions per place. [2023-01-28 06:46:48,068 INFO L137 encePairwiseOnDemand]: 213/216 looper letters, 37 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2023-01-28 06:46:48,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 204 flow [2023-01-28 06:46:48,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:46:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:46:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-01-28 06:46:48,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845679012345679 [2023-01-28 06:46:48,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-01-28 06:46:48,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-01-28 06:46:48,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:46:48,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-01-28 06:46:48,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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 06:46:48,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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 06:46:48,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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 06:46:48,080 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 83 flow. Second operand 3 states and 314 transitions. [2023-01-28 06:46:48,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 204 flow [2023-01-28 06:46:48,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:46:48,082 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 88 flow [2023-01-28 06:46:48,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-01-28 06:46:48,084 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-01-28 06:46:48,084 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 88 flow [2023-01-28 06:46:48,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 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 06:46:48,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:46:48,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:46:48,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:46:48,085 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:46:48,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:46:48,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1441772436, now seen corresponding path program 1 times [2023-01-28 06:46:48,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:46:48,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108529426] [2023-01-28 06:46:48,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:46:48,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:46:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:46:48,309 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 06:46:48,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:46:48,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108529426] [2023-01-28 06:46:48,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108529426] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:46:48,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:46:48,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:46:48,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364901898] [2023-01-28 06:46:48,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:46:48,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:46:48,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:46:48,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:46:48,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:46:48,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 216 [2023-01-28 06:46:48,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 06:46:48,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:46:48,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 216 [2023-01-28 06:46:48,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:46:48,474 INFO L130 PetriNetUnfolder]: 631/1022 cut-off events. [2023-01-28 06:46:48,474 INFO L131 PetriNetUnfolder]: For 255/255 co-relation queries the response was YES. [2023-01-28 06:46:48,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2344 conditions, 1022 events. 631/1022 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4765 event pairs, 235 based on Foata normal form. 12/1027 useless extension candidates. Maximal degree in co-relation 2330. Up to 646 conditions per place. [2023-01-28 06:46:48,480 INFO L137 encePairwiseOnDemand]: 213/216 looper letters, 28 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-01-28 06:46:48,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 175 flow [2023-01-28 06:46:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:46:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:46:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2023-01-28 06:46:48,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2023-01-28 06:46:48,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2023-01-28 06:46:48,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2023-01-28 06:46:48,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:46:48,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2023-01-28 06:46:48,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 06:46:48,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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 06:46:48,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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 06:46:48,485 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 88 flow. Second operand 3 states and 330 transitions. [2023-01-28 06:46:48,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 175 flow [2023-01-28 06:46:48,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 169 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:46:48,487 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 93 flow [2023-01-28 06:46:48,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-01-28 06:46:48,489 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-01-28 06:46:48,489 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 93 flow [2023-01-28 06:46:48,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 06:46:48,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:46:48,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:46:48,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:46:48,490 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:46:48,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:46:48,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1891951879, now seen corresponding path program 1 times [2023-01-28 06:46:48,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:46:48,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659964563] [2023-01-28 06:46:48,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:46:48,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:46:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:46:48,760 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 06:46:48,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:46:48,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659964563] [2023-01-28 06:46:48,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659964563] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:46:48,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:46:48,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:46:48,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924346858] [2023-01-28 06:46:48,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:46:48,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:46:48,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:46:48,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:46:48,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:46:48,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 216 [2023-01-28 06:46:48,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 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 06:46:48,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:46:48,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 216 [2023-01-28 06:46:48,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:46:48,934 INFO L130 PetriNetUnfolder]: 448/792 cut-off events. [2023-01-28 06:46:48,935 INFO L131 PetriNetUnfolder]: For 187/191 co-relation queries the response was YES. [2023-01-28 06:46:48,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 792 events. 448/792 cut-off events. For 187/191 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3929 event pairs, 88 based on Foata normal form. 88/863 useless extension candidates. Maximal degree in co-relation 1805. Up to 437 conditions per place. [2023-01-28 06:46:48,939 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 43 selfloop transitions, 7 changer transitions 2/58 dead transitions. [2023-01-28 06:46:48,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 58 transitions, 279 flow [2023-01-28 06:46:48,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:46:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:46:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2023-01-28 06:46:48,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925925925925926 [2023-01-28 06:46:48,942 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2023-01-28 06:46:48,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2023-01-28 06:46:48,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:46:48,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2023-01-28 06:46:48,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 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 06:46:48,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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 06:46:48,947 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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 06:46:48,947 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 93 flow. Second operand 5 states and 532 transitions. [2023-01-28 06:46:48,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 58 transitions, 279 flow [2023-01-28 06:46:48,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 58 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:46:48,953 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 141 flow [2023-01-28 06:46:48,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-01-28 06:46:48,955 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-01-28 06:46:48,955 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 141 flow [2023-01-28 06:46:48,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 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 06:46:48,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:46:48,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:46:48,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:46:48,956 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:46:48,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:46:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash -236407342, now seen corresponding path program 1 times [2023-01-28 06:46:48,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:46:48,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236482645] [2023-01-28 06:46:48,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:46:48,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:46:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:46:49,213 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 06:46:49,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:46:49,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236482645] [2023-01-28 06:46:49,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236482645] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:46:49,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:46:49,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:46:49,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092562455] [2023-01-28 06:46:49,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:46:49,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:46:49,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:46:49,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:46:49,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:46:49,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2023-01-28 06:46:49,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 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 06:46:49,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:46:49,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2023-01-28 06:46:49,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:46:49,554 INFO L130 PetriNetUnfolder]: 1071/1751 cut-off events. [2023-01-28 06:46:49,555 INFO L131 PetriNetUnfolder]: For 1452/1452 co-relation queries the response was YES. [2023-01-28 06:46:49,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5523 conditions, 1751 events. 1071/1751 cut-off events. For 1452/1452 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8503 event pairs, 103 based on Foata normal form. 18/1769 useless extension candidates. Maximal degree in co-relation 5505. Up to 1059 conditions per place. [2023-01-28 06:46:49,563 INFO L137 encePairwiseOnDemand]: 209/216 looper letters, 53 selfloop transitions, 9 changer transitions 20/82 dead transitions. [2023-01-28 06:46:49,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 82 transitions, 510 flow [2023-01-28 06:46:49,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:46:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:46:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 607 transitions. [2023-01-28 06:46:49,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4683641975308642 [2023-01-28 06:46:49,565 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 607 transitions. [2023-01-28 06:46:49,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 607 transitions. [2023-01-28 06:46:49,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:46:49,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 607 transitions. [2023-01-28 06:46:49,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 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 06:46:49,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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 06:46:49,569 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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 06:46:49,570 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 141 flow. Second operand 6 states and 607 transitions. [2023-01-28 06:46:49,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 82 transitions, 510 flow [2023-01-28 06:46:49,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:46:49,575 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 161 flow [2023-01-28 06:46:49,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2023-01-28 06:46:49,576 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-01-28 06:46:49,576 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 161 flow [2023-01-28 06:46:49,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 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 06:46:49,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:46:49,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:46:49,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:46:49,577 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:46:49,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:46:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash -831683230, now seen corresponding path program 2 times [2023-01-28 06:46:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:46:49,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825829143] [2023-01-28 06:46:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:46:49,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:46:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:46:49,855 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 06:46:49,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:46:49,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825829143] [2023-01-28 06:46:49,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825829143] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:46:49,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:46:49,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:46:49,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739274738] [2023-01-28 06:46:49,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:46:49,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:46:49,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:46:49,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:46:49,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:46:49,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 216 [2023-01-28 06:46:49,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 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 06:46:49,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:46:49,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 216 [2023-01-28 06:46:49,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:46:50,021 INFO L130 PetriNetUnfolder]: 339/661 cut-off events. [2023-01-28 06:46:50,021 INFO L131 PetriNetUnfolder]: For 508/511 co-relation queries the response was YES. [2023-01-28 06:46:50,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 661 events. 339/661 cut-off events. For 508/511 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3342 event pairs, 64 based on Foata normal form. 74/715 useless extension candidates. Maximal degree in co-relation 1966. Up to 252 conditions per place. [2023-01-28 06:46:50,025 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 45 selfloop transitions, 10 changer transitions 9/72 dead transitions. [2023-01-28 06:46:50,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 437 flow [2023-01-28 06:46:50,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:46:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:46:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 639 transitions. [2023-01-28 06:46:50,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2023-01-28 06:46:50,030 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 639 transitions. [2023-01-28 06:46:50,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 639 transitions. [2023-01-28 06:46:50,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:46:50,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 639 transitions. [2023-01-28 06:46:50,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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 06:46:50,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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 06:46:50,034 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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 06:46:50,034 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 161 flow. Second operand 6 states and 639 transitions. [2023-01-28 06:46:50,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 437 flow [2023-01-28 06:46:50,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 429 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 06:46:50,040 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 233 flow [2023-01-28 06:46:50,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-01-28 06:46:50,041 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-01-28 06:46:50,041 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 233 flow [2023-01-28 06:46:50,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 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 06:46:50,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:46:50,042 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 06:46:50,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:46:50,042 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:46:50,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:46:50,042 INFO L85 PathProgramCache]: Analyzing trace with hash -406954638, now seen corresponding path program 1 times [2023-01-28 06:46:50,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:46:50,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940995080] [2023-01-28 06:46:50,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:46:50,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:46:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:46:50,325 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 06:46:50,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:46:50,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940995080] [2023-01-28 06:46:50,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940995080] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:46:50,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:46:50,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:46:50,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023094454] [2023-01-28 06:46:50,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:46:50,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:46:50,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:46:50,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:46:50,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:46:50,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 216 [2023-01-28 06:46:50,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 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 06:46:50,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:46:50,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 216 [2023-01-28 06:46:50,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:46:50,503 INFO L130 PetriNetUnfolder]: 296/593 cut-off events. [2023-01-28 06:46:50,503 INFO L131 PetriNetUnfolder]: For 790/792 co-relation queries the response was YES. [2023-01-28 06:46:50,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2073 conditions, 593 events. 296/593 cut-off events. For 790/792 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3012 event pairs, 59 based on Foata normal form. 21/594 useless extension candidates. Maximal degree in co-relation 2049. Up to 225 conditions per place. [2023-01-28 06:46:50,506 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 34 selfloop transitions, 11 changer transitions 22/72 dead transitions. [2023-01-28 06:46:50,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 483 flow [2023-01-28 06:46:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:46:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:46:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 831 transitions. [2023-01-28 06:46:50,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4809027777777778 [2023-01-28 06:46:50,509 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 831 transitions. [2023-01-28 06:46:50,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 831 transitions. [2023-01-28 06:46:50,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:46:50,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 831 transitions. [2023-01-28 06:46:50,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 103.875) internal successors, (831), 8 states have internal predecessors, (831), 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 06:46:50,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 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 06:46:50,514 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 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 06:46:50,514 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 233 flow. Second operand 8 states and 831 transitions. [2023-01-28 06:46:50,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 483 flow [2023-01-28 06:46:50,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 434 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-01-28 06:46:50,521 INFO L231 Difference]: Finished difference. Result has 57 places, 31 transitions, 182 flow [2023-01-28 06:46:50,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=57, PETRI_TRANSITIONS=31} [2023-01-28 06:46:50,522 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2023-01-28 06:46:50,522 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 31 transitions, 182 flow [2023-01-28 06:46:50,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 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 06:46:50,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:46:50,523 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 06:46:50,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:46:50,523 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:46:50,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:46:50,523 INFO L85 PathProgramCache]: Analyzing trace with hash 464481527, now seen corresponding path program 1 times [2023-01-28 06:46:50,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:46:50,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076602915] [2023-01-28 06:46:50,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:46:50,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:46:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:46:50,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 06:46:50,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:46:50,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076602915] [2023-01-28 06:46:50,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076602915] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:46:50,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:46:50,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:46:50,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124724675] [2023-01-28 06:46:50,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:46:50,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:46:50,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:46:50,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:46:50,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:46:50,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 216 [2023-01-28 06:46:50,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 31 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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 06:46:50,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:46:50,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 216 [2023-01-28 06:46:50,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:46:50,893 INFO L130 PetriNetUnfolder]: 239/526 cut-off events. [2023-01-28 06:46:50,893 INFO L131 PetriNetUnfolder]: For 931/932 co-relation queries the response was YES. [2023-01-28 06:46:50,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 526 events. 239/526 cut-off events. For 931/932 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2706 event pairs, 65 based on Foata normal form. 1/520 useless extension candidates. Maximal degree in co-relation 1757. Up to 277 conditions per place. [2023-01-28 06:46:50,896 INFO L137 encePairwiseOnDemand]: 213/216 looper letters, 26 selfloop transitions, 1 changer transitions 31/61 dead transitions. [2023-01-28 06:46:50,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 486 flow [2023-01-28 06:46:50,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:46:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:46:50,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2023-01-28 06:46:50,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5011574074074074 [2023-01-28 06:46:50,898 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 433 transitions. [2023-01-28 06:46:50,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 433 transitions. [2023-01-28 06:46:50,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:46:50,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 433 transitions. [2023-01-28 06:46:50,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:46:50,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 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 06:46:50,901 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 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 06:46:50,901 INFO L175 Difference]: Start difference. First operand has 57 places, 31 transitions, 182 flow. Second operand 4 states and 433 transitions. [2023-01-28 06:46:50,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 486 flow [2023-01-28 06:46:50,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 384 flow, removed 29 selfloop flow, removed 9 redundant places. [2023-01-28 06:46:50,907 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 124 flow [2023-01-28 06:46:50,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-01-28 06:46:50,909 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-01-28 06:46:50,909 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 124 flow [2023-01-28 06:46:50,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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 06:46:50,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:46:50,909 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 06:46:50,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:46:50,909 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:46:50,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:46:50,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1166520171, now seen corresponding path program 2 times [2023-01-28 06:46:50,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:46:50,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556326917] [2023-01-28 06:46:50,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:46:50,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:46:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:46:52,267 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 06:46:52,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:46:52,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556326917] [2023-01-28 06:46:52,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556326917] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:46:52,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:46:52,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:46:52,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878434260] [2023-01-28 06:46:52,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:46:52,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:46:52,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:46:52,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:46:52,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:46:52,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 216 [2023-01-28 06:46:52,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 28 transitions, 124 flow. Second operand has 8 states, 8 states have (on average 93.25) internal successors, (746), 8 states have internal predecessors, (746), 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 06:46:52,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:46:52,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 216 [2023-01-28 06:46:52,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:46:52,409 INFO L130 PetriNetUnfolder]: 68/170 cut-off events. [2023-01-28 06:46:52,409 INFO L131 PetriNetUnfolder]: For 223/223 co-relation queries the response was YES. [2023-01-28 06:46:52,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 170 events. 68/170 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 614 event pairs, 13 based on Foata normal form. 1/167 useless extension candidates. Maximal degree in co-relation 529. Up to 65 conditions per place. [2023-01-28 06:46:52,410 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 24 selfloop transitions, 4 changer transitions 17/49 dead transitions. [2023-01-28 06:46:52,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 325 flow [2023-01-28 06:46:52,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:46:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:46:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 669 transitions. [2023-01-28 06:46:52,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44246031746031744 [2023-01-28 06:46:52,413 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 669 transitions. [2023-01-28 06:46:52,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 669 transitions. [2023-01-28 06:46:52,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:46:52,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 669 transitions. [2023-01-28 06:46:52,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 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 06:46:52,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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 06:46:52,418 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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 06:46:52,418 INFO L175 Difference]: Start difference. First operand has 48 places, 28 transitions, 124 flow. Second operand 7 states and 669 transitions. [2023-01-28 06:46:52,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 325 flow [2023-01-28 06:46:52,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 312 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-01-28 06:46:52,420 INFO L231 Difference]: Finished difference. Result has 49 places, 28 transitions, 130 flow [2023-01-28 06:46:52,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=130, PETRI_PLACES=49, PETRI_TRANSITIONS=28} [2023-01-28 06:46:52,421 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-01-28 06:46:52,421 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 28 transitions, 130 flow [2023-01-28 06:46:52,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.25) internal successors, (746), 8 states have internal predecessors, (746), 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 06:46:52,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:46:52,422 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 06:46:52,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:46:52,422 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:46:52,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:46:52,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1923569367, now seen corresponding path program 3 times [2023-01-28 06:46:52,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:46:52,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430394186] [2023-01-28 06:46:52,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:46:52,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:46:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:46:52,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:46:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:46:52,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:46:52,578 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:46:52,578 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 06:46:52,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 06:46:52,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 06:46:52,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 06:46:52,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 06:46:52,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 06:46:52,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:46:52,581 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:46:52,586 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:46:52,586 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:46:52,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:46:52 BasicIcfg [2023-01-28 06:46:52,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:46:52,658 INFO L158 Benchmark]: Toolchain (without parser) took 12163.83ms. Allocated memory was 360.7MB in the beginning and 742.4MB in the end (delta: 381.7MB). Free memory was 313.4MB in the beginning and 528.6MB in the end (delta: -215.2MB). Peak memory consumption was 167.6MB. Max. memory is 16.0GB. [2023-01-28 06:46:52,659 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 360.7MB. Free memory is still 309.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:46:52,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.56ms. Allocated memory is still 360.7MB. Free memory was 313.1MB in the beginning and 289.4MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 06:46:52,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.19ms. Allocated memory is still 360.7MB. Free memory was 289.4MB in the beginning and 286.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 06:46:52,659 INFO L158 Benchmark]: Boogie Preprocessor took 23.99ms. Allocated memory is still 360.7MB. Free memory was 286.6MB in the beginning and 284.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:46:52,659 INFO L158 Benchmark]: RCFGBuilder took 687.98ms. Allocated memory was 360.7MB in the beginning and 608.2MB in the end (delta: 247.5MB). Free memory was 284.5MB in the beginning and 554.6MB in the end (delta: -270.1MB). Peak memory consumption was 28.4MB. Max. memory is 16.0GB. [2023-01-28 06:46:52,660 INFO L158 Benchmark]: TraceAbstraction took 10858.16ms. Allocated memory was 608.2MB in the beginning and 742.4MB in the end (delta: 134.2MB). Free memory was 553.6MB in the beginning and 528.6MB in the end (delta: 24.9MB). Peak memory consumption was 158.1MB. Max. memory is 16.0GB. [2023-01-28 06:46:52,661 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 360.7MB. Free memory is still 309.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 526.56ms. Allocated memory is still 360.7MB. Free memory was 313.1MB in the beginning and 289.4MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.19ms. Allocated memory is still 360.7MB. Free memory was 289.4MB in the beginning and 286.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.99ms. Allocated memory is still 360.7MB. Free memory was 286.6MB in the beginning and 284.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 687.98ms. Allocated memory was 360.7MB in the beginning and 608.2MB in the end (delta: 247.5MB). Free memory was 284.5MB in the beginning and 554.6MB in the end (delta: -270.1MB). Peak memory consumption was 28.4MB. Max. memory is 16.0GB. * TraceAbstraction took 10858.16ms. Allocated memory was 608.2MB in the beginning and 742.4MB in the end (delta: 134.2MB). Free memory was 553.6MB in the beginning and 528.6MB in the end (delta: 24.9MB). Peak memory consumption was 158.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 120 PlacesBefore, 34 PlacesAfterwards, 112 TransitionsBefore, 25 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, 5803 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2993, independent: 2794, independent conditional: 0, independent unconditional: 2794, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1246, independent: 1205, independent conditional: 0, independent unconditional: 1205, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2993, independent: 1589, independent conditional: 0, independent unconditional: 1589, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 1246, unknown conditional: 0, unknown unconditional: 1246] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L858] 0 pthread_t t41; [L859] FCALL, FORK 0 pthread_create(&t41, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t41, ((void *)0), P0, ((void *)0))=-2, t41={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] [L860] 0 pthread_t t42; [L861] FCALL, FORK 0 pthread_create(&t42, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t42, ((void *)0), P1, ((void *)0))=-1, t41={5:0}, t42={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] [L862] 0 pthread_t t43; [L863] FCALL, FORK 0 pthread_create(&t43, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t43, ((void *)0), P2, ((void *)0))=0, t41={5:0}, t42={6:0}, t43={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] [L805] 3 z$w_buff1 = z$w_buff0 [L806] 3 z$w_buff0 = 1 [L807] 3 z$w_buff1_used = z$w_buff0_used [L808] 3 z$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L810] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L811] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L812] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L813] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 z$flush_delayed = weak$$choice2 [L820] 3 z$mem_tmp = z [L821] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L822] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L823] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L824] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L825] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L827] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EAX = z [L829] 3 z = z$flush_delayed ? z$mem_tmp : z [L830] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 a = 1 [L756] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, 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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, 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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 z$flush_delayed = weak$$choice2 [L783] 2 z$mem_tmp = z [L784] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L785] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L786] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L787] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L788] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L790] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EBX = z [L792] 2 z = z$flush_delayed ? z$mem_tmp : z [L793] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, 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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 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) [L837] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L838] 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 [L839] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 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, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$$choice2=0, x=1, y=1, 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=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 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 [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 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, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice2=0, x=1, y=1, 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=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, 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=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 861]: 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: 859]: 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, 144 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: 10.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 795 IncrementalHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 20 mSDtfsCounter, 795 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=8, InterpolantAutomatonStates: 51, 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.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 1059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 06:46:52,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...