/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 05:36:28,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 05:36:28,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 05:36:28,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 05:36:28,233 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 05:36:28,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 05:36:28,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 05:36:28,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 05:36:28,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 05:36:28,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 05:36:28,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 05:36:28,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 05:36:28,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 05:36:28,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 05:36:28,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 05:36:28,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 05:36:28,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 05:36:28,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 05:36:28,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 05:36:28,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 05:36:28,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 05:36:28,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 05:36:28,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 05:36:28,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 05:36:28,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 05:36:28,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 05:36:28,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 05:36:28,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 05:36:28,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 05:36:28,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 05:36:28,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 05:36:28,286 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 05:36:28,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 05:36:28,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 05:36:28,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 05:36:28,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 05:36:28,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 05:36:28,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 05:36:28,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 05:36:28,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 05:36:28,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 05:36:28,290 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-RepeatedSemanticLbe.epf [2022-12-13 05:36:28,315 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 05:36:28,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 05:36:28,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 05:36:28,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 05:36:28,316 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 05:36:28,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 05:36:28,317 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 05:36:28,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 05:36:28,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 05:36:28,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 05:36:28,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 05:36:28,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 05:36:28,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 05:36:28,318 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 05:36:28,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 05:36:28,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 05:36:28,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 05:36:28,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 05:36:28,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 05:36:28,319 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 05:36:28,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 05:36:28,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:36:28,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 05:36:28,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 05:36:28,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 05:36:28,320 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 05:36:28,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 05:36:28,320 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 05:36:28,320 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 05:36:28,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 05:36:28,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 05:36:28,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 05:36:28,579 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 05:36:28,579 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 05:36:28,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2022-12-13 05:36:29,500 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 05:36:29,690 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 05:36:29,691 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2022-12-13 05:36:29,695 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cec71658/f168ca3f4d4d433c8ce633802ed4a452/FLAG093d79e58 [2022-12-13 05:36:29,715 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cec71658/f168ca3f4d4d433c8ce633802ed4a452 [2022-12-13 05:36:29,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 05:36:29,717 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 05:36:29,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 05:36:29,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 05:36:29,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 05:36:29,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:36:29" (1/1) ... [2022-12-13 05:36:29,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5248e11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:29, skipping insertion in model container [2022-12-13 05:36:29,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:36:29" (1/1) ... [2022-12-13 05:36:29,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 05:36:29,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 05:36:29,893 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c[2808,2821] [2022-12-13 05:36:29,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:36:29,907 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 05:36:29,931 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c[2808,2821] [2022-12-13 05:36:29,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:36:29,946 INFO L208 MainTranslator]: Completed translation [2022-12-13 05:36:29,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:29 WrapperNode [2022-12-13 05:36:29,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 05:36:29,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 05:36:29,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 05:36:29,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 05:36:29,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:29" (1/1) ... [2022-12-13 05:36:29,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:29" (1/1) ... [2022-12-13 05:36:29,995 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 183 [2022-12-13 05:36:29,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 05:36:29,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 05:36:29,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 05:36:29,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 05:36:30,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:29" (1/1) ... [2022-12-13 05:36:30,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:29" (1/1) ... [2022-12-13 05:36:30,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:29" (1/1) ... [2022-12-13 05:36:30,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:29" (1/1) ... [2022-12-13 05:36:30,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:29" (1/1) ... [2022-12-13 05:36:30,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:29" (1/1) ... [2022-12-13 05:36:30,023 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:29" (1/1) ... [2022-12-13 05:36:30,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:29" (1/1) ... [2022-12-13 05:36:30,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 05:36:30,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 05:36:30,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 05:36:30,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 05:36:30,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:29" (1/1) ... [2022-12-13 05:36:30,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:36:30,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:36:30,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 05:36:30,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 05:36:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 05:36:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 05:36:30,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 05:36:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 05:36:30,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 05:36:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 05:36:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 05:36:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 05:36:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 05:36:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 05:36:30,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 05:36:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 05:36:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 05:36:30,123 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 05:36:30,237 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 05:36:30,238 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 05:36:30,541 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 05:36:30,547 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 05:36:30,547 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 05:36:30,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:36:30 BoogieIcfgContainer [2022-12-13 05:36:30,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 05:36:30,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 05:36:30,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 05:36:30,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 05:36:30,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:36:29" (1/3) ... [2022-12-13 05:36:30,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6297f391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:36:30, skipping insertion in model container [2022-12-13 05:36:30,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:29" (2/3) ... [2022-12-13 05:36:30,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6297f391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:36:30, skipping insertion in model container [2022-12-13 05:36:30,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:36:30" (3/3) ... [2022-12-13 05:36:30,554 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2022-12-13 05:36:30,568 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 05:36:30,568 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 05:36:30,568 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 05:36:30,651 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 05:36:30,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 219 transitions, 454 flow [2022-12-13 05:36:30,763 INFO L130 PetriNetUnfolder]: 21/217 cut-off events. [2022-12-13 05:36:30,764 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 05:36:30,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 217 events. 21/217 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 381 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 133. Up to 2 conditions per place. [2022-12-13 05:36:30,769 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 219 transitions, 454 flow [2022-12-13 05:36:30,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 209 transitions, 430 flow [2022-12-13 05:36:30,775 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:36:30,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 209 transitions, 430 flow [2022-12-13 05:36:30,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 209 transitions, 430 flow [2022-12-13 05:36:30,837 INFO L130 PetriNetUnfolder]: 21/209 cut-off events. [2022-12-13 05:36:30,837 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 05:36:30,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 209 events. 21/209 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 362 event pairs, 0 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 133. Up to 2 conditions per place. [2022-12-13 05:36:30,845 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 209 transitions, 430 flow [2022-12-13 05:36:30,845 INFO L226 LiptonReduction]: Number of co-enabled transitions 5492 [2022-12-13 05:36:37,082 INFO L241 LiptonReduction]: Total number of compositions: 189 [2022-12-13 05:36:37,092 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 05:36:37,096 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=REPEATED_LIPTON_PN, 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;@3d0c4344, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 05:36:37,097 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 05:36:37,101 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-13 05:36:37,101 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 05:36:37,101 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:36:37,101 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:36:37,102 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:36:37,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:36:37,105 INFO L85 PathProgramCache]: Analyzing trace with hash 31865598, now seen corresponding path program 1 times [2022-12-13 05:36:37,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:36:37,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726625252] [2022-12-13 05:36:37,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:36:37,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:36:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:36:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:37,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:36:37,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726625252] [2022-12-13 05:36:37,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726625252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:36:37,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:36:37,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 05:36:37,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267421947] [2022-12-13 05:36:37,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:36:37,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 05:36:37,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:36:37,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 05:36:37,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 05:36:37,427 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 05:36:37,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:37,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:36:37,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 05:36:37,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:36:37,508 INFO L130 PetriNetUnfolder]: 49/84 cut-off events. [2022-12-13 05:36:37,508 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 05:36:37,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 84 events. 49/84 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 19 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 129. Up to 81 conditions per place. [2022-12-13 05:36:37,511 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-13 05:36:37,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-13 05:36:37,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 05:36:37,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 05:36:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-13 05:36:37,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-13 05:36:37,522 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-13 05:36:37,522 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 05:36:37,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 80 flow [2022-12-13 05:36:37,524 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:36:37,524 INFO L89 Accepts]: Start accepts. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 05:36:37,527 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:36:37,527 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:36:37,527 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 18 transitions, 80 flow [2022-12-13 05:36:37,530 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 18 transitions, 80 flow [2022-12-13 05:36:37,530 INFO L226 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-13 05:36:38,204 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:36:38,206 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 682 [2022-12-13 05:36:38,206 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 76 flow [2022-12-13 05:36:38,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:38,206 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:36:38,206 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:36:38,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 05:36:38,206 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:36:38,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:36:38,207 INFO L85 PathProgramCache]: Analyzing trace with hash -733193231, now seen corresponding path program 1 times [2022-12-13 05:36:38,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:36:38,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78798032] [2022-12-13 05:36:38,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:36:38,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:36:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:36:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:38,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:36:38,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78798032] [2022-12-13 05:36:38,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78798032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:36:38,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:36:38,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:36:38,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884309623] [2022-12-13 05:36:38,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:36:38,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:36:38,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:36:38,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:36:38,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:36:38,455 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 05:36:38,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:38,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:36:38,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 05:36:38,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:36:39,103 INFO L130 PetriNetUnfolder]: 72/134 cut-off events. [2022-12-13 05:36:39,104 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 05:36:39,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 134 events. 72/134 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 367 event pairs, 24 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 286. Up to 113 conditions per place. [2022-12-13 05:36:39,106 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 34 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2022-12-13 05:36:39,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 39 transitions, 253 flow [2022-12-13 05:36:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:36:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:36:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-13 05:36:39,117 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-13 05:36:39,117 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-13 05:36:39,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 39 transitions, 253 flow [2022-12-13 05:36:39,118 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 39 transitions, 253 flow [2022-12-13 05:36:39,119 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:36:39,119 INFO L89 Accepts]: Start accepts. Operand has 26 places, 39 transitions, 253 flow [2022-12-13 05:36:39,120 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:36:39,120 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:36:39,120 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 39 transitions, 253 flow [2022-12-13 05:36:39,121 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 39 transitions, 253 flow [2022-12-13 05:36:39,121 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:36:39,121 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:36:39,122 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 05:36:39,122 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 39 transitions, 253 flow [2022-12-13 05:36:39,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:39,122 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:36:39,122 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:36:39,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 05:36:39,122 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:36:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:36:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash -199465663, now seen corresponding path program 2 times [2022-12-13 05:36:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:36:39,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564728403] [2022-12-13 05:36:39,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:36:39,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:36:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:36:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:39,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:36:39,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564728403] [2022-12-13 05:36:39,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564728403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:36:39,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:36:39,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:36:39,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436656263] [2022-12-13 05:36:39,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:36:39,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:36:39,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:36:39,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:36:39,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:36:39,284 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 05:36:39,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 39 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:39,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:36:39,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 05:36:39,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:36:39,373 INFO L130 PetriNetUnfolder]: 111/207 cut-off events. [2022-12-13 05:36:39,374 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-12-13 05:36:39,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 207 events. 111/207 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 675 event pairs, 24 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 592. Up to 182 conditions per place. [2022-12-13 05:36:39,375 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 63 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2022-12-13 05:36:39,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 75 transitions, 633 flow [2022-12-13 05:36:39,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:36:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:36:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-13 05:36:39,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4235294117647059 [2022-12-13 05:36:39,376 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 9 predicate places. [2022-12-13 05:36:39,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 75 transitions, 633 flow [2022-12-13 05:36:39,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 75 transitions, 633 flow [2022-12-13 05:36:39,378 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:36:39,378 INFO L89 Accepts]: Start accepts. Operand has 30 places, 75 transitions, 633 flow [2022-12-13 05:36:39,379 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:36:39,379 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:36:39,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 75 transitions, 633 flow [2022-12-13 05:36:39,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 75 transitions, 633 flow [2022-12-13 05:36:39,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:36:39,380 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:36:39,381 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 05:36:39,381 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 75 transitions, 633 flow [2022-12-13 05:36:39,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:39,381 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:36:39,382 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:36:39,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 05:36:39,382 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:36:39,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:36:39,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1633050075, now seen corresponding path program 3 times [2022-12-13 05:36:39,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:36:39,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746700647] [2022-12-13 05:36:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:36:39,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:36:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:36:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:39,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:36:39,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746700647] [2022-12-13 05:36:39,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746700647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:36:39,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:36:39,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:36:39,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588737588] [2022-12-13 05:36:39,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:36:39,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:36:39,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:36:39,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:36:39,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:36:39,493 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 05:36:39,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 75 transitions, 633 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:39,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:36:39,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 05:36:39,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:36:39,584 INFO L130 PetriNetUnfolder]: 125/235 cut-off events. [2022-12-13 05:36:39,584 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-13 05:36:39,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 235 events. 125/235 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 813 event pairs, 24 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 833. Up to 210 conditions per place. [2022-12-13 05:36:39,585 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 76 selfloop transitions, 16 changer transitions 0/92 dead transitions. [2022-12-13 05:36:39,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 92 transitions, 962 flow [2022-12-13 05:36:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:36:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:36:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 05:36:39,586 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5058823529411764 [2022-12-13 05:36:39,587 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2022-12-13 05:36:39,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 92 transitions, 962 flow [2022-12-13 05:36:39,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 92 transitions, 962 flow [2022-12-13 05:36:39,589 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:36:39,589 INFO L89 Accepts]: Start accepts. Operand has 34 places, 92 transitions, 962 flow [2022-12-13 05:36:39,589 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:36:39,590 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:36:39,590 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 92 transitions, 962 flow [2022-12-13 05:36:39,591 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 92 transitions, 962 flow [2022-12-13 05:36:39,591 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:36:39,591 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:36:39,592 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 05:36:39,592 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 92 transitions, 962 flow [2022-12-13 05:36:39,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:39,592 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:36:39,592 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:36:39,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 05:36:39,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:36:39,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:36:39,593 INFO L85 PathProgramCache]: Analyzing trace with hash 936690255, now seen corresponding path program 4 times [2022-12-13 05:36:39,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:36:39,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834491682] [2022-12-13 05:36:39,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:36:39,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:36:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:36:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:39,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:36:39,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834491682] [2022-12-13 05:36:39,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834491682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:36:39,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:36:39,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:36:39,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129478490] [2022-12-13 05:36:39,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:36:39,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:36:39,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:36:39,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:36:39,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:36:39,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 05:36:39,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 92 transitions, 962 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:39,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:36:39,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 05:36:39,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:36:39,825 INFO L130 PetriNetUnfolder]: 122/226 cut-off events. [2022-12-13 05:36:39,825 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-13 05:36:39,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 226 events. 122/226 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 766 event pairs, 24 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 984. Up to 201 conditions per place. [2022-12-13 05:36:39,827 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 70 selfloop transitions, 16 changer transitions 0/86 dead transitions. [2022-12-13 05:36:39,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 86 transitions, 1068 flow [2022-12-13 05:36:39,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:36:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:36:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-13 05:36:39,828 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-13 05:36:39,828 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-13 05:36:39,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 86 transitions, 1068 flow [2022-12-13 05:36:39,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 86 transitions, 1068 flow [2022-12-13 05:36:39,831 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:36:39,831 INFO L89 Accepts]: Start accepts. Operand has 38 places, 86 transitions, 1068 flow [2022-12-13 05:36:39,831 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:36:39,831 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:36:39,832 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 86 transitions, 1068 flow [2022-12-13 05:36:39,833 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 86 transitions, 1068 flow [2022-12-13 05:36:39,833 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:36:39,833 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:36:39,834 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 05:36:39,834 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 86 transitions, 1068 flow [2022-12-13 05:36:39,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:39,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:36:39,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:36:39,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 05:36:39,834 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:36:39,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:36:39,834 INFO L85 PathProgramCache]: Analyzing trace with hash 7647497, now seen corresponding path program 5 times [2022-12-13 05:36:39,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:36:39,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832640834] [2022-12-13 05:36:39,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:36:39,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:36:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:36:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:39,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:36:39,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832640834] [2022-12-13 05:36:39,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832640834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:36:39,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:36:39,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:36:39,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650017847] [2022-12-13 05:36:39,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:36:39,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:36:39,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:36:39,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:36:39,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:36:39,973 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 05:36:39,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 86 transitions, 1068 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:39,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:36:39,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 05:36:39,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:36:40,071 INFO L130 PetriNetUnfolder]: 118/222 cut-off events. [2022-12-13 05:36:40,071 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-12-13 05:36:40,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 222 events. 118/222 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 759 event pairs, 24 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 1136. Up to 197 conditions per place. [2022-12-13 05:36:40,072 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 70 selfloop transitions, 15 changer transitions 0/85 dead transitions. [2022-12-13 05:36:40,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 85 transitions, 1226 flow [2022-12-13 05:36:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:36:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:36:40,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-13 05:36:40,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2022-12-13 05:36:40,074 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2022-12-13 05:36:40,074 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 85 transitions, 1226 flow [2022-12-13 05:36:40,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 85 transitions, 1226 flow [2022-12-13 05:36:40,077 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:36:40,077 INFO L89 Accepts]: Start accepts. Operand has 42 places, 85 transitions, 1226 flow [2022-12-13 05:36:40,077 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:36:40,077 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:36:40,077 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 85 transitions, 1226 flow [2022-12-13 05:36:40,078 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 85 transitions, 1226 flow [2022-12-13 05:36:40,079 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:36:40,079 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:36:40,079 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 05:36:40,079 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 85 transitions, 1226 flow [2022-12-13 05:36:40,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:40,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:36:40,080 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:36:40,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 05:36:40,080 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:36:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:36:40,080 INFO L85 PathProgramCache]: Analyzing trace with hash 704007317, now seen corresponding path program 6 times [2022-12-13 05:36:40,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:36:40,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404605286] [2022-12-13 05:36:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:36:40,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:36:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:36:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:40,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:36:40,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404605286] [2022-12-13 05:36:40,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404605286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:36:40,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:36:40,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:36:40,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522385005] [2022-12-13 05:36:40,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:36:40,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:36:40,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:36:40,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:36:40,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:36:40,267 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 05:36:40,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 85 transitions, 1226 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:40,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:36:40,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 05:36:40,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:36:40,403 INFO L130 PetriNetUnfolder]: 117/215 cut-off events. [2022-12-13 05:36:40,404 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2022-12-13 05:36:40,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 215 events. 117/215 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 707 event pairs, 24 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 1276. Up to 190 conditions per place. [2022-12-13 05:36:40,406 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 64 selfloop transitions, 15 changer transitions 0/79 dead transitions. [2022-12-13 05:36:40,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 1294 flow [2022-12-13 05:36:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:36:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:36:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-13 05:36:40,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2022-12-13 05:36:40,407 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2022-12-13 05:36:40,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 79 transitions, 1294 flow [2022-12-13 05:36:40,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 79 transitions, 1294 flow [2022-12-13 05:36:40,411 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:36:40,411 INFO L89 Accepts]: Start accepts. Operand has 46 places, 79 transitions, 1294 flow [2022-12-13 05:36:40,412 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:36:40,412 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:36:40,412 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 79 transitions, 1294 flow [2022-12-13 05:36:40,414 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 79 transitions, 1294 flow [2022-12-13 05:36:40,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:36:40,414 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:36:40,415 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 05:36:40,415 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 79 transitions, 1294 flow [2022-12-13 05:36:40,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:40,415 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:36:40,415 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:36:40,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 05:36:40,415 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:36:40,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:36:40,416 INFO L85 PathProgramCache]: Analyzing trace with hash 499406937, now seen corresponding path program 1 times [2022-12-13 05:36:40,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:36:40,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269556281] [2022-12-13 05:36:40,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:36:40,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:36:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:36:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:36:40,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269556281] [2022-12-13 05:36:40,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269556281] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:36:40,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068713005] [2022-12-13 05:36:40,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:36:40,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:36:40,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:36:40,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:36:40,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 05:36:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:36:40,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 05:36:40,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:36:40,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 05:36:40,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:36:40,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:36:41,097 INFO L321 Elim1Store]: treesize reduction 19, result has 42.4 percent of original size [2022-12-13 05:36:41,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 255 treesize of output 248 [2022-12-13 05:36:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:41,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:36:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:43,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068713005] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:36:43,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:36:43,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-12-13 05:36:43,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020391562] [2022-12-13 05:36:43,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:36:43,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 05:36:43,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:36:43,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 05:36:43,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=279, Unknown=3, NotChecked=0, Total=342 [2022-12-13 05:36:43,701 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 05:36:43,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 79 transitions, 1294 flow. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:43,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:36:43,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 05:36:43,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:36:55,073 WARN L233 SmtUtils]: Spent 10.29s on a formula simplification. DAG size of input: 75 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 05:37:02,772 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 77 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 05:37:08,266 INFO L130 PetriNetUnfolder]: 472/886 cut-off events. [2022-12-13 05:37:08,266 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2022-12-13 05:37:08,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8022 conditions, 886 events. 472/886 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4432 event pairs, 20 based on Foata normal form. 6/656 useless extension candidates. Maximal degree in co-relation 4740. Up to 811 conditions per place. [2022-12-13 05:37:08,271 INFO L137 encePairwiseOnDemand]: 6/17 looper letters, 204 selfloop transitions, 72 changer transitions 110/386 dead transitions. [2022-12-13 05:37:08,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 386 transitions, 7129 flow [2022-12-13 05:37:08,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 05:37:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-13 05:37:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 239 transitions. [2022-12-13 05:37:08,275 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4134948096885813 [2022-12-13 05:37:08,277 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 58 predicate places. [2022-12-13 05:37:08,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 386 transitions, 7129 flow [2022-12-13 05:37:08,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 276 transitions, 5084 flow [2022-12-13 05:37:08,289 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:37:08,289 INFO L89 Accepts]: Start accepts. Operand has 72 places, 276 transitions, 5084 flow [2022-12-13 05:37:08,291 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:37:08,291 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:37:08,291 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 276 transitions, 5084 flow [2022-12-13 05:37:08,296 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 276 transitions, 5084 flow [2022-12-13 05:37:08,296 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:37:10,086 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:37:10,087 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1798 [2022-12-13 05:37:10,087 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 275 transitions, 5066 flow [2022-12-13 05:37:10,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:10,087 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:37:10,088 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:37:10,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 05:37:10,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:37:10,288 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:37:10,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:37:10,289 INFO L85 PathProgramCache]: Analyzing trace with hash -522702262, now seen corresponding path program 1 times [2022-12-13 05:37:10,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:37:10,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554565301] [2022-12-13 05:37:10,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:37:10,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:37:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:37:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:10,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:37:10,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554565301] [2022-12-13 05:37:10,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554565301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:37:10,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420449162] [2022-12-13 05:37:10,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:37:10,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:37:10,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:37:10,459 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:37:10,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 05:37:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:37:10,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 05:37:10,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:37:10,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 05:37:10,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:37:10,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:37:11,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:37:11,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 73 [2022-12-13 05:37:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:11,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:40:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:40:29,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420449162] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:40:29,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:40:29,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 05:40:29,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691120374] [2022-12-13 05:40:29,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:40:29,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 05:40:29,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:40:29,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 05:40:29,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=209, Unknown=2, NotChecked=0, Total=272 [2022-12-13 05:40:29,072 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 05:40:29,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 275 transitions, 5066 flow. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:40:29,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:40:29,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 05:40:29,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:40:36,915 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 51 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 05:40:48,337 WARN L233 SmtUtils]: Spent 10.27s on a formula simplification. DAG size of input: 69 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 05:40:54,732 WARN L233 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 75 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 05:40:54,935 INFO L130 PetriNetUnfolder]: 361/854 cut-off events. [2022-12-13 05:40:54,935 INFO L131 PetriNetUnfolder]: For 220/220 co-relation queries the response was YES. [2022-12-13 05:40:54,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8606 conditions, 854 events. 361/854 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5308 event pairs, 2 based on Foata normal form. 4/688 useless extension candidates. Maximal degree in co-relation 4468. Up to 785 conditions per place. [2022-12-13 05:40:54,941 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 301 selfloop transitions, 109 changer transitions 28/438 dead transitions. [2022-12-13 05:40:54,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 438 transitions, 8992 flow [2022-12-13 05:40:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 05:40:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-13 05:40:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 168 transitions. [2022-12-13 05:40:54,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3218390804597701 [2022-12-13 05:40:54,943 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 78 predicate places. [2022-12-13 05:40:54,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 438 transitions, 8992 flow [2022-12-13 05:40:54,951 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 410 transitions, 8411 flow [2022-12-13 05:40:54,955 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:40:54,955 INFO L89 Accepts]: Start accepts. Operand has 95 places, 410 transitions, 8411 flow [2022-12-13 05:40:54,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:40:54,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:40:54,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 410 transitions, 8411 flow [2022-12-13 05:40:54,962 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 410 transitions, 8411 flow [2022-12-13 05:40:54,962 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:40:54,963 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:40:54,964 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 05:40:54,964 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 410 transitions, 8411 flow [2022-12-13 05:40:54,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:40:54,964 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:40:54,964 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:40:54,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 05:40:55,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-13 05:40:55,170 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:40:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:40:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1379792854, now seen corresponding path program 2 times [2022-12-13 05:40:55,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:40:55,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905414142] [2022-12-13 05:40:55,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:40:55,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:40:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:40:55,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:40:55,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:40:55,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905414142] [2022-12-13 05:40:55,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905414142] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:40:55,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981486167] [2022-12-13 05:40:55,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:40:55,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:40:55,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:40:55,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:40:55,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 05:40:55,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:40:55,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:40:55,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 05:40:55,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:40:55,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 05:40:55,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:40:55,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:40:55,800 INFO L321 Elim1Store]: treesize reduction 19, result has 42.4 percent of original size [2022-12-13 05:40:55,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 255 treesize of output 248 [2022-12-13 05:40:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:40:56,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:47:02,555 WARN L233 SmtUtils]: Spent 6.04m on a formula simplification. DAG size of input: 18760 DAG size of output: 12815 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2022-12-13 05:51:05,292 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 05:51:05,332 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 05:51:05,356 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 05:51:05,358 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 05:51:05,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 05:51:05,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:51:05,563 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 18 for 25ms.. [2022-12-13 05:51:05,566 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 05:51:05,566 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 05:51:05,566 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1] [2022-12-13 05:51:05,569 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 05:51:05,569 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 05:51:05,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:51:05 BasicIcfg [2022-12-13 05:51:05,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 05:51:05,577 INFO L158 Benchmark]: Toolchain (without parser) took 875858.42ms. Allocated memory was 203.4MB in the beginning and 939.5MB in the end (delta: 736.1MB). Free memory was 178.9MB in the beginning and 723.3MB in the end (delta: -544.3MB). Peak memory consumption was 604.9MB. Max. memory is 8.0GB. [2022-12-13 05:51:05,584 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 181.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 05:51:05,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.67ms. Allocated memory is still 203.4MB. Free memory was 178.9MB in the beginning and 167.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 05:51:05,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.69ms. Allocated memory is still 203.4MB. Free memory was 166.9MB in the beginning and 164.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 05:51:05,589 INFO L158 Benchmark]: Boogie Preprocessor took 30.25ms. Allocated memory is still 203.4MB. Free memory was 164.8MB in the beginning and 163.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 05:51:05,589 INFO L158 Benchmark]: RCFGBuilder took 522.37ms. Allocated memory is still 203.4MB. Free memory was 163.2MB in the beginning and 144.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-13 05:51:05,589 INFO L158 Benchmark]: TraceAbstraction took 875025.11ms. Allocated memory was 203.4MB in the beginning and 939.5MB in the end (delta: 736.1MB). Free memory was 142.7MB in the beginning and 723.3MB in the end (delta: -580.5MB). Peak memory consumption was 569.2MB. Max. memory is 8.0GB. [2022-12-13 05:51:05,590 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.09ms. Allocated memory is still 203.4MB. Free memory is still 181.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.67ms. Allocated memory is still 203.4MB. Free memory was 178.9MB in the beginning and 167.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.69ms. Allocated memory is still 203.4MB. Free memory was 166.9MB in the beginning and 164.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.25ms. Allocated memory is still 203.4MB. Free memory was 164.8MB in the beginning and 163.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 522.37ms. Allocated memory is still 203.4MB. Free memory was 163.2MB in the beginning and 144.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 875025.11ms. Allocated memory was 203.4MB in the beginning and 939.5MB in the end (delta: 736.1MB). Free memory was 142.7MB in the beginning and 723.3MB in the end (delta: -580.5MB). Peak memory consumption was 569.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 195 PlacesBefore, 21 PlacesAfterwards, 209 TransitionsBefore, 17 TransitionsAfterwards, 5492 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 64 TrivialYvCompositions, 110 ConcurrentYvCompositions, 15 ChoiceCompositions, 189 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3350, independent: 3349, independent conditional: 3349, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3350, independent: 3349, independent conditional: 0, independent unconditional: 3349, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3350, independent: 3349, independent conditional: 0, independent unconditional: 3349, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3350, independent: 3349, independent conditional: 0, independent unconditional: 3349, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3038, independent: 3037, independent conditional: 0, independent unconditional: 3037, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3038, independent: 3037, independent conditional: 0, independent unconditional: 3037, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3350, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3038, unknown conditional: 0, unknown unconditional: 3038] , Statistics on independence cache: Total cache size (in pairs): 5958, Positive cache size: 5957, Positive conditional cache size: 0, Positive unconditional cache size: 5957, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 23 PlacesBefore, 22 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 72 PlacesBefore, 71 PlacesAfterwards, 276 TransitionsBefore, 275 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 95 PlacesBefore, 95 PlacesAfterwards, 410 TransitionsBefore, 410 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 18 for 25ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 18 for 25ms.. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 18 for 25ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 310 locations, 3 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: 874.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 51.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 517 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 517 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 194 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2014 IncrementalHoareTripleChecker+Invalid, 2223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 194 mSolverCounterUnsat, 35 mSDtfsCounter, 2014 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 44.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8411occurred in iteration=9, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 202.7s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 172 ConstructedInterpolants, 6 QuantifiedInterpolants, 4356 SizeOfPredicates, 70 NumberOfNonLiveVariables, 318 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 0/6 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 could not prove your program: Timeout Completed graceful shutdown