/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/array-eq-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:59:24,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:59:24,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:59:24,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:59:24,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:59:24,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:59:24,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:59:24,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:59:24,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:59:24,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:59:24,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:59:24,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:59:24,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:59:24,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:59:24,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:59:24,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:59:24,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:59:24,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:59:24,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:59:24,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:59:24,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:59:24,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:59:24,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:59:24,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:59:24,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:59:24,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:59:24,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:59:24,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:59:24,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:59:24,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:59:24,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:59:24,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:59:24,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:59:24,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:59:24,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:59:24,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:59:24,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:59:24,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:59:24,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:59:24,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:59:24,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:59:24,088 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:59:24,109 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:59:24,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:59:24,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:59:24,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:59:24,111 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:59:24,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:59:24,112 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:59:24,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:59:24,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:59:24,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:59:24,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:59:24,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:59:24,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:59:24,113 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:59:24,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:59:24,113 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:59:24,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:59:24,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:59:24,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:59:24,114 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:59:24,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:59:24,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:59:24,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:59:24,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:59:24,114 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:59:24,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:59:24,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:59:24,115 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:59:24,115 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 [2022-12-06 04:59:24,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:59:24,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:59:24,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:59:24,552 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:59:24,554 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:59:24,555 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/array-eq-trans.wvr.c [2022-12-06 04:59:25,532 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:59:25,735 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:59:25,735 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/array-eq-trans.wvr.c [2022-12-06 04:59:25,740 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64c1a4eda/69e9f040f562479c9898d1f272f9b583/FLAG669381901 [2022-12-06 04:59:26,111 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64c1a4eda/69e9f040f562479c9898d1f272f9b583 [2022-12-06 04:59:26,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:59:26,114 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:59:26,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:59:26,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:59:26,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:59:26,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5456ab1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26, skipping insertion in model container [2022-12-06 04:59:26,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:59:26,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:59:26,273 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/array-eq-trans.wvr.c[2737,2750] [2022-12-06 04:59:26,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:59:26,300 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:59:26,334 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/array-eq-trans.wvr.c[2737,2750] [2022-12-06 04:59:26,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:59:26,348 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:59:26,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26 WrapperNode [2022-12-06 04:59:26,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:59:26,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:59:26,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:59:26,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:59:26,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,397 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 204 [2022-12-06 04:59:26,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:59:26,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:59:26,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:59:26,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:59:26,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,434 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:59:26,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:59:26,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:59:26,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:59:26,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:59:26,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:26,463 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-06 04:59:26,512 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-06 04:59:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:59:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 04:59:26,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 04:59:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 04:59:26,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 04:59:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 04:59:26,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 04:59:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:59:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:59:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:59:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 04:59:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:59:26,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:59:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:59:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:59:26,531 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:59:26,636 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:59:26,637 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:59:26,953 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:59:26,960 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:59:26,960 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 04:59:26,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:59:26 BoogieIcfgContainer [2022-12-06 04:59:26,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:59:26,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:59:26,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:59:26,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:59:26,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:59:26" (1/3) ... [2022-12-06 04:59:26,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6e3f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:59:26, skipping insertion in model container [2022-12-06 04:59:26,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (2/3) ... [2022-12-06 04:59:26,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6e3f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:59:26, skipping insertion in model container [2022-12-06 04:59:26,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:59:26" (3/3) ... [2022-12-06 04:59:26,967 INFO L112 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2022-12-06 04:59:26,979 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:59:26,979 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:59:26,980 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:59:27,043 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 04:59:27,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 281 transitions, 586 flow [2022-12-06 04:59:27,219 INFO L130 PetriNetUnfolder]: 30/278 cut-off events. [2022-12-06 04:59:27,220 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:59:27,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 278 events. 30/278 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 238 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 183. Up to 3 conditions per place. [2022-12-06 04:59:27,225 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 281 transitions, 586 flow [2022-12-06 04:59:27,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 248 places, 268 transitions, 554 flow [2022-12-06 04:59:27,236 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:27,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 268 transitions, 554 flow [2022-12-06 04:59:27,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 268 transitions, 554 flow [2022-12-06 04:59:27,323 INFO L130 PetriNetUnfolder]: 30/268 cut-off events. [2022-12-06 04:59:27,324 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:59:27,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 268 events. 30/268 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 235 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 183. Up to 3 conditions per place. [2022-12-06 04:59:27,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 268 transitions, 554 flow [2022-12-06 04:59:27,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 2688 [2022-12-06 04:59:36,801 INFO L203 LiptonReduction]: Total number of compositions: 235 [2022-12-06 04:59:36,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:59:36,816 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;@453cd13a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:59:36,816 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:59:36,820 INFO L130 PetriNetUnfolder]: 8/28 cut-off events. [2022-12-06 04:59:36,820 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:59:36,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:36,821 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:36,821 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:59:36,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:36,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1493623861, now seen corresponding path program 1 times [2022-12-06 04:59:36,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:36,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805153014] [2022-12-06 04:59:36,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:36,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:37,270 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-06 04:59:37,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:37,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805153014] [2022-12-06 04:59:37,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805153014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:37,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:37,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:59:37,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592405953] [2022-12-06 04:59:37,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:37,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:59:37,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:37,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:59:37,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:59:37,296 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:59:37,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 76 flow. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-06 04:59:37,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:37,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:59:37,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:37,426 INFO L130 PetriNetUnfolder]: 385/548 cut-off events. [2022-12-06 04:59:37,426 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-06 04:59:37,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 548 events. 385/548 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1448 event pairs, 186 based on Foata normal form. 1/349 useless extension candidates. Maximal degree in co-relation 484. Up to 289 conditions per place. [2022-12-06 04:59:37,429 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 28 selfloop transitions, 2 changer transitions 25/55 dead transitions. [2022-12-06 04:59:37,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 55 transitions, 256 flow [2022-12-06 04:59:37,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:59:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:59:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 04:59:37,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49137931034482757 [2022-12-06 04:59:37,440 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 76 flow. Second operand 4 states and 57 transitions. [2022-12-06 04:59:37,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 55 transitions, 256 flow [2022-12-06 04:59:37,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 55 transitions, 232 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 04:59:37,444 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 80 flow [2022-12-06 04:59:37,445 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2022-12-06 04:59:37,447 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2022-12-06 04:59:37,448 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:37,448 INFO L89 Accepts]: Start accepts. Operand has 30 places, 30 transitions, 80 flow [2022-12-06 04:59:37,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:37,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:37,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 30 transitions, 80 flow [2022-12-06 04:59:37,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 30 transitions, 80 flow [2022-12-06 04:59:37,456 INFO L130 PetriNetUnfolder]: 8/30 cut-off events. [2022-12-06 04:59:37,456 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:59:37,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 30 events. 8/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2022-12-06 04:59:37,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 30 transitions, 80 flow [2022-12-06 04:59:37,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-06 04:59:38,567 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:38,568 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1120 [2022-12-06 04:59:38,569 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 29 transitions, 76 flow [2022-12-06 04:59:38,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-06 04:59:38,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:38,569 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:38,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:59:38,569 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:59:38,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:38,570 INFO L85 PathProgramCache]: Analyzing trace with hash 145550818, now seen corresponding path program 1 times [2022-12-06 04:59:38,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:38,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552500313] [2022-12-06 04:59:38,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:38,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:38,682 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-06 04:59:38,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:38,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552500313] [2022-12-06 04:59:38,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552500313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:38,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:38,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:59:38,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511642639] [2022-12-06 04:59:38,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:38,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:59:38,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:38,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:59:38,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:59:38,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:59:38,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 29 transitions, 76 flow. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-06 04:59:38,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:38,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:59:38,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:38,810 INFO L130 PetriNetUnfolder]: 470/667 cut-off events. [2022-12-06 04:59:38,810 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 04:59:38,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 667 events. 470/667 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2089 event pairs, 93 based on Foata normal form. 1/477 useless extension candidates. Maximal degree in co-relation 1431. Up to 301 conditions per place. [2022-12-06 04:59:38,814 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 47 selfloop transitions, 2 changer transitions 17/66 dead transitions. [2022-12-06 04:59:38,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 66 transitions, 298 flow [2022-12-06 04:59:38,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:59:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:59:38,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 04:59:38,817 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5775862068965517 [2022-12-06 04:59:38,818 INFO L175 Difference]: Start difference. First operand has 28 places, 29 transitions, 76 flow. Second operand 4 states and 67 transitions. [2022-12-06 04:59:38,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 66 transitions, 298 flow [2022-12-06 04:59:38,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 66 transitions, 280 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 04:59:38,821 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 78 flow [2022-12-06 04:59:38,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2022-12-06 04:59:38,824 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2022-12-06 04:59:38,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:38,824 INFO L89 Accepts]: Start accepts. Operand has 30 places, 30 transitions, 78 flow [2022-12-06 04:59:38,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:38,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:38,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 30 transitions, 78 flow [2022-12-06 04:59:38,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 30 transitions, 78 flow [2022-12-06 04:59:38,830 INFO L130 PetriNetUnfolder]: 8/38 cut-off events. [2022-12-06 04:59:38,830 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:59:38,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 38 events. 8/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 44. Up to 4 conditions per place. [2022-12-06 04:59:38,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 30 transitions, 78 flow [2022-12-06 04:59:38,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 04:59:38,833 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:38,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 04:59:38,834 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 30 transitions, 78 flow [2022-12-06 04:59:38,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-06 04:59:38,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:38,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:38,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:59:38,835 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:59:38,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:38,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2031052794, now seen corresponding path program 1 times [2022-12-06 04:59:38,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:38,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042977624] [2022-12-06 04:59:38,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:38,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:38,931 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-06 04:59:38,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:38,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042977624] [2022-12-06 04:59:38,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042977624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:38,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:38,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:59:38,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474687772] [2022-12-06 04:59:38,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:38,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:59:38,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:38,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:59:38,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:59:38,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:59:38,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 30 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-06 04:59:38,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:38,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:59:38,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:39,087 INFO L130 PetriNetUnfolder]: 451/656 cut-off events. [2022-12-06 04:59:39,087 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-06 04:59:39,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 656 events. 451/656 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1953 event pairs, 119 based on Foata normal form. 40/514 useless extension candidates. Maximal degree in co-relation 1424. Up to 301 conditions per place. [2022-12-06 04:59:39,089 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 46 selfloop transitions, 4 changer transitions 29/79 dead transitions. [2022-12-06 04:59:39,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 79 transitions, 347 flow [2022-12-06 04:59:39,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:59:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:59:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 04:59:39,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46551724137931033 [2022-12-06 04:59:39,091 INFO L175 Difference]: Start difference. First operand has 29 places, 30 transitions, 78 flow. Second operand 6 states and 81 transitions. [2022-12-06 04:59:39,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 79 transitions, 347 flow [2022-12-06 04:59:39,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 79 transitions, 341 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:59:39,092 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 96 flow [2022-12-06 04:59:39,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2022-12-06 04:59:39,093 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2022-12-06 04:59:39,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:39,093 INFO L89 Accepts]: Start accepts. Operand has 35 places, 31 transitions, 96 flow [2022-12-06 04:59:39,094 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:39,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:39,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 31 transitions, 96 flow [2022-12-06 04:59:39,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 31 transitions, 96 flow [2022-12-06 04:59:39,098 INFO L130 PetriNetUnfolder]: 8/39 cut-off events. [2022-12-06 04:59:39,098 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:59:39,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 39 events. 8/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2022-12-06 04:59:39,099 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 31 transitions, 96 flow [2022-12-06 04:59:39,099 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 04:59:39,349 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:39,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 257 [2022-12-06 04:59:39,350 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 92 flow [2022-12-06 04:59:39,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-06 04:59:39,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:39,350 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:39,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:59:39,350 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:59:39,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:39,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1346834690, now seen corresponding path program 1 times [2022-12-06 04:59:39,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:39,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273712161] [2022-12-06 04:59:39,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:39,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:39,484 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-06 04:59:39,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:39,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273712161] [2022-12-06 04:59:39,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273712161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:39,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:39,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:59:39,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703001973] [2022-12-06 04:59:39,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:39,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:59:39,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:39,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:59:39,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:59:39,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:59:39,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 92 flow. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-06 04:59:39,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:39,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:59:39,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:39,646 INFO L130 PetriNetUnfolder]: 828/1186 cut-off events. [2022-12-06 04:59:39,650 INFO L131 PetriNetUnfolder]: For 494/494 co-relation queries the response was YES. [2022-12-06 04:59:39,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 1186 events. 828/1186 cut-off events. For 494/494 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4099 event pairs, 205 based on Foata normal form. 2/887 useless extension candidates. Maximal degree in co-relation 2764. Up to 559 conditions per place. [2022-12-06 04:59:39,655 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 45 selfloop transitions, 4 changer transitions 16/65 dead transitions. [2022-12-06 04:59:39,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 65 transitions, 324 flow [2022-12-06 04:59:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:59:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:59:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-06 04:59:39,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2022-12-06 04:59:39,658 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 92 flow. Second operand 6 states and 63 transitions. [2022-12-06 04:59:39,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 65 transitions, 324 flow [2022-12-06 04:59:39,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 65 transitions, 294 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-06 04:59:39,661 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 92 flow [2022-12-06 04:59:39,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=34, PETRI_TRANSITIONS=31} [2022-12-06 04:59:39,662 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2022-12-06 04:59:39,662 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:39,662 INFO L89 Accepts]: Start accepts. Operand has 34 places, 31 transitions, 92 flow [2022-12-06 04:59:39,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:39,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:39,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 31 transitions, 92 flow [2022-12-06 04:59:39,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 31 transitions, 92 flow [2022-12-06 04:59:39,669 INFO L130 PetriNetUnfolder]: 8/49 cut-off events. [2022-12-06 04:59:39,669 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:59:39,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 49 events. 8/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 59. Up to 5 conditions per place. [2022-12-06 04:59:39,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 31 transitions, 92 flow [2022-12-06 04:59:39,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 04:59:39,673 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:39,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 04:59:39,678 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 92 flow [2022-12-06 04:59:39,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-06 04:59:39,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:39,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:39,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:59:39,679 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:59:39,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:39,679 INFO L85 PathProgramCache]: Analyzing trace with hash 841291468, now seen corresponding path program 1 times [2022-12-06 04:59:39,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:39,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582431851] [2022-12-06 04:59:39,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:39,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:39,795 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-06 04:59:39,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:39,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582431851] [2022-12-06 04:59:39,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582431851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:39,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:39,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:59:39,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605735601] [2022-12-06 04:59:39,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:39,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:59:39,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:39,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:59:39,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:59:39,796 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:59:39,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-06 04:59:39,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:39,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:59:39,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:39,926 INFO L130 PetriNetUnfolder]: 791/1153 cut-off events. [2022-12-06 04:59:39,926 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-06 04:59:39,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 1153 events. 791/1153 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3943 event pairs, 250 based on Foata normal form. 44/1075 useless extension candidates. Maximal degree in co-relation 2672. Up to 559 conditions per place. [2022-12-06 04:59:39,930 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 4 changer transitions 16/66 dead transitions. [2022-12-06 04:59:39,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 66 transitions, 316 flow [2022-12-06 04:59:39,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:59:39,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:59:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 04:59:39,931 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4413793103448276 [2022-12-06 04:59:39,932 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 92 flow. Second operand 5 states and 64 transitions. [2022-12-06 04:59:39,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 66 transitions, 316 flow [2022-12-06 04:59:39,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 66 transitions, 306 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 04:59:39,933 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 102 flow [2022-12-06 04:59:39,933 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2022-12-06 04:59:39,933 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2022-12-06 04:59:39,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:39,934 INFO L89 Accepts]: Start accepts. Operand has 35 places, 32 transitions, 102 flow [2022-12-06 04:59:39,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:39,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:39,934 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 32 transitions, 102 flow [2022-12-06 04:59:39,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 102 flow [2022-12-06 04:59:39,939 INFO L130 PetriNetUnfolder]: 8/50 cut-off events. [2022-12-06 04:59:39,939 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 04:59:39,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 50 events. 8/50 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 94 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2022-12-06 04:59:39,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 32 transitions, 102 flow [2022-12-06 04:59:39,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 04:59:40,238 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:40,239 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 305 [2022-12-06 04:59:40,239 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 98 flow [2022-12-06 04:59:40,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-06 04:59:40,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:40,240 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:40,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:59:40,240 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:59:40,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:40,240 INFO L85 PathProgramCache]: Analyzing trace with hash 69427538, now seen corresponding path program 1 times [2022-12-06 04:59:40,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:40,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187933732] [2022-12-06 04:59:40,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:40,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:41,036 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-06 04:59:41,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:41,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187933732] [2022-12-06 04:59:41,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187933732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:41,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:41,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:59:41,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808656920] [2022-12-06 04:59:41,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:41,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:59:41,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:41,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:59:41,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:59:41,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:59:41,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 98 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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-06 04:59:41,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:41,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:59:41,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:41,245 INFO L130 PetriNetUnfolder]: 832/1189 cut-off events. [2022-12-06 04:59:41,246 INFO L131 PetriNetUnfolder]: For 336/336 co-relation queries the response was YES. [2022-12-06 04:59:41,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 1189 events. 832/1189 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4303 event pairs, 61 based on Foata normal form. 1/1058 useless extension candidates. Maximal degree in co-relation 2845. Up to 1013 conditions per place. [2022-12-06 04:59:41,251 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 49 selfloop transitions, 9 changer transitions 1/59 dead transitions. [2022-12-06 04:59:41,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 293 flow [2022-12-06 04:59:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:59:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:59:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-12-06 04:59:41,253 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 04:59:41,253 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 98 flow. Second operand 6 states and 58 transitions. [2022-12-06 04:59:41,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 59 transitions, 293 flow [2022-12-06 04:59:41,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 59 transitions, 271 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 04:59:41,259 INFO L231 Difference]: Finished difference. Result has 36 places, 37 transitions, 138 flow [2022-12-06 04:59:41,259 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=36, PETRI_TRANSITIONS=37} [2022-12-06 04:59:41,261 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2022-12-06 04:59:41,261 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:41,261 INFO L89 Accepts]: Start accepts. Operand has 36 places, 37 transitions, 138 flow [2022-12-06 04:59:41,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:41,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:41,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 37 transitions, 138 flow [2022-12-06 04:59:41,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 37 transitions, 138 flow [2022-12-06 04:59:41,272 INFO L130 PetriNetUnfolder]: 29/90 cut-off events. [2022-12-06 04:59:41,272 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 04:59:41,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 90 events. 29/90 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 254 event pairs, 1 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 103. Up to 20 conditions per place. [2022-12-06 04:59:41,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 37 transitions, 138 flow [2022-12-06 04:59:41,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 04:59:41,278 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:41,279 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 04:59:41,279 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 37 transitions, 138 flow [2022-12-06 04:59:41,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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-06 04:59:41,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:41,279 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:41,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:59:41,279 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:59:41,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:41,280 INFO L85 PathProgramCache]: Analyzing trace with hash 380157412, now seen corresponding path program 1 times [2022-12-06 04:59:41,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:41,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929254687] [2022-12-06 04:59:41,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:41,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:41,994 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-06 04:59:41,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:41,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929254687] [2022-12-06 04:59:41,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929254687] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:41,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895186842] [2022-12-06 04:59:41,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:41,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:41,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:42,007 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-06 04:59:42,008 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-06 04:59:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:42,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 04:59:42,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:42,378 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-06 04:59:42,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:59:43,553 INFO L321 Elim1Store]: treesize reduction 90, result has 89.4 percent of original size [2022-12-06 04:59:43,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 145 treesize of output 810 Received shutdown request... [2022-12-06 05:13:42,720 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 05:13:42,721 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 05:13:42,726 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-06 05:13:42,726 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:13:42,729 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-06 05:13:42,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:13:42,926 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 23 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 23ms.. [2022-12-06 05:13:42,928 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 05:13:42,928 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 05:13:42,928 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 05:13:42,928 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:13:42,930 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:13:42,930 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:13:42,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:13:42 BasicIcfg [2022-12-06 05:13:42,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:13:42,932 INFO L158 Benchmark]: Toolchain (without parser) took 856818.61ms. Allocated memory was 178.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 153.9MB in the beginning and 1.1GB in the end (delta: -913.6MB). Peak memory consumption was 759.9MB. Max. memory is 8.0GB. [2022-12-06 05:13:42,933 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:13:42,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.17ms. Allocated memory is still 178.3MB. Free memory was 153.9MB in the beginning and 141.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 05:13:42,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.89ms. Allocated memory is still 178.3MB. Free memory was 141.9MB in the beginning and 139.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:13:42,934 INFO L158 Benchmark]: Boogie Preprocessor took 38.85ms. Allocated memory is still 178.3MB. Free memory was 139.8MB in the beginning and 137.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:13:42,935 INFO L158 Benchmark]: RCFGBuilder took 525.29ms. Allocated memory is still 178.3MB. Free memory was 137.7MB in the beginning and 115.1MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-06 05:13:42,935 INFO L158 Benchmark]: TraceAbstraction took 855968.77ms. Allocated memory was 178.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 114.1MB in the beginning and 1.1GB in the end (delta: -953.5MB). Peak memory consumption was 720.1MB. Max. memory is 8.0GB. [2022-12-06 05:13:42,936 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 178.3MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.17ms. Allocated memory is still 178.3MB. Free memory was 153.9MB in the beginning and 141.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.89ms. Allocated memory is still 178.3MB. Free memory was 141.9MB in the beginning and 139.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.85ms. Allocated memory is still 178.3MB. Free memory was 139.8MB in the beginning and 137.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 525.29ms. Allocated memory is still 178.3MB. Free memory was 137.7MB in the beginning and 115.1MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 855968.77ms. Allocated memory was 178.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 114.1MB in the beginning and 1.1GB in the end (delta: -953.5MB). Peak memory consumption was 720.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.5s, 248 PlacesBefore, 31 PlacesAfterwards, 268 TransitionsBefore, 29 TransitionsAfterwards, 2688 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 171 TrivialYvCompositions, 46 ConcurrentYvCompositions, 18 ChoiceCompositions, 235 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1777, independent: 1742, independent conditional: 1742, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1777, independent: 1742, independent conditional: 0, independent unconditional: 1742, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1777, independent: 1742, independent conditional: 0, independent unconditional: 1742, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1777, independent: 1742, independent conditional: 0, independent unconditional: 1742, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1583, independent: 1562, independent conditional: 0, independent unconditional: 1562, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1583, independent: 1562, independent conditional: 0, independent unconditional: 1562, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1777, independent: 180, independent conditional: 0, independent unconditional: 180, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1583, unknown conditional: 0, unknown unconditional: 1583] , Statistics on independence cache: Total cache size (in pairs): 2787, Positive cache size: 2766, Positive conditional cache size: 0, Positive unconditional cache size: 2766, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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.1s, 29 PlacesBefore, 28 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 160, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 160, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 56, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 56, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 56, unknown conditional: 0, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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, 29 PlacesBefore, 29 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 92, independent conditional: 92, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 102, independent: 92, independent conditional: 12, independent unconditional: 80, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 102, independent: 92, independent conditional: 12, independent unconditional: 80, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102, independent: 92, independent conditional: 12, independent unconditional: 80, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, 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: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, independent: 92, independent conditional: 12, independent unconditional: 80, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 33 PlacesBefore, 32 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 172, independent: 152, independent conditional: 152, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 172, independent: 152, independent conditional: 20, independent unconditional: 132, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 174, independent: 152, independent conditional: 20, independent unconditional: 132, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 174, independent: 152, independent conditional: 20, independent unconditional: 132, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 174, independent: 152, independent conditional: 20, independent unconditional: 132, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 8, Negative conditional cache size: 2, Negative unconditional cache size: 6, 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, 33 PlacesBefore, 33 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 126, independent: 114, independent conditional: 29, independent unconditional: 85, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 126, independent: 114, independent conditional: 29, independent unconditional: 85, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 126, independent: 114, independent conditional: 29, independent unconditional: 85, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 126, independent: 114, independent conditional: 29, independent unconditional: 85, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 9, Negative conditional cache size: 3, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 34 PlacesBefore, 33 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 264, independent: 240, independent conditional: 240, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 264, independent: 240, independent conditional: 60, independent unconditional: 180, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 266, independent: 240, independent conditional: 60, independent unconditional: 180, dependent: 26, dependent conditional: 6, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 266, independent: 240, independent conditional: 60, independent unconditional: 180, dependent: 26, dependent conditional: 6, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 266, independent: 240, independent conditional: 60, independent unconditional: 180, dependent: 25, dependent conditional: 5, dependent unconditional: 20, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 10, Negative conditional cache size: 4, Negative unconditional cache size: 6, 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, 36 PlacesBefore, 36 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 35, independent conditional: 15, independent unconditional: 20, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 35, independent conditional: 15, independent unconditional: 20, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 35, independent conditional: 15, independent unconditional: 20, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, independent: 35, independent conditional: 15, independent unconditional: 20, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 13, Negative conditional cache size: 7, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 23 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 23ms.. - TimeoutResultAtElement [Line: 92]: 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 23 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 23ms.. - TimeoutResultAtElement [Line: 93]: 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 23 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 23ms.. - TimeoutResultAtElement [Line: 94]: 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 23 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 23ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 297 locations, 4 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: 855.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 279 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 279 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 666 IncrementalHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 666 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=6, InterpolantAutomatonStates: 31, 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.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 1199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown