/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:42:41,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:42:41,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:42:41,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:42:41,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:42:41,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:42:41,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:42:41,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:42:41,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:42:41,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:42:41,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:42:41,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:42:41,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:42:41,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:42:41,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:42:41,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:42:41,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:42:41,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:42:41,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:42:41,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:42:41,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:42:41,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:42:41,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:42:41,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:42:41,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:42:41,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:42:41,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:42:41,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:42:41,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:42:41,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:42:41,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:42:41,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:42:41,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:42:41,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:42:41,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:42:41,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:42:41,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:42:41,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:42:41,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:42:41,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:42:41,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:42:41,430 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:42:41,453 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:42:41,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:42:41,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:42:41,454 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:42:41,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:42:41,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:42:41,455 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:42:41,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:42:41,455 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:42:41,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:42:41,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:42:41,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:42:41,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:42:41,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:42:41,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:42:41,456 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:42:41,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:42:41,456 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:42:41,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:42:41,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:42:41,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:42:41,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:42:41,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:42:41,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:42:41,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:42:41,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:42:41,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:42:41,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:42:41,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:42:41,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:42:41,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:42:41,458 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:42:41,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:42:41,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:42:41,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:42:41,646 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:42:41,646 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:42:41,647 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2023-01-28 06:42:42,675 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:42:42,896 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:42:42,896 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2023-01-28 06:42:42,903 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25885494/62a583110ac94e3a975c609cbbb360af/FLAG9934c094d [2023-01-28 06:42:42,913 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25885494/62a583110ac94e3a975c609cbbb360af [2023-01-28 06:42:42,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:42:42,916 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:42:42,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:42:42,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:42:42,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:42:42,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:42:42" (1/1) ... [2023-01-28 06:42:42,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@524a7520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:42, skipping insertion in model container [2023-01-28 06:42:42,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:42:42" (1/1) ... [2023-01-28 06:42:42,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:42:42,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:42:43,072 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-01-28 06:42:43,181 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i[31163,31176] [2023-01-28 06:42:43,188 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:42:43,193 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:42:43,210 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-01-28 06:42:43,233 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i[31163,31176] [2023-01-28 06:42:43,234 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:42:43,263 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:42:43,263 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:42:43,263 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:42:43,268 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:42:43,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:43 WrapperNode [2023-01-28 06:42:43,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:42:43,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:42:43,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:42:43,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:42:43,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:43" (1/1) ... [2023-01-28 06:42:43,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:43" (1/1) ... [2023-01-28 06:42:43,298 INFO L138 Inliner]: procedures = 174, calls = 25, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 78 [2023-01-28 06:42:43,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:42:43,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:42:43,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:42:43,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:42:43,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:43" (1/1) ... [2023-01-28 06:42:43,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:43" (1/1) ... [2023-01-28 06:42:43,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:43" (1/1) ... [2023-01-28 06:42:43,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:43" (1/1) ... [2023-01-28 06:42:43,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:43" (1/1) ... [2023-01-28 06:42:43,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:43" (1/1) ... [2023-01-28 06:42:43,312 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:43" (1/1) ... [2023-01-28 06:42:43,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:43" (1/1) ... [2023-01-28 06:42:43,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:42:43,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:42:43,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:42:43,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:42:43,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:43" (1/1) ... [2023-01-28 06:42:43,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:42:43,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:42:43,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 06:42:43,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 06:42:43,370 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-01-28 06:42:43,370 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-01-28 06:42:43,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:42:43,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:42:43,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:42:43,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:42:43,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:42:43,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:42:43,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:42:43,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:42:43,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:42:43,373 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:42:43,502 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:42:43,503 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:42:43,656 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:42:43,709 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:42:43,709 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-01-28 06:42:43,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:42:43 BoogieIcfgContainer [2023-01-28 06:42:43,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:42:43,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:42:43,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:42:43,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:42:43,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:42:42" (1/3) ... [2023-01-28 06:42:43,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634f5b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:42:43, skipping insertion in model container [2023-01-28 06:42:43,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:43" (2/3) ... [2023-01-28 06:42:43,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634f5b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:42:43, skipping insertion in model container [2023-01-28 06:42:43,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:42:43" (3/3) ... [2023-01-28 06:42:43,716 INFO L112 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2023-01-28 06:42:43,727 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:42:43,728 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 06:42:43,728 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:42:43,761 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:42:43,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 103 flow [2023-01-28 06:42:43,820 INFO L130 PetriNetUnfolder]: 4/59 cut-off events. [2023-01-28 06:42:43,820 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:42:43,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 59 events. 4/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2023-01-28 06:42:43,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 49 transitions, 103 flow [2023-01-28 06:42:43,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 49 transitions, 103 flow [2023-01-28 06:42:43,834 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:42:43,839 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 49 transitions, 103 flow [2023-01-28 06:42:43,841 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 49 transitions, 103 flow [2023-01-28 06:42:43,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 103 flow [2023-01-28 06:42:43,864 INFO L130 PetriNetUnfolder]: 4/59 cut-off events. [2023-01-28 06:42:43,864 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:42:43,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 59 events. 4/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2023-01-28 06:42:43,865 INFO L119 LiptonReduction]: Number of co-enabled transitions 572 [2023-01-28 06:42:45,741 INFO L134 LiptonReduction]: Checked pairs total: 520 [2023-01-28 06:42:45,741 INFO L136 LiptonReduction]: Total number of compositions: 50 [2023-01-28 06:42:45,751 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:42:45,764 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@489a09fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:42:45,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-01-28 06:42:45,770 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2023-01-28 06:42:45,770 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:42:45,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:45,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-01-28 06:42:45,771 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:45,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:45,777 INFO L85 PathProgramCache]: Analyzing trace with hash 9504075, now seen corresponding path program 1 times [2023-01-28 06:42:45,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:45,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090345880] [2023-01-28 06:42:45,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:45,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:42:46,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:46,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090345880] [2023-01-28 06:42:46,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090345880] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:42:46,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:42:46,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:42:46,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015887444] [2023-01-28 06:42:46,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:42:46,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:42:46,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:46,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:42:46,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:42:46,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 99 [2023-01-28 06:42:46,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 11 places, 8 transitions, 21 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:46,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:46,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 99 [2023-01-28 06:42:46,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:46,128 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2023-01-28 06:42:46,128 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:42:46,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17 conditions, 6 events. 0/6 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 3/9 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2023-01-28 06:42:46,129 INFO L137 encePairwiseOnDemand]: 95/99 looper letters, 0 selfloop transitions, 0 changer transitions 5/5 dead transitions. [2023-01-28 06:42:46,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 10 places, 5 transitions, 23 flow [2023-01-28 06:42:46,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:42:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:42:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2023-01-28 06:42:46,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3164983164983165 [2023-01-28 06:42:46,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 94 transitions. [2023-01-28 06:42:46,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 94 transitions. [2023-01-28 06:42:46,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:46,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 94 transitions. [2023-01-28 06:42:46,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:46,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:46,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:46,149 INFO L175 Difference]: Start difference. First operand has 11 places, 8 transitions, 21 flow. Second operand 3 states and 94 transitions. [2023-01-28 06:42:46,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 10 places, 5 transitions, 23 flow [2023-01-28 06:42:46,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 10 places, 5 transitions, 23 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:42:46,153 INFO L231 Difference]: Finished difference. Result has 10 places, 0 transitions, 0 flow [2023-01-28 06:42:46,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=15, PETRI_DIFFERENCE_MINUEND_PLACES=8, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=10, PETRI_TRANSITIONS=0} [2023-01-28 06:42:46,156 INFO L281 CegarLoopForPetriNet]: 11 programPoint places, -1 predicate places. [2023-01-28 06:42:46,156 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 0 transitions, 0 flow [2023-01-28 06:42:46,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:46,158 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-01-28 06:42:46,159 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-01-28 06:42:46,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:42:46,159 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-01-28 06:42:46,164 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE (1/2) [2023-01-28 06:42:46,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 103 flow [2023-01-28 06:42:46,183 INFO L130 PetriNetUnfolder]: 4/59 cut-off events. [2023-01-28 06:42:46,183 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:42:46,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 59 events. 4/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2023-01-28 06:42:46,184 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 49 transitions, 103 flow [2023-01-28 06:42:46,185 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 49 transitions, 103 flow [2023-01-28 06:42:46,185 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:42:46,185 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 49 transitions, 103 flow [2023-01-28 06:42:46,185 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 49 transitions, 103 flow [2023-01-28 06:42:46,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 103 flow [2023-01-28 06:42:46,195 INFO L130 PetriNetUnfolder]: 4/59 cut-off events. [2023-01-28 06:42:46,196 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:42:46,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 59 events. 4/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2023-01-28 06:42:46,202 INFO L119 LiptonReduction]: Number of co-enabled transitions 572 [2023-01-28 06:42:47,505 INFO L134 LiptonReduction]: Checked pairs total: 522 [2023-01-28 06:42:47,505 INFO L136 LiptonReduction]: Total number of compositions: 50 [2023-01-28 06:42:47,507 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-01-28 06:42:47,507 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@489a09fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:42:47,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-28 06:42:47,509 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2023-01-28 06:42:47,509 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:42:47,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:47,509 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-01-28 06:42:47,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 06:42:47,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:47,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1991582203, now seen corresponding path program 1 times [2023-01-28 06:42:47,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:47,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340718096] [2023-01-28 06:42:47,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:47,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:42:47,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:42:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:42:47,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:42:47,555 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:42:47,555 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-28 06:42:47,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:42:47,555 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-01-28 06:42:47,556 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-01-28 06:42:47,556 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-28 06:42:47,556 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-01-28 06:42:47,577 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:42:47,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 72 transitions, 156 flow [2023-01-28 06:42:47,600 INFO L130 PetriNetUnfolder]: 7/94 cut-off events. [2023-01-28 06:42:47,600 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:42:47,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 7/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2023-01-28 06:42:47,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 72 transitions, 156 flow [2023-01-28 06:42:47,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 72 transitions, 156 flow [2023-01-28 06:42:47,602 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:42:47,602 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 72 transitions, 156 flow [2023-01-28 06:42:47,602 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 72 transitions, 156 flow [2023-01-28 06:42:47,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 72 transitions, 156 flow [2023-01-28 06:42:47,622 INFO L130 PetriNetUnfolder]: 7/94 cut-off events. [2023-01-28 06:42:47,622 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:42:47,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 7/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2023-01-28 06:42:47,625 INFO L119 LiptonReduction]: Number of co-enabled transitions 2156 [2023-01-28 06:42:48,176 INFO L134 LiptonReduction]: Checked pairs total: 8141 [2023-01-28 06:42:48,177 INFO L136 LiptonReduction]: Total number of compositions: 47 [2023-01-28 06:42:48,178 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:42:48,179 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@489a09fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:42:48,179 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-28 06:42:48,181 INFO L130 PetriNetUnfolder]: 1/31 cut-off events. [2023-01-28 06:42:48,181 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:42:48,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:48,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:48,181 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:48,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:48,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1878992399, now seen corresponding path program 1 times [2023-01-28 06:42:48,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:48,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622530396] [2023-01-28 06:42:48,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:48,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:42:48,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:48,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622530396] [2023-01-28 06:42:48,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622530396] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:42:48,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:42:48,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:42:48,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504618005] [2023-01-28 06:42:48,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:42:48,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:42:48,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:48,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:42:48,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:42:48,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 119 [2023-01-28 06:42:48,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:48,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:48,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 119 [2023-01-28 06:42:48,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:48,493 INFO L130 PetriNetUnfolder]: 689/1293 cut-off events. [2023-01-28 06:42:48,493 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-01-28 06:42:48,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2532 conditions, 1293 events. 689/1293 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8294 event pairs, 99 based on Foata normal form. 0/1226 useless extension candidates. Maximal degree in co-relation 2262. Up to 457 conditions per place. [2023-01-28 06:42:48,500 INFO L137 encePairwiseOnDemand]: 107/119 looper letters, 77 selfloop transitions, 18 changer transitions 0/102 dead transitions. [2023-01-28 06:42:48,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 102 transitions, 421 flow [2023-01-28 06:42:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:42:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:42:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 389 transitions. [2023-01-28 06:42:48,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4669867947178872 [2023-01-28 06:42:48,505 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 389 transitions. [2023-01-28 06:42:48,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 389 transitions. [2023-01-28 06:42:48,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:48,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 389 transitions. [2023-01-28 06:42:48,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 55.57142857142857) internal successors, (389), 7 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:48,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:48,511 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:48,511 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 84 flow. Second operand 7 states and 389 transitions. [2023-01-28 06:42:48,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 102 transitions, 421 flow [2023-01-28 06:42:48,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 102 transitions, 419 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-01-28 06:42:48,514 INFO L231 Difference]: Finished difference. Result has 48 places, 50 transitions, 208 flow [2023-01-28 06:42:48,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=48, PETRI_TRANSITIONS=50} [2023-01-28 06:42:48,515 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-01-28 06:42:48,515 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 208 flow [2023-01-28 06:42:48,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:48,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:48,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:48,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:42:48,515 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:48,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:48,516 INFO L85 PathProgramCache]: Analyzing trace with hash -908360492, now seen corresponding path program 1 times [2023-01-28 06:42:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:48,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579985884] [2023-01-28 06:42:48,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:48,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:42:48,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:48,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579985884] [2023-01-28 06:42:48,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579985884] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:42:48,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:42:48,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:42:48,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72927140] [2023-01-28 06:42:48,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:42:48,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:42:48,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:48,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:42:48,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:42:48,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 119 [2023-01-28 06:42:48,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:48,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:48,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 119 [2023-01-28 06:42:48,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:48,852 INFO L130 PetriNetUnfolder]: 416/837 cut-off events. [2023-01-28 06:42:48,853 INFO L131 PetriNetUnfolder]: For 432/460 co-relation queries the response was YES. [2023-01-28 06:42:48,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1986 conditions, 837 events. 416/837 cut-off events. For 432/460 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5036 event pairs, 177 based on Foata normal form. 59/858 useless extension candidates. Maximal degree in co-relation 1528. Up to 395 conditions per place. [2023-01-28 06:42:48,856 INFO L137 encePairwiseOnDemand]: 112/119 looper letters, 41 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2023-01-28 06:42:48,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 362 flow [2023-01-28 06:42:48,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:42:48,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:42:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2023-01-28 06:42:48,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070028011204482 [2023-01-28 06:42:48,872 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 181 transitions. [2023-01-28 06:42:48,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 181 transitions. [2023-01-28 06:42:48,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:48,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 181 transitions. [2023-01-28 06:42:48,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:48,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:48,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:48,874 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 208 flow. Second operand 3 states and 181 transitions. [2023-01-28 06:42:48,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 362 flow [2023-01-28 06:42:48,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 67 transitions, 362 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:42:48,878 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 235 flow [2023-01-28 06:42:48,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2023-01-28 06:42:48,878 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2023-01-28 06:42:48,878 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 235 flow [2023-01-28 06:42:48,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:48,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:48,879 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:48,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:42:48,879 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:48,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1481656299, now seen corresponding path program 1 times [2023-01-28 06:42:48,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:48,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182373418] [2023-01-28 06:42:48,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:48,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:42:48,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:48,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182373418] [2023-01-28 06:42:48,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182373418] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:42:48,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:42:48,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:42:48,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189193295] [2023-01-28 06:42:48,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:42:48,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:42:48,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:48,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:42:48,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:42:48,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 119 [2023-01-28 06:42:48,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:48,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:48,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 119 [2023-01-28 06:42:48,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:49,053 INFO L130 PetriNetUnfolder]: 348/673 cut-off events. [2023-01-28 06:42:49,053 INFO L131 PetriNetUnfolder]: For 420/426 co-relation queries the response was YES. [2023-01-28 06:42:49,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1767 conditions, 673 events. 348/673 cut-off events. For 420/426 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3688 event pairs, 105 based on Foata normal form. 14/672 useless extension candidates. Maximal degree in co-relation 1254. Up to 291 conditions per place. [2023-01-28 06:42:49,057 INFO L137 encePairwiseOnDemand]: 110/119 looper letters, 59 selfloop transitions, 14 changer transitions 12/94 dead transitions. [2023-01-28 06:42:49,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 94 transitions, 542 flow [2023-01-28 06:42:49,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:42:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:42:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 350 transitions. [2023-01-28 06:42:49,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42016806722689076 [2023-01-28 06:42:49,058 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 350 transitions. [2023-01-28 06:42:49,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 350 transitions. [2023-01-28 06:42:49,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:49,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 350 transitions. [2023-01-28 06:42:49,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:49,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:49,060 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:49,060 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 235 flow. Second operand 7 states and 350 transitions. [2023-01-28 06:42:49,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 94 transitions, 542 flow [2023-01-28 06:42:49,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 537 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:42:49,064 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 290 flow [2023-01-28 06:42:49,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=290, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2023-01-28 06:42:49,065 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2023-01-28 06:42:49,065 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 290 flow [2023-01-28 06:42:49,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:49,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:49,066 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:49,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:42:49,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:49,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:49,066 INFO L85 PathProgramCache]: Analyzing trace with hash -25820515, now seen corresponding path program 1 times [2023-01-28 06:42:49,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:49,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794779231] [2023-01-28 06:42:49,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:49,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:42:49,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:49,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794779231] [2023-01-28 06:42:49,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794779231] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:42:49,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447790990] [2023-01-28 06:42:49,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:49,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:42:49,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:42:49,177 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) [2023-01-28 06:42:49,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 06:42:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:49,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-28 06:42:49,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:42:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:42:49,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 06:42:49,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447790990] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:42:49,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 06:42:49,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2023-01-28 06:42:49,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125007161] [2023-01-28 06:42:49,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:42:49,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:42:49,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:49,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:42:49,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:42:49,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119 [2023-01-28 06:42:49,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:49,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:49,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119 [2023-01-28 06:42:49,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:49,291 INFO L130 PetriNetUnfolder]: 59/173 cut-off events. [2023-01-28 06:42:49,291 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2023-01-28 06:42:49,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 173 events. 59/173 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 673 event pairs, 21 based on Foata normal form. 12/182 useless extension candidates. Maximal degree in co-relation 344. Up to 74 conditions per place. [2023-01-28 06:42:49,292 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 18 selfloop transitions, 8 changer transitions 2/45 dead transitions. [2023-01-28 06:42:49,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 266 flow [2023-01-28 06:42:49,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:42:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:42:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2023-01-28 06:42:49,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126050420168067 [2023-01-28 06:42:49,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 183 transitions. [2023-01-28 06:42:49,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 183 transitions. [2023-01-28 06:42:49,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:49,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 183 transitions. [2023-01-28 06:42:49,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:49,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:49,295 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:49,295 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 290 flow. Second operand 3 states and 183 transitions. [2023-01-28 06:42:49,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 45 transitions, 266 flow [2023-01-28 06:42:49,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 232 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-01-28 06:42:49,296 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 163 flow [2023-01-28 06:42:49,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2023-01-28 06:42:49,297 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2023-01-28 06:42:49,297 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 163 flow [2023-01-28 06:42:49,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:49,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:49,297 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:49,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-28 06:42:49,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-01-28 06:42:49,502 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:49,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:49,503 INFO L85 PathProgramCache]: Analyzing trace with hash 361947616, now seen corresponding path program 1 times [2023-01-28 06:42:49,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:49,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223361625] [2023-01-28 06:42:49,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:49,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:42:49,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:49,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223361625] [2023-01-28 06:42:49,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223361625] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:42:49,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144388393] [2023-01-28 06:42:49,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:49,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:42:49,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:42:49,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:42:49,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 06:42:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:49,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 06:42:49,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:42:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:42:49,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:42:49,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:42:49,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144388393] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:42:49,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:42:49,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-28 06:42:49,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384939820] [2023-01-28 06:42:49,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:42:49,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 06:42:49,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:49,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 06:42:49,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-01-28 06:42:49,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 119 [2023-01-28 06:42:49,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 163 flow. Second operand has 13 states, 13 states have (on average 39.38461538461539) internal successors, (512), 13 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:49,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:49,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 119 [2023-01-28 06:42:49,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:50,027 INFO L130 PetriNetUnfolder]: 52/140 cut-off events. [2023-01-28 06:42:50,027 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2023-01-28 06:42:50,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 140 events. 52/140 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 502 event pairs, 22 based on Foata normal form. 2/140 useless extension candidates. Maximal degree in co-relation 228. Up to 64 conditions per place. [2023-01-28 06:42:50,028 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 19 selfloop transitions, 7 changer transitions 16/47 dead transitions. [2023-01-28 06:42:50,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 274 flow [2023-01-28 06:42:50,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 06:42:50,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 06:42:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 487 transitions. [2023-01-28 06:42:50,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34103641456582634 [2023-01-28 06:42:50,029 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 487 transitions. [2023-01-28 06:42:50,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 487 transitions. [2023-01-28 06:42:50,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:50,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 487 transitions. [2023-01-28 06:42:50,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 40.583333333333336) internal successors, (487), 12 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:50,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 119.0) internal successors, (1547), 13 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:50,032 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 119.0) internal successors, (1547), 13 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:50,032 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 163 flow. Second operand 12 states and 487 transitions. [2023-01-28 06:42:50,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 274 flow [2023-01-28 06:42:50,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 252 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-01-28 06:42:50,034 INFO L231 Difference]: Finished difference. Result has 55 places, 25 transitions, 105 flow [2023-01-28 06:42:50,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=105, PETRI_PLACES=55, PETRI_TRANSITIONS=25} [2023-01-28 06:42:50,034 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2023-01-28 06:42:50,034 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 25 transitions, 105 flow [2023-01-28 06:42:50,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 39.38461538461539) internal successors, (512), 13 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:50,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:50,035 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:50,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 06:42:50,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-01-28 06:42:50,240 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:50,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:50,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1052392163, now seen corresponding path program 1 times [2023-01-28 06:42:50,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:50,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299978640] [2023-01-28 06:42:50,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:50,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:42:50,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:50,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299978640] [2023-01-28 06:42:50,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299978640] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:42:50,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:42:50,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:42:50,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335236443] [2023-01-28 06:42:50,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:42:50,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:42:50,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:50,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:42:50,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:42:50,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 119 [2023-01-28 06:42:50,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 25 transitions, 105 flow. Second operand has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:50,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:50,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 119 [2023-01-28 06:42:50,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:50,371 INFO L130 PetriNetUnfolder]: 11/45 cut-off events. [2023-01-28 06:42:50,371 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-01-28 06:42:50,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 45 events. 11/45 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 4 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 115. Up to 16 conditions per place. [2023-01-28 06:42:50,371 INFO L137 encePairwiseOnDemand]: 112/119 looper letters, 0 selfloop transitions, 0 changer transitions 21/21 dead transitions. [2023-01-28 06:42:50,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 21 transitions, 117 flow [2023-01-28 06:42:50,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:42:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:42:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 315 transitions. [2023-01-28 06:42:50,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33088235294117646 [2023-01-28 06:42:50,372 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 315 transitions. [2023-01-28 06:42:50,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 315 transitions. [2023-01-28 06:42:50,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:50,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 315 transitions. [2023-01-28 06:42:50,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 39.375) internal successors, (315), 8 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:50,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:50,374 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:50,375 INFO L175 Difference]: Start difference. First operand has 55 places, 25 transitions, 105 flow. Second operand 8 states and 315 transitions. [2023-01-28 06:42:50,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 21 transitions, 117 flow [2023-01-28 06:42:50,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 21 transitions, 96 flow, removed 0 selfloop flow, removed 11 redundant places. [2023-01-28 06:42:50,375 INFO L231 Difference]: Finished difference. Result has 30 places, 0 transitions, 0 flow [2023-01-28 06:42:50,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=30, PETRI_TRANSITIONS=0} [2023-01-28 06:42:50,376 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -9 predicate places. [2023-01-28 06:42:50,376 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 0 transitions, 0 flow [2023-01-28 06:42:50,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:50,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-01-28 06:42:50,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-01-28 06:42:50,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-01-28 06:42:50,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:42:50,376 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-01-28 06:42:50,377 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-01-28 06:42:50,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 72 transitions, 156 flow [2023-01-28 06:42:50,382 INFO L130 PetriNetUnfolder]: 7/94 cut-off events. [2023-01-28 06:42:50,382 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:42:50,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 7/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2023-01-28 06:42:50,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 72 transitions, 156 flow [2023-01-28 06:42:50,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 72 transitions, 156 flow [2023-01-28 06:42:50,383 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:42:50,383 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 72 transitions, 156 flow [2023-01-28 06:42:50,383 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 72 transitions, 156 flow [2023-01-28 06:42:50,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 72 transitions, 156 flow [2023-01-28 06:42:50,387 INFO L130 PetriNetUnfolder]: 7/94 cut-off events. [2023-01-28 06:42:50,388 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:42:50,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 7/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2023-01-28 06:42:50,389 INFO L119 LiptonReduction]: Number of co-enabled transitions 2156 [2023-01-28 06:42:51,166 INFO L134 LiptonReduction]: Checked pairs total: 8141 [2023-01-28 06:42:51,166 INFO L136 LiptonReduction]: Total number of compositions: 47 [2023-01-28 06:42:51,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-01-28 06:42:51,167 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@489a09fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:42:51,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-28 06:42:51,169 INFO L130 PetriNetUnfolder]: 1/28 cut-off events. [2023-01-28 06:42:51,169 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:42:51,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:51,169 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-01-28 06:42:51,169 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 06:42:51,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash -287549659, now seen corresponding path program 1 times [2023-01-28 06:42:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:51,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653656838] [2023-01-28 06:42:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:51,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:42:51,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:42:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:42:51,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:42:51,201 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:42:51,201 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-28 06:42:51,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:42:51,201 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-01-28 06:42:51,202 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-01-28 06:42:51,202 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-28 06:42:51,202 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-01-28 06:42:51,213 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:42:51,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 95 transitions, 211 flow [2023-01-28 06:42:51,221 INFO L130 PetriNetUnfolder]: 10/129 cut-off events. [2023-01-28 06:42:51,221 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-01-28 06:42:51,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 129 events. 10/129 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 287 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 98. Up to 8 conditions per place. [2023-01-28 06:42:51,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 95 transitions, 211 flow [2023-01-28 06:42:51,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 95 transitions, 211 flow [2023-01-28 06:42:51,222 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:42:51,222 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 95 transitions, 211 flow [2023-01-28 06:42:51,222 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 95 transitions, 211 flow [2023-01-28 06:42:51,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 95 transitions, 211 flow [2023-01-28 06:42:51,229 INFO L130 PetriNetUnfolder]: 10/129 cut-off events. [2023-01-28 06:42:51,230 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-01-28 06:42:51,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 129 events. 10/129 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 287 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 98. Up to 8 conditions per place. [2023-01-28 06:42:51,232 INFO L119 LiptonReduction]: Number of co-enabled transitions 4752 [2023-01-28 06:42:52,070 INFO L134 LiptonReduction]: Checked pairs total: 20874 [2023-01-28 06:42:52,071 INFO L136 LiptonReduction]: Total number of compositions: 59 [2023-01-28 06:42:52,072 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:42:52,072 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@489a09fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:42:52,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 06:42:52,074 INFO L130 PetriNetUnfolder]: 1/28 cut-off events. [2023-01-28 06:42:52,074 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 06:42:52,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:52,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:52,074 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:52,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash -799850224, now seen corresponding path program 1 times [2023-01-28 06:42:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:52,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424008530] [2023-01-28 06:42:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:42:52,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:52,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424008530] [2023-01-28 06:42:52,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424008530] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:42:52,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:42:52,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:42:52,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510004861] [2023-01-28 06:42:52,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:42:52,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:42:52,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:52,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:42:52,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:42:52,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 154 [2023-01-28 06:42:52,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:52,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:52,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 154 [2023-01-28 06:42:52,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:53,598 INFO L130 PetriNetUnfolder]: 15991/24374 cut-off events. [2023-01-28 06:42:53,598 INFO L131 PetriNetUnfolder]: For 1543/1543 co-relation queries the response was YES. [2023-01-28 06:42:53,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48417 conditions, 24374 events. 15991/24374 cut-off events. For 1543/1543 co-relation queries the response was YES. Maximal size of possible extension queue 1408. Compared 185289 event pairs, 2849 based on Foata normal form. 0/23213 useless extension candidates. Maximal degree in co-relation 26312. Up to 9503 conditions per place. [2023-01-28 06:42:53,720 INFO L137 encePairwiseOnDemand]: 138/154 looper letters, 148 selfloop transitions, 26 changer transitions 0/183 dead transitions. [2023-01-28 06:42:53,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 183 transitions, 785 flow [2023-01-28 06:42:53,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:42:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:42:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 542 transitions. [2023-01-28 06:42:53,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027829313543599 [2023-01-28 06:42:53,722 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 542 transitions. [2023-01-28 06:42:53,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 542 transitions. [2023-01-28 06:42:53,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:53,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 542 transitions. [2023-01-28 06:42:53,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.42857142857143) internal successors, (542), 7 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:53,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:53,725 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:53,725 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 123 flow. Second operand 7 states and 542 transitions. [2023-01-28 06:42:53,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 183 transitions, 785 flow [2023-01-28 06:42:53,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 183 transitions, 769 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-01-28 06:42:53,728 INFO L231 Difference]: Finished difference. Result has 63 places, 77 transitions, 323 flow [2023-01-28 06:42:53,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=323, PETRI_PLACES=63, PETRI_TRANSITIONS=77} [2023-01-28 06:42:53,730 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2023-01-28 06:42:53,730 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 77 transitions, 323 flow [2023-01-28 06:42:53,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:53,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:53,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:53,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:42:53,731 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:53,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:53,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1060129555, now seen corresponding path program 1 times [2023-01-28 06:42:53,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:53,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706796007] [2023-01-28 06:42:53,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:53,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:42:53,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:53,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706796007] [2023-01-28 06:42:53,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706796007] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:42:53,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:42:53,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:42:53,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40604272] [2023-01-28 06:42:53,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:42:53,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:42:53,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:53,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:42:53,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:42:53,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 154 [2023-01-28 06:42:53,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 77 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:53,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:53,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 154 [2023-01-28 06:42:53,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:54,674 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 12#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:54,675 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,675 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,675 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,675 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,681 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 12#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:54,681 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,681 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,681 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,681 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,708 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([660] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 88#L721true, 66#L725true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:54,709 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,709 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,709 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,709 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,709 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([661] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 72#L724true, 14#L733-5true, 66#L725true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:54,709 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,709 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,709 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,709 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 06:42:54,807 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:54,808 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,808 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,808 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,808 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,815 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:54,815 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,816 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,816 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,816 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,930 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([660] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 88#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 78#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:54,930 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,930 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,930 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,930 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,930 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([661] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 72#L724true, 14#L733-5true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 78#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:54,930 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,930 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,930 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,930 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,946 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:54,946 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,947 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,947 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,947 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,947 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,947 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:54,947 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,947 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,947 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,947 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,947 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 06:42:54,995 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 34#L733-4true, 17#L724-5true, 12#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:54,995 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-01-28 06:42:54,995 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:54,995 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:54,995 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:54,995 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 34#L733-4true, 12#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:54,995 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-01-28 06:42:54,995 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:54,995 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:54,995 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,034 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 39#L725true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,034 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-01-28 06:42:55,034 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 06:42:55,034 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 06:42:55,034 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 06:42:55,034 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 39#L725true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,034 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-01-28 06:42:55,034 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 06:42:55,034 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 06:42:55,034 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 06:42:55,077 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([660] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 88#L721true, 66#L725true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 34#L733-4true, 17#L724-5true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,077 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,077 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,077 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,077 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,077 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([661] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 72#L724true, 66#L725true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 34#L733-4true, 17#L724-5true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,077 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,077 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,077 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,077 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,089 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 34#L733-4true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,089 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,089 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,089 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,090 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,090 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 34#L733-4true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,090 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,090 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,090 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,090 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,128 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,128 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,128 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,128 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,128 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,129 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,129 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,129 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,129 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,129 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:42:55,244 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([660] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 88#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 34#L733-4true, 78#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,244 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,244 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,244 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,244 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,244 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([661] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 72#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 34#L733-4true, 78#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,244 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,244 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,244 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,244 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,250 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 34#L733-4true, 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,250 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,251 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,251 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,251 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,251 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,251 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 34#L733-4true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,251 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,251 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,251 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,251 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,251 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:42:55,311 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 34#L733-4true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 39#L725true, 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,311 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-01-28 06:42:55,311 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:42:55,311 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:42:55,311 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:42:55,312 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 34#L733-4true, 39#L725true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,312 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-01-28 06:42:55,312 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:42:55,312 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:42:55,312 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:42:55,350 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 80#L721true, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 34#L733-4true, 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,350 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 06:42:55,350 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:42:55,350 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:42:55,350 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:42:55,350 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 34#L733-4true, 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-01-28 06:42:55,351 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 06:42:55,351 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:42:55,351 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:42:55,351 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:42:55,387 INFO L130 PetriNetUnfolder]: 13836/21473 cut-off events. [2023-01-28 06:42:55,387 INFO L131 PetriNetUnfolder]: For 12855/14317 co-relation queries the response was YES. [2023-01-28 06:42:55,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50628 conditions, 21473 events. 13836/21473 cut-off events. For 12855/14317 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 167877 event pairs, 5116 based on Foata normal form. 1145/21851 useless extension candidates. Maximal degree in co-relation 38841. Up to 9908 conditions per place. [2023-01-28 06:42:55,514 INFO L137 encePairwiseOnDemand]: 144/154 looper letters, 75 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2023-01-28 06:42:55,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 115 transitions, 624 flow [2023-01-28 06:42:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:42:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:42:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2023-01-28 06:42:55,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2023-01-28 06:42:55,515 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 242 transitions. [2023-01-28 06:42:55,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 242 transitions. [2023-01-28 06:42:55,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:55,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 242 transitions. [2023-01-28 06:42:55,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:55,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:55,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:55,517 INFO L175 Difference]: Start difference. First operand has 63 places, 77 transitions, 323 flow. Second operand 3 states and 242 transitions. [2023-01-28 06:42:55,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 115 transitions, 624 flow [2023-01-28 06:42:55,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 115 transitions, 624 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:42:55,539 INFO L231 Difference]: Finished difference. Result has 67 places, 83 transitions, 381 flow [2023-01-28 06:42:55,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=67, PETRI_TRANSITIONS=83} [2023-01-28 06:42:55,540 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2023-01-28 06:42:55,540 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 83 transitions, 381 flow [2023-01-28 06:42:55,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:55,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:55,541 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:55,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:42:55,541 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:55,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:55,541 INFO L85 PathProgramCache]: Analyzing trace with hash 420780807, now seen corresponding path program 1 times [2023-01-28 06:42:55,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:55,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688381904] [2023-01-28 06:42:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:55,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:42:55,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:55,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688381904] [2023-01-28 06:42:55,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688381904] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:42:55,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:42:55,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:42:55,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147618204] [2023-01-28 06:42:55,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:42:55,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:42:55,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:55,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:42:55,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:42:55,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 154 [2023-01-28 06:42:55,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 83 transitions, 381 flow. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:55,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:55,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 154 [2023-01-28 06:42:55,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:57,588 INFO L130 PetriNetUnfolder]: 18101/28276 cut-off events. [2023-01-28 06:42:57,588 INFO L131 PetriNetUnfolder]: For 20533/20813 co-relation queries the response was YES. [2023-01-28 06:42:57,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73026 conditions, 28276 events. 18101/28276 cut-off events. For 20533/20813 co-relation queries the response was YES. Maximal size of possible extension queue 1662. Compared 227398 event pairs, 4583 based on Foata normal form. 556/28371 useless extension candidates. Maximal degree in co-relation 43551. Up to 11838 conditions per place. [2023-01-28 06:42:57,714 INFO L137 encePairwiseOnDemand]: 143/154 looper letters, 149 selfloop transitions, 39 changer transitions 0/203 dead transitions. [2023-01-28 06:42:57,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 203 transitions, 1188 flow [2023-01-28 06:42:57,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:42:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:42:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 438 transitions. [2023-01-28 06:42:57,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474025974025974 [2023-01-28 06:42:57,716 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 438 transitions. [2023-01-28 06:42:57,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 438 transitions. [2023-01-28 06:42:57,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:57,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 438 transitions. [2023-01-28 06:42:57,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:57,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:57,718 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:57,718 INFO L175 Difference]: Start difference. First operand has 67 places, 83 transitions, 381 flow. Second operand 6 states and 438 transitions. [2023-01-28 06:42:57,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 203 transitions, 1188 flow [2023-01-28 06:42:57,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 203 transitions, 1174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:42:57,768 INFO L231 Difference]: Finished difference. Result has 73 places, 106 transitions, 641 flow [2023-01-28 06:42:57,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=641, PETRI_PLACES=73, PETRI_TRANSITIONS=106} [2023-01-28 06:42:57,768 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 18 predicate places. [2023-01-28 06:42:57,769 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 106 transitions, 641 flow [2023-01-28 06:42:57,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:57,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:57,769 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:57,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:42:57,769 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:57,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:57,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1151192071, now seen corresponding path program 1 times [2023-01-28 06:42:57,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:57,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992351565] [2023-01-28 06:42:57,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:57,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:42:57,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:57,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992351565] [2023-01-28 06:42:57,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992351565] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:42:57,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419931953] [2023-01-28 06:42:57,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:57,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:42:57,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:42:57,833 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:42:57,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 06:42:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:57,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-28 06:42:57,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:42:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:42:57,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 06:42:57,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419931953] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:42:57,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 06:42:57,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2023-01-28 06:42:57,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11356101] [2023-01-28 06:42:57,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:42:57,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:42:57,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:57,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:42:57,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:42:57,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 154 [2023-01-28 06:42:57,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 106 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:57,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:57,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 154 [2023-01-28 06:42:57,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:58,152 INFO L130 PetriNetUnfolder]: 2059/4191 cut-off events. [2023-01-28 06:42:58,152 INFO L131 PetriNetUnfolder]: For 2163/2171 co-relation queries the response was YES. [2023-01-28 06:42:58,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9793 conditions, 4191 events. 2059/4191 cut-off events. For 2163/2171 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 33534 event pairs, 831 based on Foata normal form. 354/4494 useless extension candidates. Maximal degree in co-relation 7431. Up to 1784 conditions per place. [2023-01-28 06:42:58,171 INFO L137 encePairwiseOnDemand]: 142/154 looper letters, 28 selfloop transitions, 12 changer transitions 0/72 dead transitions. [2023-01-28 06:42:58,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 72 transitions, 415 flow [2023-01-28 06:42:58,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:42:58,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:42:58,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2023-01-28 06:42:58,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-01-28 06:42:58,172 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 238 transitions. [2023-01-28 06:42:58,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 238 transitions. [2023-01-28 06:42:58,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:58,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 238 transitions. [2023-01-28 06:42:58,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:58,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:58,174 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:58,174 INFO L175 Difference]: Start difference. First operand has 73 places, 106 transitions, 641 flow. Second operand 3 states and 238 transitions. [2023-01-28 06:42:58,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 72 transitions, 415 flow [2023-01-28 06:42:58,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 72 transitions, 360 flow, removed 17 selfloop flow, removed 6 redundant places. [2023-01-28 06:42:58,179 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 270 flow [2023-01-28 06:42:58,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2023-01-28 06:42:58,180 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2023-01-28 06:42:58,180 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 270 flow [2023-01-28 06:42:58,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:58,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:58,180 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:58,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 06:42:58,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:42:58,387 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:58,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:58,387 INFO L85 PathProgramCache]: Analyzing trace with hash -841570106, now seen corresponding path program 1 times [2023-01-28 06:42:58,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:58,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305491006] [2023-01-28 06:42:58,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:58,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-01-28 06:42:58,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:58,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305491006] [2023-01-28 06:42:58,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305491006] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:42:58,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:42:58,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:42:58,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372777687] [2023-01-28 06:42:58,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:42:58,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:42:58,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:58,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:42:58,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:42:58,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 154 [2023-01-28 06:42:58,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:58,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:58,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 154 [2023-01-28 06:42:58,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:58,835 INFO L130 PetriNetUnfolder]: 1891/3540 cut-off events. [2023-01-28 06:42:58,836 INFO L131 PetriNetUnfolder]: For 1353/1381 co-relation queries the response was YES. [2023-01-28 06:42:58,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9051 conditions, 3540 events. 1891/3540 cut-off events. For 1353/1381 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 25782 event pairs, 671 based on Foata normal form. 4/3522 useless extension candidates. Maximal degree in co-relation 4728. Up to 1381 conditions per place. [2023-01-28 06:42:58,849 INFO L137 encePairwiseOnDemand]: 144/154 looper letters, 87 selfloop transitions, 11 changer transitions 0/110 dead transitions. [2023-01-28 06:42:58,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 110 transitions, 630 flow [2023-01-28 06:42:58,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:42:58,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:42:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 382 transitions. [2023-01-28 06:42:58,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4134199134199134 [2023-01-28 06:42:58,851 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 382 transitions. [2023-01-28 06:42:58,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 382 transitions. [2023-01-28 06:42:58,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:58,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 382 transitions. [2023-01-28 06:42:58,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:58,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:58,853 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:58,853 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 270 flow. Second operand 6 states and 382 transitions. [2023-01-28 06:42:58,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 110 transitions, 630 flow [2023-01-28 06:42:58,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 110 transitions, 600 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:42:58,857 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 304 flow [2023-01-28 06:42:58,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=304, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2023-01-28 06:42:58,857 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 19 predicate places. [2023-01-28 06:42:58,858 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 304 flow [2023-01-28 06:42:58,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:58,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:58,858 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:58,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:42:58,858 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:58,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:58,858 INFO L85 PathProgramCache]: Analyzing trace with hash 601777900, now seen corresponding path program 1 times [2023-01-28 06:42:58,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:58,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689793608] [2023-01-28 06:42:58,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:58,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:42:58,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:58,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689793608] [2023-01-28 06:42:58,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689793608] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:42:58,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089033489] [2023-01-28 06:42:58,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:58,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:42:58,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:42:58,923 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:42:58,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 06:42:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:58,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 06:42:58,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:42:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:42:59,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:42:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:42:59,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089033489] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:42:59,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:42:59,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-28 06:42:59,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059390349] [2023-01-28 06:42:59,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:42:59,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 06:42:59,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:59,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 06:42:59,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-01-28 06:42:59,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 154 [2023-01-28 06:42:59,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 304 flow. Second operand has 13 states, 13 states have (on average 48.38461538461539) internal successors, (629), 13 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:59,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:59,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 154 [2023-01-28 06:42:59,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:59,513 INFO L130 PetriNetUnfolder]: 1692/3147 cut-off events. [2023-01-28 06:42:59,513 INFO L131 PetriNetUnfolder]: For 1636/1648 co-relation queries the response was YES. [2023-01-28 06:42:59,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7969 conditions, 3147 events. 1692/3147 cut-off events. For 1636/1648 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22488 event pairs, 524 based on Foata normal form. 8/3136 useless extension candidates. Maximal degree in co-relation 5087. Up to 1088 conditions per place. [2023-01-28 06:42:59,525 INFO L137 encePairwiseOnDemand]: 139/154 looper letters, 101 selfloop transitions, 28 changer transitions 0/141 dead transitions. [2023-01-28 06:42:59,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 141 transitions, 838 flow [2023-01-28 06:42:59,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-28 06:42:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-28 06:42:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 631 transitions. [2023-01-28 06:42:59,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724911452184179 [2023-01-28 06:42:59,527 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 631 transitions. [2023-01-28 06:42:59,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 631 transitions. [2023-01-28 06:42:59,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:59,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 631 transitions. [2023-01-28 06:42:59,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 57.36363636363637) internal successors, (631), 11 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:59,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 154.0) internal successors, (1848), 12 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:59,530 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 154.0) internal successors, (1848), 12 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:59,530 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 304 flow. Second operand 11 states and 631 transitions. [2023-01-28 06:42:59,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 141 transitions, 838 flow [2023-01-28 06:42:59,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 141 transitions, 824 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-01-28 06:42:59,534 INFO L231 Difference]: Finished difference. Result has 85 places, 67 transitions, 383 flow [2023-01-28 06:42:59,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=383, PETRI_PLACES=85, PETRI_TRANSITIONS=67} [2023-01-28 06:42:59,535 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 30 predicate places. [2023-01-28 06:42:59,535 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 383 flow [2023-01-28 06:42:59,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.38461538461539) internal successors, (629), 13 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:59,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:59,535 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:59,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 06:42:59,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-28 06:42:59,740 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:59,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:59,740 INFO L85 PathProgramCache]: Analyzing trace with hash 801734806, now seen corresponding path program 1 times [2023-01-28 06:42:59,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:59,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100928113] [2023-01-28 06:42:59,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:59,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:42:59,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:59,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100928113] [2023-01-28 06:42:59,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100928113] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:42:59,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:42:59,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:42:59,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741026326] [2023-01-28 06:42:59,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:42:59,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:42:59,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:59,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:42:59,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:42:59,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 154 [2023-01-28 06:42:59,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 383 flow. Second operand has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:59,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:59,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 154 [2023-01-28 06:42:59,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:43:00,095 INFO L130 PetriNetUnfolder]: 1378/2592 cut-off events. [2023-01-28 06:43:00,095 INFO L131 PetriNetUnfolder]: For 1686/1702 co-relation queries the response was YES. [2023-01-28 06:43:00,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6806 conditions, 2592 events. 1378/2592 cut-off events. For 1686/1702 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17846 event pairs, 477 based on Foata normal form. 10/2586 useless extension candidates. Maximal degree in co-relation 4087. Up to 971 conditions per place. [2023-01-28 06:43:00,105 INFO L137 encePairwiseOnDemand]: 143/154 looper letters, 96 selfloop transitions, 13 changer transitions 0/121 dead transitions. [2023-01-28 06:43:00,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 121 transitions, 793 flow [2023-01-28 06:43:00,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:43:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:43:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 470 transitions. [2023-01-28 06:43:00,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3814935064935065 [2023-01-28 06:43:00,106 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 470 transitions. [2023-01-28 06:43:00,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 470 transitions. [2023-01-28 06:43:00,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:43:00,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 470 transitions. [2023-01-28 06:43:00,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 58.75) internal successors, (470), 8 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:00,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:00,109 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:00,109 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 383 flow. Second operand 8 states and 470 transitions. [2023-01-28 06:43:00,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 121 transitions, 793 flow [2023-01-28 06:43:00,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 121 transitions, 734 flow, removed 10 selfloop flow, removed 9 redundant places. [2023-01-28 06:43:00,113 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 372 flow [2023-01-28 06:43:00,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2023-01-28 06:43:00,114 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 30 predicate places. [2023-01-28 06:43:00,114 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 372 flow [2023-01-28 06:43:00,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:00,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:43:00,114 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:43:00,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 06:43:00,114 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:43:00,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:43:00,115 INFO L85 PathProgramCache]: Analyzing trace with hash 346429423, now seen corresponding path program 1 times [2023-01-28 06:43:00,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:43:00,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117520356] [2023-01-28 06:43:00,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:43:00,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:43:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:43:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:43:00,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:43:00,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117520356] [2023-01-28 06:43:00,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117520356] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:43:00,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125675458] [2023-01-28 06:43:00,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:43:00,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:43:00,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:43:00,203 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:43:00,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 06:43:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:43:00,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 06:43:00,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:43:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:43:00,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:43:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:43:00,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125675458] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:43:00,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:43:00,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-28 06:43:00,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195909447] [2023-01-28 06:43:00,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:43:00,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 06:43:00,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:43:00,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 06:43:00,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-01-28 06:43:00,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 154 [2023-01-28 06:43:00,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 372 flow. Second operand has 13 states, 13 states have (on average 48.69230769230769) internal successors, (633), 13 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:00,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:43:00,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 154 [2023-01-28 06:43:00,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:43:00,838 INFO L130 PetriNetUnfolder]: 1199/2273 cut-off events. [2023-01-28 06:43:00,838 INFO L131 PetriNetUnfolder]: For 1134/1150 co-relation queries the response was YES. [2023-01-28 06:43:00,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 2273 events. 1199/2273 cut-off events. For 1134/1150 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15333 event pairs, 412 based on Foata normal form. 6/2258 useless extension candidates. Maximal degree in co-relation 4191. Up to 880 conditions per place. [2023-01-28 06:43:00,847 INFO L137 encePairwiseOnDemand]: 139/154 looper letters, 91 selfloop transitions, 32 changer transitions 0/135 dead transitions. [2023-01-28 06:43:00,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 135 transitions, 850 flow [2023-01-28 06:43:00,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 06:43:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 06:43:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 714 transitions. [2023-01-28 06:43:00,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35664335664335667 [2023-01-28 06:43:00,850 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 714 transitions. [2023-01-28 06:43:00,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 714 transitions. [2023-01-28 06:43:00,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:43:00,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 714 transitions. [2023-01-28 06:43:00,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 54.92307692307692) internal successors, (714), 13 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:00,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 154.0) internal successors, (2156), 14 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:00,854 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 154.0) internal successors, (2156), 14 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:00,854 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 372 flow. Second operand 13 states and 714 transitions. [2023-01-28 06:43:00,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 135 transitions, 850 flow [2023-01-28 06:43:00,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 135 transitions, 826 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 06:43:00,858 INFO L231 Difference]: Finished difference. Result has 94 places, 72 transitions, 435 flow [2023-01-28 06:43:00,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=435, PETRI_PLACES=94, PETRI_TRANSITIONS=72} [2023-01-28 06:43:00,859 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 39 predicate places. [2023-01-28 06:43:00,859 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 72 transitions, 435 flow [2023-01-28 06:43:00,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.69230769230769) internal successors, (633), 13 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:00,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:43:00,859 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:43:00,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 06:43:01,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-28 06:43:01,064 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:43:01,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:43:01,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1846406849, now seen corresponding path program 1 times [2023-01-28 06:43:01,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:43:01,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541535826] [2023-01-28 06:43:01,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:43:01,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:43:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:43:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 06:43:01,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:43:01,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541535826] [2023-01-28 06:43:01,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541535826] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:43:01,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421805214] [2023-01-28 06:43:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:43:01,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:43:01,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:43:01,143 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:43:01,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 06:43:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:43:01,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 06:43:01,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:43:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 06:43:01,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:43:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 06:43:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421805214] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:43:01,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:43:01,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-28 06:43:01,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320463363] [2023-01-28 06:43:01,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:43:01,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 06:43:01,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:43:01,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 06:43:01,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-01-28 06:43:01,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 154 [2023-01-28 06:43:01,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 72 transitions, 435 flow. Second operand has 13 states, 13 states have (on average 48.53846153846154) internal successors, (631), 13 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:01,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:43:01,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 154 [2023-01-28 06:43:01,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:43:01,745 INFO L130 PetriNetUnfolder]: 1032/1974 cut-off events. [2023-01-28 06:43:01,745 INFO L131 PetriNetUnfolder]: For 1100/1116 co-relation queries the response was YES. [2023-01-28 06:43:01,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5231 conditions, 1974 events. 1032/1974 cut-off events. For 1100/1116 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12939 event pairs, 392 based on Foata normal form. 6/1960 useless extension candidates. Maximal degree in co-relation 3572. Up to 828 conditions per place. [2023-01-28 06:43:01,754 INFO L137 encePairwiseOnDemand]: 139/154 looper letters, 82 selfloop transitions, 33 changer transitions 1/128 dead transitions. [2023-01-28 06:43:01,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 128 transitions, 871 flow [2023-01-28 06:43:01,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 06:43:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 06:43:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 657 transitions. [2023-01-28 06:43:01,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3555194805194805 [2023-01-28 06:43:01,756 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 657 transitions. [2023-01-28 06:43:01,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 657 transitions. [2023-01-28 06:43:01,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:43:01,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 657 transitions. [2023-01-28 06:43:01,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 54.75) internal successors, (657), 12 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:01,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 154.0) internal successors, (2002), 13 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:01,759 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 154.0) internal successors, (2002), 13 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:01,760 INFO L175 Difference]: Start difference. First operand has 94 places, 72 transitions, 435 flow. Second operand 12 states and 657 transitions. [2023-01-28 06:43:01,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 128 transitions, 871 flow [2023-01-28 06:43:01,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 128 transitions, 836 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-01-28 06:43:01,764 INFO L231 Difference]: Finished difference. Result has 100 places, 75 transitions, 520 flow [2023-01-28 06:43:01,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=520, PETRI_PLACES=100, PETRI_TRANSITIONS=75} [2023-01-28 06:43:01,764 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 45 predicate places. [2023-01-28 06:43:01,765 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 75 transitions, 520 flow [2023-01-28 06:43:01,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.53846153846154) internal successors, (631), 13 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:01,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:43:01,765 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:43:01,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-28 06:43:01,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-28 06:43:01,969 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:43:01,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:43:01,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2059458919, now seen corresponding path program 1 times [2023-01-28 06:43:01,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:43:01,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408197819] [2023-01-28 06:43:01,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:43:01,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:43:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:43:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-01-28 06:43:02,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:43:02,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408197819] [2023-01-28 06:43:02,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408197819] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:43:02,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:43:02,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:43:02,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926894547] [2023-01-28 06:43:02,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:43:02,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:43:02,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:43:02,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:43:02,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:43:02,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 154 [2023-01-28 06:43:02,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 75 transitions, 520 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:02,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:43:02,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 154 [2023-01-28 06:43:02,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:43:02,265 INFO L130 PetriNetUnfolder]: 755/1478 cut-off events. [2023-01-28 06:43:02,265 INFO L131 PetriNetUnfolder]: For 1304/1312 co-relation queries the response was YES. [2023-01-28 06:43:02,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4111 conditions, 1478 events. 755/1478 cut-off events. For 1304/1312 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9144 event pairs, 349 based on Foata normal form. 4/1464 useless extension candidates. Maximal degree in co-relation 2420. Up to 747 conditions per place. [2023-01-28 06:43:02,271 INFO L137 encePairwiseOnDemand]: 143/154 looper letters, 79 selfloop transitions, 13 changer transitions 1/105 dead transitions. [2023-01-28 06:43:02,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 105 transitions, 814 flow [2023-01-28 06:43:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:43:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:43:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 447 transitions. [2023-01-28 06:43:02,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3628246753246753 [2023-01-28 06:43:02,273 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 447 transitions. [2023-01-28 06:43:02,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 447 transitions. [2023-01-28 06:43:02,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:43:02,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 447 transitions. [2023-01-28 06:43:02,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 55.875) internal successors, (447), 8 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:02,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:02,275 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:02,275 INFO L175 Difference]: Start difference. First operand has 100 places, 75 transitions, 520 flow. Second operand 8 states and 447 transitions. [2023-01-28 06:43:02,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 105 transitions, 814 flow [2023-01-28 06:43:02,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 105 transitions, 789 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-01-28 06:43:02,281 INFO L231 Difference]: Finished difference. Result has 104 places, 76 transitions, 536 flow [2023-01-28 06:43:02,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=536, PETRI_PLACES=104, PETRI_TRANSITIONS=76} [2023-01-28 06:43:02,281 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 49 predicate places. [2023-01-28 06:43:02,281 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 76 transitions, 536 flow [2023-01-28 06:43:02,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:02,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:43:02,282 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:43:02,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-01-28 06:43:02,282 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:43:02,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:43:02,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1668575763, now seen corresponding path program 1 times [2023-01-28 06:43:02,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:43:02,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791867043] [2023-01-28 06:43:02,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:43:02,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:43:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:43:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-01-28 06:43:02,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:43:02,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791867043] [2023-01-28 06:43:02,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791867043] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:43:02,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:43:02,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:43:02,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327375855] [2023-01-28 06:43:02,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:43:02,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:43:02,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:43:02,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:43:02,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:43:02,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 154 [2023-01-28 06:43:02,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 76 transitions, 536 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:02,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:43:02,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 154 [2023-01-28 06:43:02,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:43:02,540 INFO L130 PetriNetUnfolder]: 489/992 cut-off events. [2023-01-28 06:43:02,540 INFO L131 PetriNetUnfolder]: For 966/978 co-relation queries the response was YES. [2023-01-28 06:43:02,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2860 conditions, 992 events. 489/992 cut-off events. For 966/978 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5517 event pairs, 251 based on Foata normal form. 6/986 useless extension candidates. Maximal degree in co-relation 2630. Up to 627 conditions per place. [2023-01-28 06:43:02,545 INFO L137 encePairwiseOnDemand]: 142/154 looper letters, 72 selfloop transitions, 14 changer transitions 1/99 dead transitions. [2023-01-28 06:43:02,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 99 transitions, 800 flow [2023-01-28 06:43:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:43:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:43:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 487 transitions. [2023-01-28 06:43:02,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3513708513708514 [2023-01-28 06:43:02,546 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 487 transitions. [2023-01-28 06:43:02,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 487 transitions. [2023-01-28 06:43:02,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:43:02,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 487 transitions. [2023-01-28 06:43:02,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 54.111111111111114) internal successors, (487), 9 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:02,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 154.0) internal successors, (1540), 10 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:02,549 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 154.0) internal successors, (1540), 10 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:02,549 INFO L175 Difference]: Start difference. First operand has 104 places, 76 transitions, 536 flow. Second operand 9 states and 487 transitions. [2023-01-28 06:43:02,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 99 transitions, 800 flow [2023-01-28 06:43:02,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 99 transitions, 772 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-01-28 06:43:02,554 INFO L231 Difference]: Finished difference. Result has 109 places, 77 transitions, 551 flow [2023-01-28 06:43:02,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=551, PETRI_PLACES=109, PETRI_TRANSITIONS=77} [2023-01-28 06:43:02,554 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 54 predicate places. [2023-01-28 06:43:02,554 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 77 transitions, 551 flow [2023-01-28 06:43:02,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:43:02,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:43:02,555 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:43:02,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-01-28 06:43:02,555 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:43:02,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:43:02,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1360542986, now seen corresponding path program 1 times [2023-01-28 06:43:02,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:43:02,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403578029] [2023-01-28 06:43:02,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:43:02,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:43:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:43:02,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:43:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:43:02,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:43:02,596 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:43:02,596 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 06:43:02,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-01-28 06:43:02,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-01-28 06:43:02,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-01-28 06:43:02,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-01-28 06:43:02,597 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:43:02,597 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-01-28 06:43:02,598 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-01-28 06:43:02,598 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:43:02,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:43:02 BasicIcfg [2023-01-28 06:43:02,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:43:02,630 INFO L158 Benchmark]: Toolchain (without parser) took 19714.11ms. Allocated memory was 564.1MB in the beginning and 3.5GB in the end (delta: 2.9GB). Free memory was 526.8MB in the beginning and 2.5GB in the end (delta: -1.9GB). Peak memory consumption was 962.3MB. Max. memory is 16.0GB. [2023-01-28 06:43:02,630 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 354.4MB. Free memory was 300.8MB in the beginning and 300.8MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:43:02,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.72ms. Allocated memory is still 564.1MB. Free memory was 526.8MB in the beginning and 507.3MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-01-28 06:43:02,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.96ms. Allocated memory is still 564.1MB. Free memory was 506.6MB in the beginning and 505.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:43:02,631 INFO L158 Benchmark]: Boogie Preprocessor took 15.53ms. Allocated memory is still 564.1MB. Free memory was 505.1MB in the beginning and 503.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:43:02,631 INFO L158 Benchmark]: RCFGBuilder took 395.92ms. Allocated memory is still 564.1MB. Free memory was 503.1MB in the beginning and 485.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-01-28 06:43:02,631 INFO L158 Benchmark]: TraceAbstraction took 18917.10ms. Allocated memory was 564.1MB in the beginning and 3.5GB in the end (delta: 2.9GB). Free memory was 484.9MB in the beginning and 2.5GB in the end (delta: -2.0GB). Peak memory consumption was 920.4MB. Max. memory is 16.0GB. [2023-01-28 06:43:02,632 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.08ms. Allocated memory is still 354.4MB. Free memory was 300.8MB in the beginning and 300.8MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 351.72ms. Allocated memory is still 564.1MB. Free memory was 526.8MB in the beginning and 507.3MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 29.96ms. Allocated memory is still 564.1MB. Free memory was 506.6MB in the beginning and 505.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 15.53ms. Allocated memory is still 564.1MB. Free memory was 505.1MB in the beginning and 503.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 395.92ms. Allocated memory is still 564.1MB. Free memory was 503.1MB in the beginning and 485.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 18917.10ms. Allocated memory was 564.1MB in the beginning and 3.5GB in the end (delta: 2.9GB). Free memory was 484.9MB in the beginning and 2.5GB in the end (delta: -2.0GB). Peak memory consumption was 920.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 49 PlacesBefore, 11 PlacesAfterwards, 49 TransitionsBefore, 8 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 3 ChoiceCompositions, 50 TotalNumberOfCompositions, 520 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 520, independent: 520, independent conditional: 0, independent unconditional: 520, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 309, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 520, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 309, unknown conditional: 0, unknown unconditional: 309] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 49 PlacesBefore, 11 PlacesAfterwards, 49 TransitionsBefore, 8 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 3 ChoiceCompositions, 50 TotalNumberOfCompositions, 522 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 522, independent: 522, independent conditional: 0, independent unconditional: 522, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 309, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 522, independent: 213, independent conditional: 0, independent unconditional: 213, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 309, unknown conditional: 0, unknown unconditional: 309] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 72 PlacesBefore, 39 PlacesAfterwards, 72 TransitionsBefore, 36 TransitionsAfterwards, 2156 CoEnabledTransitionPairs, 5 FixpointIterations, 12 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 47 TotalNumberOfCompositions, 8141 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3041, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1012, independent: 986, independent conditional: 0, independent unconditional: 986, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3041, independent: 1787, independent conditional: 0, independent unconditional: 1787, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 1012, unknown conditional: 0, unknown unconditional: 1012] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 72 PlacesBefore, 39 PlacesAfterwards, 72 TransitionsBefore, 36 TransitionsAfterwards, 2156 CoEnabledTransitionPairs, 5 FixpointIterations, 12 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 47 TotalNumberOfCompositions, 8141 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2953, independent: 2685, independent conditional: 0, independent unconditional: 2685, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 995, independent: 972, independent conditional: 0, independent unconditional: 972, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2953, independent: 1713, independent conditional: 0, independent unconditional: 1713, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 995, unknown conditional: 0, unknown unconditional: 995] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 95 PlacesBefore, 55 PlacesAfterwards, 95 TransitionsBefore, 51 TransitionsAfterwards, 4752 CoEnabledTransitionPairs, 5 FixpointIterations, 12 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 4 ChoiceCompositions, 59 TotalNumberOfCompositions, 20874 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8432, independent: 8017, independent conditional: 0, independent unconditional: 8017, dependent: 415, dependent conditional: 0, dependent unconditional: 415, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2330, independent: 2266, independent conditional: 0, independent unconditional: 2266, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8432, independent: 5751, independent conditional: 0, independent unconditional: 5751, dependent: 351, dependent conditional: 0, dependent unconditional: 351, unknown: 2330, unknown conditional: 0, unknown unconditional: 2330] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 405, Positive conditional cache size: 0, Positive unconditional cache size: 405, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 728]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] 0 volatile unsigned int count = 0; [L705] 0 _Bool MTX = 0; [L706] 0 _Bool COND = 0; [L732] 0 pthread_t t; VAL [COND=0, MTX=0, count=0, t={3:0}] [L733] COND TRUE 0 1 [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=0, count=0, pthread_create(&t, 0, thr1, 0)=5, t={3:0}] [L733] COND TRUE 0 1 [L727] CALL 1 Barrier2() [L718] CALL 1 __VERIFIER_atomic_acquire() [L709] CALL 1 assume_abort_if_not(MTX==0) [L3] COND FALSE 1 !(!cond) [L709] RET 1 assume_abort_if_not(MTX==0) [L710] 1 MTX = 1 [L718] RET 1 __VERIFIER_atomic_acquire() [L719] 1 count++ VAL [COND=0, MTX=1, count++=0, count=0] [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=1, count=0, pthread_create(&t, 0, thr1, 0)=6, t={3:0}] [L733] COND TRUE 0 1 [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=1, count=0, pthread_create(&t, 0, thr1, 0)=7, t={3:0}] [L719] 1 count++ [L720] COND FALSE 1 !(count == 3) VAL [COND=0, MTX=1, count=1] [L724] CALL 1 __VERIFIER_atomic_release() [L714] CALL 1 assume_abort_if_not(MTX==1) [L3] COND FALSE 1 !(!cond) [L714] RET 1 assume_abort_if_not(MTX==1) [L715] 1 MTX = 0 [L724] RET 1 __VERIFIER_atomic_release() [L727] CALL 2 Barrier2() [L718] CALL 2 __VERIFIER_atomic_acquire() [L709] CALL 2 assume_abort_if_not(MTX==0) [L3] COND FALSE 2 !(!cond) [L709] RET 2 assume_abort_if_not(MTX==0) [L710] 2 MTX = 1 [L718] RET 2 __VERIFIER_atomic_acquire() [L719] 2 count++ VAL [COND=0, MTX=1, count=2] [L720] COND FALSE 2 !(count == 3) VAL [COND=0, MTX=1, count=2] [L724] CALL 2 __VERIFIER_atomic_release() [L714] CALL 2 assume_abort_if_not(MTX==1) [L3] COND FALSE 2 !(!cond) [L714] RET 2 assume_abort_if_not(MTX==1) [L715] 2 MTX = 0 [L724] RET 2 __VERIFIER_atomic_release() [L727] CALL 3 Barrier2() [L718] CALL 3 __VERIFIER_atomic_acquire() [L709] CALL 3 assume_abort_if_not(MTX==0) [L3] COND FALSE 3 !(!cond) [L709] RET 3 assume_abort_if_not(MTX==0) [L710] 3 MTX = 1 [L718] RET 3 __VERIFIER_atomic_acquire() [L719] 3 count++ [L720] COND TRUE 3 count == 3 VAL [COND=0, MTX=1, count=3] [L721] 3 COND = 1 VAL [COND=1, MTX=1, count=3] [L722] 3 count = 0 VAL [COND=1, MTX=1, count=0] [L725] CALL 3 __VERIFIER_atomic_release() [L714] CALL 3 assume_abort_if_not(MTX==1) [L3] COND FALSE 3 !(!cond) [L714] RET 3 assume_abort_if_not(MTX==1) [L715] 3 MTX = 0 [L725] RET 3 __VERIFIER_atomic_release() [L727] RET 3 Barrier2() [L728] 3 reach_error() VAL [COND=1, MTX=0, arg={0:0}, arg={0:0}, count=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 68 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 3, 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.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 89 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: 2.8s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 610 IncrementalHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 20 mSDtfsCounter, 610 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=3, InterpolantAutomatonStates: 40, 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.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 539 SizeOfPredicates, 5 NumberOfNonLiveVariables, 240 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 10/14 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 110 locations, 5 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: 11.4s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 994 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 994 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2977 IncrementalHoareTripleChecker+Invalid, 3085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 87 mSDtfsCounter, 2977 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 136 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=641occurred in iteration=3, InterpolantAutomatonStates: 86, 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.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 2147 SizeOfPredicates, 13 NumberOfNonLiveVariables, 524 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 58/86 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 68 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.4s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.3s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 89 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: 0.8s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.8s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 06:43:02,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...