/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/11_fmaxsymopt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:29:42,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:29:42,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:29:42,741 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:29:42,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:29:42,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:29:42,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:29:42,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:29:42,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:29:42,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:29:42,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:29:42,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:29:42,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:29:42,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:29:42,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:29:42,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:29:42,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:29:42,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:29:42,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:29:42,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:29:42,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:29:42,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:29:42,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:29:42,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:29:42,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:29:42,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:29:42,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:29:42,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:29:42,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:29:42,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:29:42,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:29:42,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:29:42,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:29:42,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:29:42,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:29:42,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:29:42,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:29:42,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:29:42,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:29:42,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:29:42,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:29:42,787 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:29:42,814 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:29:42,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:29:42,815 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:29:42,816 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:29:42,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:29:42,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:29:42,817 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:29:42,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:29:42,817 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:29:42,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:29:42,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:29:42,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:29:42,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:29:42,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:29:42,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:29:42,818 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:29:42,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:29:42,818 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:29:42,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:29:42,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:29:42,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:29:42,819 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:29:42,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:29:42,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:29:42,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:29:42,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:29:42,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:29:42,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:29:42,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:29:42,820 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:29:42,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:29:42,820 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:29:43,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:29:43,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:29:43,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:29:43,046 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:29:43,047 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:29:43,050 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2023-01-28 06:29:44,126 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:29:44,357 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:29:44,358 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2023-01-28 06:29:44,365 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1277d0370/029e0abd8d9644998e9fcfcd235331c8/FLAGeef0dab82 [2023-01-28 06:29:44,375 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1277d0370/029e0abd8d9644998e9fcfcd235331c8 [2023-01-28 06:29:44,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:29:44,377 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:29:44,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:29:44,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:29:44,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:29:44,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:29:44" (1/1) ... [2023-01-28 06:29:44,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ac532d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:29:44, skipping insertion in model container [2023-01-28 06:29:44,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:29:44" (1/1) ... [2023-01-28 06:29:44,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:29:44,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:29:44,711 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/11_fmaxsymopt.i[30540,30553] [2023-01-28 06:29:44,719 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:29:44,729 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:29:44,768 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/11_fmaxsymopt.i[30540,30553] [2023-01-28 06:29:44,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:29:44,829 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:29:44,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:29:44 WrapperNode [2023-01-28 06:29:44,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:29:44,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:29:44,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:29:44,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:29:44,836 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:29:44" (1/1) ... [2023-01-28 06:29:44,849 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:29:44" (1/1) ... [2023-01-28 06:29:44,871 INFO L138 Inliner]: procedures = 171, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2023-01-28 06:29:44,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:29:44,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:29:44,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:29:44,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:29:44,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:29:44" (1/1) ... [2023-01-28 06:29:44,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:29:44" (1/1) ... [2023-01-28 06:29:44,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:29:44" (1/1) ... [2023-01-28 06:29:44,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:29:44" (1/1) ... [2023-01-28 06:29:44,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:29:44" (1/1) ... [2023-01-28 06:29:44,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:29:44" (1/1) ... [2023-01-28 06:29:44,901 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:29:44" (1/1) ... [2023-01-28 06:29:44,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:29:44" (1/1) ... [2023-01-28 06:29:44,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:29:44,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:29:44,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:29:44,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:29:44,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:29:44" (1/1) ... [2023-01-28 06:29:44,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:29:44,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:29:44,940 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:29:44,957 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:29:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 06:29:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-01-28 06:29:44,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-01-28 06:29:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:29:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:29:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:29:44,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:29:44,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:29:44,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:29:44,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:29:44,977 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:29:45,103 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:29:45,104 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:29:45,295 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:29:45,333 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:29:45,333 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-01-28 06:29:45,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:29:45 BoogieIcfgContainer [2023-01-28 06:29:45,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:29:45,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:29:45,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:29:45,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:29:45,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:29:44" (1/3) ... [2023-01-28 06:29:45,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785d1346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:29:45, skipping insertion in model container [2023-01-28 06:29:45,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:29:44" (2/3) ... [2023-01-28 06:29:45,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785d1346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:29:45, skipping insertion in model container [2023-01-28 06:29:45,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:29:45" (3/3) ... [2023-01-28 06:29:45,344 INFO L112 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2023-01-28 06:29:45,359 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:29:45,359 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 06:29:45,359 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:29:45,418 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:29:45,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 161 flow [2023-01-28 06:29:45,480 INFO L130 PetriNetUnfolder]: 9/88 cut-off events. [2023-01-28 06:29:45,480 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:29:45,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 88 events. 9/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 56. Up to 4 conditions per place. [2023-01-28 06:29:45,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 78 transitions, 161 flow [2023-01-28 06:29:45,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 78 transitions, 161 flow [2023-01-28 06:29:45,492 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:29:45,500 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 78 transitions, 161 flow [2023-01-28 06:29:45,502 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 78 transitions, 161 flow [2023-01-28 06:29:45,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 161 flow [2023-01-28 06:29:45,534 INFO L130 PetriNetUnfolder]: 9/88 cut-off events. [2023-01-28 06:29:45,534 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:29:45,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 88 events. 9/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 56. Up to 4 conditions per place. [2023-01-28 06:29:45,537 INFO L119 LiptonReduction]: Number of co-enabled transitions 1144 [2023-01-28 06:29:48,060 INFO L134 LiptonReduction]: Checked pairs total: 894 [2023-01-28 06:29:48,061 INFO L136 LiptonReduction]: Total number of compositions: 81 [2023-01-28 06:29:48,073 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:29:48,078 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;@6ccd1f1f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:29:48,078 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-01-28 06:29:48,081 INFO L130 PetriNetUnfolder]: 1/9 cut-off events. [2023-01-28 06:29:48,082 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:29:48,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:48,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 06:29:48,083 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:29:48,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash 365604591, now seen corresponding path program 1 times [2023-01-28 06:29:48,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:48,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956920004] [2023-01-28 06:29:48,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:48,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:48,238 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:29:48,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:48,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956920004] [2023-01-28 06:29:48,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956920004] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:29:48,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:29:48,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:29:48,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132851350] [2023-01-28 06:29:48,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:29:48,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-28 06:29:48,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:48,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-28 06:29:48,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-28 06:29:48,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 159 [2023-01-28 06:29:48,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 12 places, 10 transitions, 25 flow. Second operand has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 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:29:48,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:48,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 159 [2023-01-28 06:29:48,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:48,305 INFO L130 PetriNetUnfolder]: 7/19 cut-off events. [2023-01-28 06:29:48,305 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:29:48,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 19 events. 7/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 4 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 30. Up to 19 conditions per place. [2023-01-28 06:29:48,307 INFO L137 encePairwiseOnDemand]: 157/159 looper letters, 0 selfloop transitions, 0 changer transitions 8/8 dead transitions. [2023-01-28 06:29:48,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 11 places, 8 transitions, 35 flow [2023-01-28 06:29:48,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-28 06:29:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-28 06:29:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 147 transitions. [2023-01-28 06:29:48,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46226415094339623 [2023-01-28 06:29:48,320 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 147 transitions. [2023-01-28 06:29:48,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 147 transitions. [2023-01-28 06:29:48,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:48,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 147 transitions. [2023-01-28 06:29:48,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 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:29:48,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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:29:48,338 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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:29:48,339 INFO L175 Difference]: Start difference. First operand has 12 places, 10 transitions, 25 flow. Second operand 2 states and 147 transitions. [2023-01-28 06:29:48,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 11 places, 8 transitions, 35 flow [2023-01-28 06:29:48,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 11 places, 8 transitions, 35 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:29:48,343 INFO L231 Difference]: Finished difference. Result has 11 places, 0 transitions, 0 flow [2023-01-28 06:29:48,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=21, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=0, PETRI_PLACES=11, PETRI_TRANSITIONS=0} [2023-01-28 06:29:48,347 INFO L281 CegarLoopForPetriNet]: 12 programPoint places, -1 predicate places. [2023-01-28 06:29:48,348 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 0 transitions, 0 flow [2023-01-28 06:29:48,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 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:29:48,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-01-28 06:29:48,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-01-28 06:29:48,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:29:48,351 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-01-28 06:29:48,357 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE (1/2) [2023-01-28 06:29:48,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 161 flow [2023-01-28 06:29:48,381 INFO L130 PetriNetUnfolder]: 9/88 cut-off events. [2023-01-28 06:29:48,381 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:29:48,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 88 events. 9/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 56. Up to 4 conditions per place. [2023-01-28 06:29:48,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 78 transitions, 161 flow [2023-01-28 06:29:48,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 78 transitions, 161 flow [2023-01-28 06:29:48,383 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:29:48,383 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 78 transitions, 161 flow [2023-01-28 06:29:48,384 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 78 transitions, 161 flow [2023-01-28 06:29:48,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 161 flow [2023-01-28 06:29:48,404 INFO L130 PetriNetUnfolder]: 9/88 cut-off events. [2023-01-28 06:29:48,404 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:29:48,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 88 events. 9/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 56. Up to 4 conditions per place. [2023-01-28 06:29:48,408 INFO L119 LiptonReduction]: Number of co-enabled transitions 1144 [2023-01-28 06:29:50,604 INFO L134 LiptonReduction]: Checked pairs total: 924 [2023-01-28 06:29:50,604 INFO L136 LiptonReduction]: Total number of compositions: 83 [2023-01-28 06:29:50,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-01-28 06:29:50,607 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;@6ccd1f1f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:29:50,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-28 06:29:50,610 INFO L130 PetriNetUnfolder]: 1/11 cut-off events. [2023-01-28 06:29:50,610 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:29:50,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:50,610 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-01-28 06:29:50,610 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 06:29:50,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:50,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1011638020, now seen corresponding path program 1 times [2023-01-28 06:29:50,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:50,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409957348] [2023-01-28 06:29:50,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:50,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:29:50,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:29:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:29:50,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:29:50,680 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:29:50,681 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-28 06:29:50,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:29:50,681 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-01-28 06:29:50,682 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-01-28 06:29:50,682 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-28 06:29:50,682 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-01-28 06:29:50,702 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:29:50,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 123 transitions, 258 flow [2023-01-28 06:29:50,742 INFO L130 PetriNetUnfolder]: 17/145 cut-off events. [2023-01-28 06:29:50,743 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:29:50,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 145 events. 17/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 252 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 100. Up to 6 conditions per place. [2023-01-28 06:29:50,744 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 123 transitions, 258 flow [2023-01-28 06:29:50,745 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 123 transitions, 258 flow [2023-01-28 06:29:50,745 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:29:50,745 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 123 transitions, 258 flow [2023-01-28 06:29:50,746 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 123 transitions, 258 flow [2023-01-28 06:29:50,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 123 transitions, 258 flow [2023-01-28 06:29:50,761 INFO L130 PetriNetUnfolder]: 17/145 cut-off events. [2023-01-28 06:29:50,761 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:29:50,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 145 events. 17/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 252 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 100. Up to 6 conditions per place. [2023-01-28 06:29:50,766 INFO L119 LiptonReduction]: Number of co-enabled transitions 6248 [2023-01-28 06:29:53,026 INFO L134 LiptonReduction]: Checked pairs total: 9776 [2023-01-28 06:29:53,026 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-01-28 06:29:53,027 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:29:53,028 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;@6ccd1f1f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:29:53,028 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-28 06:29:53,030 INFO L130 PetriNetUnfolder]: 2/13 cut-off events. [2023-01-28 06:29:53,030 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:29:53,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:53,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-28 06:29:53,031 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:29:53,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:53,031 INFO L85 PathProgramCache]: Analyzing trace with hash 698340090, now seen corresponding path program 1 times [2023-01-28 06:29:53,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:53,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722007922] [2023-01-28 06:29:53,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:53,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:53,062 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:29:53,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:53,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722007922] [2023-01-28 06:29:53,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722007922] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:29:53,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:29:53,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:29:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526183313] [2023-01-28 06:29:53,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:29:53,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-28 06:29:53,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:53,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-28 06:29:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-28 06:29:53,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 238 [2023-01-28 06:29:53,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 32 transitions, 76 flow. Second operand has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 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:29:53,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:53,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 238 [2023-01-28 06:29:53,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:53,098 INFO L130 PetriNetUnfolder]: 98/222 cut-off events. [2023-01-28 06:29:53,099 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-01-28 06:29:53,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 222 events. 98/222 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 906 event pairs, 64 based on Foata normal form. 21/202 useless extension candidates. Maximal degree in co-relation 104. Up to 149 conditions per place. [2023-01-28 06:29:53,100 INFO L137 encePairwiseOnDemand]: 233/238 looper letters, 14 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-01-28 06:29:53,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 94 flow [2023-01-28 06:29:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-28 06:29:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-28 06:29:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 233 transitions. [2023-01-28 06:29:53,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894957983193277 [2023-01-28 06:29:53,103 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 233 transitions. [2023-01-28 06:29:53,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 233 transitions. [2023-01-28 06:29:53,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:53,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 233 transitions. [2023-01-28 06:29:53,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 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:29:53,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 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:29:53,106 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 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:29:53,106 INFO L175 Difference]: Start difference. First operand has 29 places, 32 transitions, 76 flow. Second operand 2 states and 233 transitions. [2023-01-28 06:29:53,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 94 flow [2023-01-28 06:29:53,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 92 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-01-28 06:29:53,108 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 64 flow [2023-01-28 06:29:53,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2023-01-28 06:29:53,108 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-01-28 06:29:53,109 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 64 flow [2023-01-28 06:29:53,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 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:29:53,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:53,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:53,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:29:53,109 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:29:53,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:53,110 INFO L85 PathProgramCache]: Analyzing trace with hash -620647984, now seen corresponding path program 1 times [2023-01-28 06:29:53,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:53,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519163686] [2023-01-28 06:29:53,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:53,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:53,209 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:29:53,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:53,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519163686] [2023-01-28 06:29:53,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519163686] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:29:53,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:29:53,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:29:53,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509125668] [2023-01-28 06:29:53,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:29:53,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:29:53,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:53,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:29:53,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:29:53,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 238 [2023-01-28 06:29:53,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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:29:53,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:53,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 238 [2023-01-28 06:29:53,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:53,273 INFO L130 PetriNetUnfolder]: 115/243 cut-off events. [2023-01-28 06:29:53,274 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-28 06:29:53,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 243 events. 115/243 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1027 event pairs, 54 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 444. Up to 149 conditions per place. [2023-01-28 06:29:53,275 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 20 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-01-28 06:29:53,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 129 flow [2023-01-28 06:29:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:29:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:29:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2023-01-28 06:29:53,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44397759103641454 [2023-01-28 06:29:53,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2023-01-28 06:29:53,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2023-01-28 06:29:53,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:53,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2023-01-28 06:29:53,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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:29:53,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 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:29:53,282 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 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:29:53,282 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 64 flow. Second operand 3 states and 317 transitions. [2023-01-28 06:29:53,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 129 flow [2023-01-28 06:29:53,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 129 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:29:53,283 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 76 flow [2023-01-28 06:29:53,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2023-01-28 06:29:53,284 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2023-01-28 06:29:53,284 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 76 flow [2023-01-28 06:29:53,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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:29:53,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:53,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:53,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:29:53,285 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:29:53,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:53,286 INFO L85 PathProgramCache]: Analyzing trace with hash -450613029, now seen corresponding path program 1 times [2023-01-28 06:29:53,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:53,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038839045] [2023-01-28 06:29:53,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:53,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:53,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:29:53,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038839045] [2023-01-28 06:29:53,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038839045] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:29:53,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:29:53,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:29:53,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674391555] [2023-01-28 06:29:53,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:29:53,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:29:53,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:53,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:29:53,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:29:53,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 238 [2023-01-28 06:29:53,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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:29:53,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:53,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 238 [2023-01-28 06:29:53,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:53,398 INFO L130 PetriNetUnfolder]: 275/491 cut-off events. [2023-01-28 06:29:53,399 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2023-01-28 06:29:53,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 491 events. 275/491 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2264 event pairs, 125 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 1064. Up to 296 conditions per place. [2023-01-28 06:29:53,401 INFO L137 encePairwiseOnDemand]: 233/238 looper letters, 31 selfloop transitions, 4 changer transitions 1/41 dead transitions. [2023-01-28 06:29:53,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 179 flow [2023-01-28 06:29:53,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:29:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:29:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2023-01-28 06:29:53,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42436974789915966 [2023-01-28 06:29:53,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions. [2023-01-28 06:29:53,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions. [2023-01-28 06:29:53,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:53,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions. [2023-01-28 06:29:53,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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:29:53,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 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:29:53,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 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:29:53,408 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 76 flow. Second operand 3 states and 303 transitions. [2023-01-28 06:29:53,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 179 flow [2023-01-28 06:29:53,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 175 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 06:29:53,411 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 98 flow [2023-01-28 06:29:53,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2023-01-28 06:29:53,414 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2023-01-28 06:29:53,414 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 98 flow [2023-01-28 06:29:53,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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:29:53,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:53,414 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:53,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:29:53,414 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:29:53,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:53,415 INFO L85 PathProgramCache]: Analyzing trace with hash -885022386, now seen corresponding path program 1 times [2023-01-28 06:29:53,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:53,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039040739] [2023-01-28 06:29:53,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:53,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:53,478 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:29:53,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:53,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039040739] [2023-01-28 06:29:53,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039040739] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:29:53,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:29:53,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:29:53,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134214136] [2023-01-28 06:29:53,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:29:53,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:29:53,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:53,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:29:53,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:29:53,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 238 [2023-01-28 06:29:53,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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:29:53,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:53,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 238 [2023-01-28 06:29:53,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:53,538 INFO L130 PetriNetUnfolder]: 147/336 cut-off events. [2023-01-28 06:29:53,539 INFO L131 PetriNetUnfolder]: For 77/79 co-relation queries the response was YES. [2023-01-28 06:29:53,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 336 events. 147/336 cut-off events. For 77/79 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1568 event pairs, 89 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 694. Up to 206 conditions per place. [2023-01-28 06:29:53,541 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 22 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-01-28 06:29:53,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 170 flow [2023-01-28 06:29:53,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:29:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:29:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-01-28 06:29:53,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425770308123249 [2023-01-28 06:29:53,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-01-28 06:29:53,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-01-28 06:29:53,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:53,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-01-28 06:29:53,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:29:53,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 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:29:53,546 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 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:29:53,546 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 98 flow. Second operand 3 states and 316 transitions. [2023-01-28 06:29:53,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 170 flow [2023-01-28 06:29:53,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:29:53,549 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 102 flow [2023-01-28 06:29:53,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2023-01-28 06:29:53,551 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2023-01-28 06:29:53,551 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 102 flow [2023-01-28 06:29:53,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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:29:53,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:53,551 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:53,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:29:53,553 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:29:53,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:53,557 INFO L85 PathProgramCache]: Analyzing trace with hash 155201366, now seen corresponding path program 1 times [2023-01-28 06:29:53,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:53,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062393208] [2023-01-28 06:29:53,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:53,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 06:29:53,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:53,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062393208] [2023-01-28 06:29:53,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062393208] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:29:53,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:29:53,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:29:53,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391299116] [2023-01-28 06:29:53,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:29:53,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:29:53,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:53,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:29:53,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:29:53,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 238 [2023-01-28 06:29:53,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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:29:53,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:53,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 238 [2023-01-28 06:29:53,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:53,695 INFO L130 PetriNetUnfolder]: 287/507 cut-off events. [2023-01-28 06:29:53,695 INFO L131 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2023-01-28 06:29:53,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 507 events. 287/507 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2239 event pairs, 129 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 1242. Up to 294 conditions per place. [2023-01-28 06:29:53,698 INFO L137 encePairwiseOnDemand]: 233/238 looper letters, 30 selfloop transitions, 4 changer transitions 4/43 dead transitions. [2023-01-28 06:29:53,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 214 flow [2023-01-28 06:29:53,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:29:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:29:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2023-01-28 06:29:53,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4215686274509804 [2023-01-28 06:29:53,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2023-01-28 06:29:53,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2023-01-28 06:29:53,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:53,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2023-01-28 06:29:53,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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:29:53,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 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:29:53,703 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 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:29:53,703 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 102 flow. Second operand 3 states and 301 transitions. [2023-01-28 06:29:53,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 214 flow [2023-01-28 06:29:53,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 210 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 06:29:53,706 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 120 flow [2023-01-28 06:29:53,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-01-28 06:29:53,709 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2023-01-28 06:29:53,709 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 120 flow [2023-01-28 06:29:53,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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:29:53,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:53,709 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:53,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:29:53,710 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:29:53,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:53,710 INFO L85 PathProgramCache]: Analyzing trace with hash 777161033, now seen corresponding path program 1 times [2023-01-28 06:29:53,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:53,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790411962] [2023-01-28 06:29:53,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:53,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:29:53,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:53,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790411962] [2023-01-28 06:29:53,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790411962] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:29:53,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729415123] [2023-01-28 06:29:53,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:53,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:29:53,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:29:53,771 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:29:53,782 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:29:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:53,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 06:29:53,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:29:53,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:29:53,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:29:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:29:53,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729415123] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:29:53,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:29:53,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-01-28 06:29:53,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902608974] [2023-01-28 06:29:53,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:29:53,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:29:53,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:53,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:29:53,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:29:53,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 238 [2023-01-28 06:29:53,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 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:29:53,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:53,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 238 [2023-01-28 06:29:53,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:54,062 INFO L130 PetriNetUnfolder]: 171/353 cut-off events. [2023-01-28 06:29:54,063 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2023-01-28 06:29:54,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 353 events. 171/353 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1681 event pairs, 97 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 885. Up to 218 conditions per place. [2023-01-28 06:29:54,065 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 28 selfloop transitions, 3 changer transitions 2/48 dead transitions. [2023-01-28 06:29:54,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 248 flow [2023-01-28 06:29:54,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:29:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:29:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2023-01-28 06:29:54,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44432773109243695 [2023-01-28 06:29:54,067 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2023-01-28 06:29:54,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2023-01-28 06:29:54,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:54,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2023-01-28 06:29:54,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 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:29:54,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 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:29:54,071 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 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:29:54,071 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 120 flow. Second operand 4 states and 423 transitions. [2023-01-28 06:29:54,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 248 flow [2023-01-28 06:29:54,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:29:54,074 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 128 flow [2023-01-28 06:29:54,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-01-28 06:29:54,075 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2023-01-28 06:29:54,075 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 128 flow [2023-01-28 06:29:54,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 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:29:54,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:54,076 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:54,083 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:29:54,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:29:54,281 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:29:54,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:54,281 INFO L85 PathProgramCache]: Analyzing trace with hash 163582672, now seen corresponding path program 2 times [2023-01-28 06:29:54,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:54,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958884998] [2023-01-28 06:29:54,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:54,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 06:29:54,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:54,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958884998] [2023-01-28 06:29:54,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958884998] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:29:54,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210440853] [2023-01-28 06:29:54,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 06:29:54,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:29:54,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:29:54,361 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:29:54,387 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:29:54,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 06:29:54,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:29:54,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 06:29:54,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:29:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 06:29:54,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 06:29:54,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210440853] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:29:54,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 06:29:54,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-01-28 06:29:54,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353150398] [2023-01-28 06:29:54,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:29:54,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:29:54,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:54,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:29:54,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:29:54,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 238 [2023-01-28 06:29:54,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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:29:54,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:54,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 238 [2023-01-28 06:29:54,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:54,609 INFO L130 PetriNetUnfolder]: 319/581 cut-off events. [2023-01-28 06:29:54,610 INFO L131 PetriNetUnfolder]: For 341/341 co-relation queries the response was YES. [2023-01-28 06:29:54,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 581 events. 319/581 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2782 event pairs, 140 based on Foata normal form. 6/544 useless extension candidates. Maximal degree in co-relation 1595. Up to 323 conditions per place. [2023-01-28 06:29:54,612 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 28 selfloop transitions, 5 changer transitions 13/51 dead transitions. [2023-01-28 06:29:54,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 290 flow [2023-01-28 06:29:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:29:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:29:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2023-01-28 06:29:54,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37899159663865545 [2023-01-28 06:29:54,614 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 451 transitions. [2023-01-28 06:29:54,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 451 transitions. [2023-01-28 06:29:54,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:54,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 451 transitions. [2023-01-28 06:29:54,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 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:29:54,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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:29:54,617 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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:29:54,618 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 128 flow. Second operand 5 states and 451 transitions. [2023-01-28 06:29:54,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 290 flow [2023-01-28 06:29:54,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 274 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-28 06:29:54,619 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 139 flow [2023-01-28 06:29:54,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-01-28 06:29:54,620 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2023-01-28 06:29:54,620 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 139 flow [2023-01-28 06:29:54,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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:29:54,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:54,621 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:54,631 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:29:54,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-01-28 06:29:54,832 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:29:54,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:54,832 INFO L85 PathProgramCache]: Analyzing trace with hash -739491320, now seen corresponding path program 3 times [2023-01-28 06:29:54,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:54,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489942863] [2023-01-28 06:29:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:54,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:54,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 06:29:54,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:54,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489942863] [2023-01-28 06:29:54,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489942863] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:29:54,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440841263] [2023-01-28 06:29:54,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 06:29:54,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:29:54,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:29:54,888 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:29:54,891 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:29:54,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-01-28 06:29:54,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:29:54,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 06:29:54,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:29:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 06:29:54,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 06:29:54,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440841263] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:29:54,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 06:29:54,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-01-28 06:29:54,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517388412] [2023-01-28 06:29:54,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:29:54,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:29:54,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:54,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:29:54,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:29:54,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 238 [2023-01-28 06:29:54,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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:29:54,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:54,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 238 [2023-01-28 06:29:54,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:55,119 INFO L130 PetriNetUnfolder]: 312/576 cut-off events. [2023-01-28 06:29:55,119 INFO L131 PetriNetUnfolder]: For 422/422 co-relation queries the response was YES. [2023-01-28 06:29:55,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 576 events. 312/576 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2796 event pairs, 215 based on Foata normal form. 6/540 useless extension candidates. Maximal degree in co-relation 1603. Up to 466 conditions per place. [2023-01-28 06:29:55,122 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 31 selfloop transitions, 5 changer transitions 10/51 dead transitions. [2023-01-28 06:29:55,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 305 flow [2023-01-28 06:29:55,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:29:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:29:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2023-01-28 06:29:55,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3798319327731092 [2023-01-28 06:29:55,124 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 452 transitions. [2023-01-28 06:29:55,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 452 transitions. [2023-01-28 06:29:55,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:55,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 452 transitions. [2023-01-28 06:29:55,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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:29:55,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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:29:55,127 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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:29:55,128 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 139 flow. Second operand 5 states and 452 transitions. [2023-01-28 06:29:55,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 305 flow [2023-01-28 06:29:55,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 296 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 06:29:55,131 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 153 flow [2023-01-28 06:29:55,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2023-01-28 06:29:55,131 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2023-01-28 06:29:55,131 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 153 flow [2023-01-28 06:29:55,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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:29:55,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:55,132 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:55,140 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:29:55,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:29:55,341 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:29:55,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash -754301488, now seen corresponding path program 1 times [2023-01-28 06:29:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:55,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140207409] [2023-01-28 06:29:55,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:55,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 06:29:55,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:55,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140207409] [2023-01-28 06:29:55,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140207409] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:29:55,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622579834] [2023-01-28 06:29:55,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:55,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:29:55,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:29:55,401 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:29:55,424 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:29:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:55,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 06:29:55,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:29:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 06:29:55,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:29:55,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 06:29:55,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622579834] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:29:55,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:29:55,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-01-28 06:29:55,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307751953] [2023-01-28 06:29:55,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:29:55,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:29:55,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:55,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:29:55,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:29:55,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 238 [2023-01-28 06:29:55,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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:29:55,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:55,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 238 [2023-01-28 06:29:55,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:55,582 INFO L130 PetriNetUnfolder]: 147/331 cut-off events. [2023-01-28 06:29:55,582 INFO L131 PetriNetUnfolder]: For 208/214 co-relation queries the response was YES. [2023-01-28 06:29:55,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 331 events. 147/331 cut-off events. For 208/214 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1497 event pairs, 79 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 885. Up to 190 conditions per place. [2023-01-28 06:29:55,584 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 30 selfloop transitions, 3 changer transitions 2/49 dead transitions. [2023-01-28 06:29:55,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 287 flow [2023-01-28 06:29:55,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:29:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:29:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 421 transitions. [2023-01-28 06:29:55,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4422268907563025 [2023-01-28 06:29:55,586 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 421 transitions. [2023-01-28 06:29:55,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 421 transitions. [2023-01-28 06:29:55,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:55,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 421 transitions. [2023-01-28 06:29:55,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 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:29:55,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 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:29:55,589 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 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:29:55,589 INFO L175 Difference]: Start difference. First operand has 49 places, 32 transitions, 153 flow. Second operand 4 states and 421 transitions. [2023-01-28 06:29:55,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 287 flow [2023-01-28 06:29:55,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 264 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-01-28 06:29:55,592 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 146 flow [2023-01-28 06:29:55,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2023-01-28 06:29:55,593 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2023-01-28 06:29:55,593 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 146 flow [2023-01-28 06:29:55,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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:29:55,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:55,594 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:55,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-01-28 06:29:55,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:29:55,799 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:29:55,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash 484809876, now seen corresponding path program 2 times [2023-01-28 06:29:55,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:55,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519718571] [2023-01-28 06:29:55,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:55,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:55,852 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:29:55,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:55,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519718571] [2023-01-28 06:29:55,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519718571] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:29:55,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:29:55,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:29:55,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627550796] [2023-01-28 06:29:55,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:29:55,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:29:55,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:55,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:29:55,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:29:55,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 238 [2023-01-28 06:29:55,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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:29:55,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:55,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 238 [2023-01-28 06:29:55,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:55,947 INFO L130 PetriNetUnfolder]: 257/491 cut-off events. [2023-01-28 06:29:55,947 INFO L131 PetriNetUnfolder]: For 298/298 co-relation queries the response was YES. [2023-01-28 06:29:55,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 491 events. 257/491 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2326 event pairs, 113 based on Foata normal form. 6/459 useless extension candidates. Maximal degree in co-relation 1441. Up to 264 conditions per place. [2023-01-28 06:29:55,950 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 29 selfloop transitions, 5 changer transitions 12/51 dead transitions. [2023-01-28 06:29:55,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 51 transitions, 309 flow [2023-01-28 06:29:55,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:29:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:29:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2023-01-28 06:29:55,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3773109243697479 [2023-01-28 06:29:55,952 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 449 transitions. [2023-01-28 06:29:55,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 449 transitions. [2023-01-28 06:29:55,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:55,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 449 transitions. [2023-01-28 06:29:55,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 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:29:55,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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:29:55,955 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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:29:55,955 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 146 flow. Second operand 5 states and 449 transitions. [2023-01-28 06:29:55,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 51 transitions, 309 flow [2023-01-28 06:29:55,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 293 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-28 06:29:55,957 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 157 flow [2023-01-28 06:29:55,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-01-28 06:29:55,957 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2023-01-28 06:29:55,958 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 157 flow [2023-01-28 06:29:55,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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:29:55,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:55,958 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:55,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:29:55,958 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:29:55,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:55,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1621444078, now seen corresponding path program 3 times [2023-01-28 06:29:55,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:55,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928568314] [2023-01-28 06:29:55,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:55,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:56,006 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:29:56,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:56,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928568314] [2023-01-28 06:29:56,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928568314] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:29:56,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:29:56,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:29:56,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370356880] [2023-01-28 06:29:56,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:29:56,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:29:56,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:56,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:29:56,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:29:56,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 238 [2023-01-28 06:29:56,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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:29:56,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:56,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 238 [2023-01-28 06:29:56,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:56,110 INFO L130 PetriNetUnfolder]: 250/486 cut-off events. [2023-01-28 06:29:56,110 INFO L131 PetriNetUnfolder]: For 422/422 co-relation queries the response was YES. [2023-01-28 06:29:56,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 486 events. 250/486 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2311 event pairs, 166 based on Foata normal form. 6/454 useless extension candidates. Maximal degree in co-relation 1447. Up to 375 conditions per place. [2023-01-28 06:29:56,113 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 32 selfloop transitions, 5 changer transitions 10/52 dead transitions. [2023-01-28 06:29:56,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 330 flow [2023-01-28 06:29:56,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:29:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:29:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2023-01-28 06:29:56,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37815126050420167 [2023-01-28 06:29:56,115 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 450 transitions. [2023-01-28 06:29:56,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 450 transitions. [2023-01-28 06:29:56,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:56,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 450 transitions. [2023-01-28 06:29:56,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 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:29:56,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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:29:56,118 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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:29:56,118 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 157 flow. Second operand 5 states and 450 transitions. [2023-01-28 06:29:56,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 330 flow [2023-01-28 06:29:56,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 319 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 06:29:56,120 INFO L231 Difference]: Finished difference. Result has 55 places, 33 transitions, 170 flow [2023-01-28 06:29:56,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=33} [2023-01-28 06:29:56,121 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 26 predicate places. [2023-01-28 06:29:56,121 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 33 transitions, 170 flow [2023-01-28 06:29:56,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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:29:56,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:56,121 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:56,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:29:56,121 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:29:56,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:56,122 INFO L85 PathProgramCache]: Analyzing trace with hash 10729971, now seen corresponding path program 1 times [2023-01-28 06:29:56,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:56,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346962060] [2023-01-28 06:29:56,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:56,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:56,190 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:29:56,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:56,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346962060] [2023-01-28 06:29:56,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346962060] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:29:56,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:29:56,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:29:56,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245237467] [2023-01-28 06:29:56,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:29:56,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:29:56,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:56,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:29:56,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:29:56,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2023-01-28 06:29:56,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 33 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:29:56,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:56,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2023-01-28 06:29:56,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:56,224 INFO L130 PetriNetUnfolder]: 83/175 cut-off events. [2023-01-28 06:29:56,224 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-01-28 06:29:56,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 175 events. 83/175 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 672 event pairs, 39 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 489. Up to 100 conditions per place. [2023-01-28 06:29:56,225 INFO L137 encePairwiseOnDemand]: 236/238 looper letters, 0 selfloop transitions, 0 changer transitions 29/29 dead transitions. [2023-01-28 06:29:56,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 168 flow [2023-01-28 06:29:56,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:29:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:29:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-01-28 06:29:56,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2023-01-28 06:29:56,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-01-28 06:29:56,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-01-28 06:29:56,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:56,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-01-28 06:29:56,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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:29:56,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 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:29:56,229 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 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:29:56,229 INFO L175 Difference]: Start difference. First operand has 55 places, 33 transitions, 170 flow. Second operand 3 states and 336 transitions. [2023-01-28 06:29:56,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 168 flow [2023-01-28 06:29:56,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 163 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-01-28 06:29:56,230 INFO L231 Difference]: Finished difference. Result has 34 places, 0 transitions, 0 flow [2023-01-28 06:29:56,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=34, PETRI_TRANSITIONS=0} [2023-01-28 06:29:56,231 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2023-01-28 06:29:56,231 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 0 transitions, 0 flow [2023-01-28 06:29:56,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:29:56,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-01-28 06:29:56,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-01-28 06:29:56,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-01-28 06:29:56,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:29:56,232 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:56,232 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-01-28 06:29:56,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 123 transitions, 258 flow [2023-01-28 06:29:56,242 INFO L130 PetriNetUnfolder]: 17/145 cut-off events. [2023-01-28 06:29:56,242 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:29:56,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 145 events. 17/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 252 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 100. Up to 6 conditions per place. [2023-01-28 06:29:56,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 123 transitions, 258 flow [2023-01-28 06:29:56,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 123 transitions, 258 flow [2023-01-28 06:29:56,244 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:29:56,244 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 123 transitions, 258 flow [2023-01-28 06:29:56,244 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 123 transitions, 258 flow [2023-01-28 06:29:56,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 123 transitions, 258 flow [2023-01-28 06:29:56,252 INFO L130 PetriNetUnfolder]: 17/145 cut-off events. [2023-01-28 06:29:56,253 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:29:56,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 145 events. 17/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 252 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 100. Up to 6 conditions per place. [2023-01-28 06:29:56,256 INFO L119 LiptonReduction]: Number of co-enabled transitions 6248 [2023-01-28 06:29:58,468 INFO L134 LiptonReduction]: Checked pairs total: 8937 [2023-01-28 06:29:58,468 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-01-28 06:29:58,470 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-01-28 06:29:58,470 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;@6ccd1f1f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:29:58,470 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-28 06:29:58,472 INFO L130 PetriNetUnfolder]: 8/37 cut-off events. [2023-01-28 06:29:58,473 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:29:58,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:58,473 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-01-28 06:29:58,473 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 06:29:58,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:58,473 INFO L85 PathProgramCache]: Analyzing trace with hash 225006693, now seen corresponding path program 1 times [2023-01-28 06:29:58,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:58,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188210215] [2023-01-28 06:29:58,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:58,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:29:58,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:29:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:29:58,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:29:58,487 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:29:58,488 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-28 06:29:58,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 06:29:58,488 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-01-28 06:29:58,488 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-01-28 06:29:58,488 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-28 06:29:58,488 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-01-28 06:29:58,506 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:29:58,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 168 transitions, 357 flow [2023-01-28 06:29:58,523 INFO L130 PetriNetUnfolder]: 25/202 cut-off events. [2023-01-28 06:29:58,524 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-01-28 06:29:58,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 202 events. 25/202 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 484 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 149. Up to 8 conditions per place. [2023-01-28 06:29:58,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 168 transitions, 357 flow [2023-01-28 06:29:58,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 168 transitions, 357 flow [2023-01-28 06:29:58,526 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:29:58,526 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 168 transitions, 357 flow [2023-01-28 06:29:58,526 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 168 transitions, 357 flow [2023-01-28 06:29:58,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 168 transitions, 357 flow [2023-01-28 06:29:58,542 INFO L130 PetriNetUnfolder]: 25/202 cut-off events. [2023-01-28 06:29:58,542 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-01-28 06:29:58,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 202 events. 25/202 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 484 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 149. Up to 8 conditions per place. [2023-01-28 06:29:58,549 INFO L119 LiptonReduction]: Number of co-enabled transitions 15312 [2023-01-28 06:30:01,150 INFO L134 LiptonReduction]: Checked pairs total: 23024 [2023-01-28 06:30:01,150 INFO L136 LiptonReduction]: Total number of compositions: 161 [2023-01-28 06:30:01,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:30:01,152 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;@6ccd1f1f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:30:01,152 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 06:30:01,153 INFO L130 PetriNetUnfolder]: 1/10 cut-off events. [2023-01-28 06:30:01,153 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:30:01,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:01,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-28 06:30:01,153 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:30:01,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:01,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2142436163, now seen corresponding path program 1 times [2023-01-28 06:30:01,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:01,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749171816] [2023-01-28 06:30:01,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:01,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:30:01,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:01,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749171816] [2023-01-28 06:30:01,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749171816] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:01,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:01,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:30:01,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116438893] [2023-01-28 06:30:01,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:01,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-28 06:30:01,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:01,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-28 06:30:01,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-28 06:30:01,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 329 [2023-01-28 06:30:01,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 45 transitions, 111 flow. Second operand has 2 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 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:30:01,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:01,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 329 [2023-01-28 06:30:01,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:01,276 INFO L130 PetriNetUnfolder]: 798/1428 cut-off events. [2023-01-28 06:30:01,276 INFO L131 PetriNetUnfolder]: For 211/211 co-relation queries the response was YES. [2023-01-28 06:30:01,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2658 conditions, 1428 events. 798/1428 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7709 event pairs, 564 based on Foata normal form. 166/1329 useless extension candidates. Maximal degree in co-relation 405. Up to 1049 conditions per place. [2023-01-28 06:30:01,286 INFO L137 encePairwiseOnDemand]: 322/329 looper letters, 20 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2023-01-28 06:30:01,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 137 flow [2023-01-28 06:30:01,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-28 06:30:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-28 06:30:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 317 transitions. [2023-01-28 06:30:01,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817629179331307 [2023-01-28 06:30:01,288 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 317 transitions. [2023-01-28 06:30:01,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 317 transitions. [2023-01-28 06:30:01,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:01,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 317 transitions. [2023-01-28 06:30:01,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 158.5) internal successors, (317), 2 states have internal predecessors, (317), 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:30:01,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 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:30:01,290 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 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:30:01,290 INFO L175 Difference]: Start difference. First operand has 40 places, 45 transitions, 111 flow. Second operand 2 states and 317 transitions. [2023-01-28 06:30:01,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 137 flow [2023-01-28 06:30:01,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 131 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-01-28 06:30:01,292 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 91 flow [2023-01-28 06:30:01,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=91, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2023-01-28 06:30:01,292 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-01-28 06:30:01,292 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 91 flow [2023-01-28 06:30:01,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 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:30:01,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:01,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:01,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 06:30:01,293 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:30:01,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:01,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2034945852, now seen corresponding path program 1 times [2023-01-28 06:30:01,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:01,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711754442] [2023-01-28 06:30:01,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:01,316 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:30:01,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:01,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711754442] [2023-01-28 06:30:01,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711754442] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:01,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:01,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:30:01,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43882628] [2023-01-28 06:30:01,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:01,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:30:01,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:01,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:30:01,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:30:01,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 329 [2023-01-28 06:30:01,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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:30:01,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:01,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 329 [2023-01-28 06:30:01,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:01,459 INFO L130 PetriNetUnfolder]: 953/1621 cut-off events. [2023-01-28 06:30:01,459 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2023-01-28 06:30:01,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3014 conditions, 1621 events. 953/1621 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8780 event pairs, 464 based on Foata normal form. 0/1324 useless extension candidates. Maximal degree in co-relation 3008. Up to 1049 conditions per place. [2023-01-28 06:30:01,473 INFO L137 encePairwiseOnDemand]: 326/329 looper letters, 32 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-01-28 06:30:01,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 197 flow [2023-01-28 06:30:01,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:30:01,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:30:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-01-28 06:30:01,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44883485309017224 [2023-01-28 06:30:01,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-01-28 06:30:01,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-01-28 06:30:01,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:01,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-01-28 06:30:01,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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:30:01,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 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:30:01,479 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 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:30:01,479 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 91 flow. Second operand 3 states and 443 transitions. [2023-01-28 06:30:01,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 197 flow [2023-01-28 06:30:01,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 197 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:30:01,482 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 103 flow [2023-01-28 06:30:01,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-01-28 06:30:01,483 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-01-28 06:30:01,483 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 103 flow [2023-01-28 06:30:01,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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:30:01,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:01,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:01,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-28 06:30:01,483 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:30:01,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:01,484 INFO L85 PathProgramCache]: Analyzing trace with hash 841924197, now seen corresponding path program 1 times [2023-01-28 06:30:01,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:01,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250104917] [2023-01-28 06:30:01,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:01,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:30:01,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:01,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250104917] [2023-01-28 06:30:01,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250104917] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:01,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:01,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:30:01,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535507429] [2023-01-28 06:30:01,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:01,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:30:01,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:01,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:30:01,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:30:01,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 329 [2023-01-28 06:30:01,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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:30:01,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:01,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 329 [2023-01-28 06:30:01,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:01,922 INFO L130 PetriNetUnfolder]: 4163/6123 cut-off events. [2023-01-28 06:30:01,922 INFO L131 PetriNetUnfolder]: For 978/978 co-relation queries the response was YES. [2023-01-28 06:30:01,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12904 conditions, 6123 events. 4163/6123 cut-off events. For 978/978 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 34674 event pairs, 2077 based on Foata normal form. 0/4603 useless extension candidates. Maximal degree in co-relation 12896. Up to 4000 conditions per place. [2023-01-28 06:30:01,962 INFO L137 encePairwiseOnDemand]: 323/329 looper letters, 51 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2023-01-28 06:30:01,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 271 flow [2023-01-28 06:30:01,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:30:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:30:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-01-28 06:30:01,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275582573454914 [2023-01-28 06:30:01,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-01-28 06:30:01,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-01-28 06:30:01,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:01,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-01-28 06:30:01,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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:30:01,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 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:30:01,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 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:30:01,968 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 103 flow. Second operand 3 states and 422 transitions. [2023-01-28 06:30:01,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 271 flow [2023-01-28 06:30:01,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 267 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 06:30:01,969 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 133 flow [2023-01-28 06:30:01,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-01-28 06:30:01,970 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-01-28 06:30:01,970 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 133 flow [2023-01-28 06:30:01,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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:30:01,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:01,970 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:01,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-28 06:30:01,970 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:30:01,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:01,971 INFO L85 PathProgramCache]: Analyzing trace with hash 834108639, now seen corresponding path program 1 times [2023-01-28 06:30:01,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:01,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296409095] [2023-01-28 06:30:01,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:01,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:02,009 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:30:02,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:02,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296409095] [2023-01-28 06:30:02,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296409095] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:02,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:02,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:30:02,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720725641] [2023-01-28 06:30:02,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:02,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:30:02,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:02,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:30:02,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:30:02,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 329 [2023-01-28 06:30:02,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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:30:02,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:02,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 329 [2023-01-28 06:30:02,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:02,222 INFO L130 PetriNetUnfolder]: 1460/2516 cut-off events. [2023-01-28 06:30:02,223 INFO L131 PetriNetUnfolder]: For 558/597 co-relation queries the response was YES. [2023-01-28 06:30:02,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5253 conditions, 2516 events. 1460/2516 cut-off events. For 558/597 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15102 event pairs, 880 based on Foata normal form. 0/2085 useless extension candidates. Maximal degree in co-relation 5244. Up to 1693 conditions per place. [2023-01-28 06:30:02,240 INFO L137 encePairwiseOnDemand]: 326/329 looper letters, 35 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-01-28 06:30:02,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 254 flow [2023-01-28 06:30:02,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:30:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:30:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2023-01-28 06:30:02,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44782168186423504 [2023-01-28 06:30:02,242 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2023-01-28 06:30:02,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2023-01-28 06:30:02,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:02,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2023-01-28 06:30:02,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 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:30:02,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 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:30:02,245 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 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:30:02,245 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 133 flow. Second operand 3 states and 442 transitions. [2023-01-28 06:30:02,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 254 flow [2023-01-28 06:30:02,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:30:02,247 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 135 flow [2023-01-28 06:30:02,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2023-01-28 06:30:02,248 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-01-28 06:30:02,248 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 135 flow [2023-01-28 06:30:02,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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:30:02,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:02,248 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:02,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-01-28 06:30:02,248 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:30:02,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:02,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1719529064, now seen corresponding path program 1 times [2023-01-28 06:30:02,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:02,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961544572] [2023-01-28 06:30:02,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:02,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 06:30:02,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:02,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961544572] [2023-01-28 06:30:02,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961544572] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:02,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:02,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:30:02,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348269617] [2023-01-28 06:30:02,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:02,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:30:02,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:02,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:30:02,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:30:02,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 329 [2023-01-28 06:30:02,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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:30:02,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:02,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 329 [2023-01-28 06:30:02,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:02,826 INFO L130 PetriNetUnfolder]: 5095/7671 cut-off events. [2023-01-28 06:30:02,827 INFO L131 PetriNetUnfolder]: For 2297/2297 co-relation queries the response was YES. [2023-01-28 06:30:02,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17740 conditions, 7671 events. 5095/7671 cut-off events. For 2297/2297 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 46409 event pairs, 2469 based on Foata normal form. 0/6201 useless extension candidates. Maximal degree in co-relation 17730. Up to 4706 conditions per place. [2023-01-28 06:30:02,869 INFO L137 encePairwiseOnDemand]: 323/329 looper letters, 55 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2023-01-28 06:30:02,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 334 flow [2023-01-28 06:30:02,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:30:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:30:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-01-28 06:30:02,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265450861195542 [2023-01-28 06:30:02,871 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-01-28 06:30:02,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-01-28 06:30:02,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:02,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-01-28 06:30:02,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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:30:02,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 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:30:02,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 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:30:02,874 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 135 flow. Second operand 3 states and 421 transitions. [2023-01-28 06:30:02,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 334 flow [2023-01-28 06:30:02,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 330 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 06:30:02,877 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 183 flow [2023-01-28 06:30:02,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2023-01-28 06:30:02,877 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2023-01-28 06:30:02,878 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 183 flow [2023-01-28 06:30:02,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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:30:02,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:02,879 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:02,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-01-28 06:30:02,879 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:30:02,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:02,880 INFO L85 PathProgramCache]: Analyzing trace with hash 454990788, now seen corresponding path program 1 times [2023-01-28 06:30:02,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:02,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304892777] [2023-01-28 06:30:02,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:02,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:02,909 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:30:02,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:02,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304892777] [2023-01-28 06:30:02,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304892777] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:02,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:02,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:30:02,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608764530] [2023-01-28 06:30:02,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:02,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:30:02,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:02,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:30:02,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:30:02,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 329 [2023-01-28 06:30:02,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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:30:02,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:02,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 329 [2023-01-28 06:30:02,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:03,282 INFO L130 PetriNetUnfolder]: 2167/3900 cut-off events. [2023-01-28 06:30:03,283 INFO L131 PetriNetUnfolder]: For 1435/1596 co-relation queries the response was YES. [2023-01-28 06:30:03,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8734 conditions, 3900 events. 2167/3900 cut-off events. For 1435/1596 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 26384 event pairs, 1337 based on Foata normal form. 9/3403 useless extension candidates. Maximal degree in co-relation 8723. Up to 2588 conditions per place. [2023-01-28 06:30:03,304 INFO L137 encePairwiseOnDemand]: 326/329 looper letters, 38 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-01-28 06:30:03,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 317 flow [2023-01-28 06:30:03,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:30:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:30:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-01-28 06:30:03,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2023-01-28 06:30:03,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-01-28 06:30:03,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-01-28 06:30:03,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:03,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-01-28 06:30:03,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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:30:03,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 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:30:03,309 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 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:30:03,310 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 183 flow. Second operand 3 states and 441 transitions. [2023-01-28 06:30:03,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 317 flow [2023-01-28 06:30:03,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:30:03,313 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 181 flow [2023-01-28 06:30:03,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-01-28 06:30:03,314 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-01-28 06:30:03,314 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 181 flow [2023-01-28 06:30:03,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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:30:03,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:03,315 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:03,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-01-28 06:30:03,315 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:30:03,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:03,315 INFO L85 PathProgramCache]: Analyzing trace with hash -421046865, now seen corresponding path program 1 times [2023-01-28 06:30:03,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:03,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580514427] [2023-01-28 06:30:03,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:03,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-28 06:30:03,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:03,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580514427] [2023-01-28 06:30:03,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580514427] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:03,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:03,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:30:03,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219531793] [2023-01-28 06:30:03,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:03,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:30:03,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:03,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:30:03,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:30:03,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 329 [2023-01-28 06:30:03,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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:30:03,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:03,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 329 [2023-01-28 06:30:03,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:03,985 INFO L130 PetriNetUnfolder]: 5809/8699 cut-off events. [2023-01-28 06:30:03,985 INFO L131 PetriNetUnfolder]: For 3687/3687 co-relation queries the response was YES. [2023-01-28 06:30:04,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21986 conditions, 8699 events. 5809/8699 cut-off events. For 3687/3687 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 52783 event pairs, 2793 based on Foata normal form. 0/7515 useless extension candidates. Maximal degree in co-relation 21974. Up to 5182 conditions per place. [2023-01-28 06:30:04,031 INFO L137 encePairwiseOnDemand]: 323/329 looper letters, 59 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2023-01-28 06:30:04,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 75 transitions, 417 flow [2023-01-28 06:30:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:30:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:30:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-01-28 06:30:04,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2023-01-28 06:30:04,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-01-28 06:30:04,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-01-28 06:30:04,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:04,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-01-28 06:30:04,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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:30:04,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 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:30:04,036 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 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:30:04,037 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 181 flow. Second operand 3 states and 420 transitions. [2023-01-28 06:30:04,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 75 transitions, 417 flow [2023-01-28 06:30:04,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 413 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 06:30:04,044 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 255 flow [2023-01-28 06:30:04,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2023-01-28 06:30:04,044 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2023-01-28 06:30:04,044 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 255 flow [2023-01-28 06:30:04,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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:30:04,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:04,045 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:04,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-01-28 06:30:04,045 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:30:04,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:04,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1012484161, now seen corresponding path program 1 times [2023-01-28 06:30:04,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:04,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969785088] [2023-01-28 06:30:04,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:04,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:30:04,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:04,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969785088] [2023-01-28 06:30:04,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969785088] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:30:04,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704861144] [2023-01-28 06:30:04,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:04,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:30:04,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:30:04,086 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:30:04,094 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:30:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:04,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 06:30:04,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:30:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:30:04,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:30:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:30:04,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704861144] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:30:04,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:30:04,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-01-28 06:30:04,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058790321] [2023-01-28 06:30:04,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:30:04,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:30:04,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:04,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:30:04,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:30:04,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 329 [2023-01-28 06:30:04,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 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:30:04,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:04,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 329 [2023-01-28 06:30:04,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:04,605 INFO L130 PetriNetUnfolder]: 2937/4831 cut-off events. [2023-01-28 06:30:04,605 INFO L131 PetriNetUnfolder]: For 3272/3601 co-relation queries the response was YES. [2023-01-28 06:30:04,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12744 conditions, 4831 events. 2937/4831 cut-off events. For 3272/3601 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 31622 event pairs, 1309 based on Foata normal form. 16/4332 useless extension candidates. Maximal degree in co-relation 12731. Up to 3198 conditions per place. [2023-01-28 06:30:04,639 INFO L137 encePairwiseOnDemand]: 326/329 looper letters, 58 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2023-01-28 06:30:04,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 513 flow [2023-01-28 06:30:04,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:30:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:30:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 593 transitions. [2023-01-28 06:30:04,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4506079027355623 [2023-01-28 06:30:04,642 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 593 transitions. [2023-01-28 06:30:04,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 593 transitions. [2023-01-28 06:30:04,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:04,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 593 transitions. [2023-01-28 06:30:04,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 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:30:04,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 329.0) internal successors, (1645), 5 states have internal predecessors, (1645), 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:30:04,658 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 329.0) internal successors, (1645), 5 states have internal predecessors, (1645), 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:30:04,658 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 255 flow. Second operand 4 states and 593 transitions. [2023-01-28 06:30:04,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 513 flow [2023-01-28 06:30:04,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 88 transitions, 489 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:30:04,676 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 251 flow [2023-01-28 06:30:04,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2023-01-28 06:30:04,676 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2023-01-28 06:30:04,676 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 251 flow [2023-01-28 06:30:04,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 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:30:04,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:04,677 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:04,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-01-28 06:30:04,882 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,SelfDestructingSolverStorable22 [2023-01-28 06:30:04,882 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:30:04,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:04,882 INFO L85 PathProgramCache]: Analyzing trace with hash -976937712, now seen corresponding path program 2 times [2023-01-28 06:30:04,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:04,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849155066] [2023-01-28 06:30:04,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:04,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 06:30:04,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:04,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849155066] [2023-01-28 06:30:04,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849155066] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:30:04,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073033443] [2023-01-28 06:30:04,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 06:30:04,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:30:04,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:30:04,939 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:30:04,941 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:30:05,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 06:30:05,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:30:05,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 06:30:05,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:30:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 06:30:05,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 06:30:05,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073033443] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:05,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 06:30:05,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-01-28 06:30:05,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887647334] [2023-01-28 06:30:05,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:05,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:30:05,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:05,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:30:05,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:30:05,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-01-28 06:30:05,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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:30:05,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:05,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-01-28 06:30:05,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:05,886 INFO L130 PetriNetUnfolder]: 7252/11016 cut-off events. [2023-01-28 06:30:05,886 INFO L131 PetriNetUnfolder]: For 7552/7552 co-relation queries the response was YES. [2023-01-28 06:30:05,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30242 conditions, 11016 events. 7252/11016 cut-off events. For 7552/7552 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 72583 event pairs, 3181 based on Foata normal form. 0/9843 useless extension candidates. Maximal degree in co-relation 30228. Up to 5612 conditions per place. [2023-01-28 06:30:05,944 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 98 selfloop transitions, 20 changer transitions 2/126 dead transitions. [2023-01-28 06:30:05,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 126 transitions, 767 flow [2023-01-28 06:30:05,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:30:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:30:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 788 transitions. [2023-01-28 06:30:05,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39918946301925023 [2023-01-28 06:30:05,947 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 788 transitions. [2023-01-28 06:30:05,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 788 transitions. [2023-01-28 06:30:05,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:05,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 788 transitions. [2023-01-28 06:30:05,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 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:30:05,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:05,951 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:05,951 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 251 flow. Second operand 6 states and 788 transitions. [2023-01-28 06:30:05,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 126 transitions, 767 flow [2023-01-28 06:30:05,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 126 transitions, 759 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 06:30:05,959 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 395 flow [2023-01-28 06:30:05,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=395, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-01-28 06:30:05,960 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 23 predicate places. [2023-01-28 06:30:05,960 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 395 flow [2023-01-28 06:30:05,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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:30:05,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:05,960 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:05,971 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:30:06,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:30:06,165 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:30:06,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:06,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1283723568, now seen corresponding path program 3 times [2023-01-28 06:30:06,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:06,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183008547] [2023-01-28 06:30:06,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:06,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:06,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 06:30:06,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:06,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183008547] [2023-01-28 06:30:06,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183008547] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:30:06,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684764704] [2023-01-28 06:30:06,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 06:30:06,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:30:06,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:30:06,285 INFO L229 MonitoredProcess]: Starting monitored process 8 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:30:06,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-28 06:30:06,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-01-28 06:30:06,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:30:06,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 06:30:06,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:30:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 06:30:06,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 06:30:06,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684764704] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:06,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 06:30:06,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-01-28 06:30:06,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867082544] [2023-01-28 06:30:06,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:06,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:30:06,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:06,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:30:06,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:30:06,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-01-28 06:30:06,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 395 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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:30:06,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:06,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-01-28 06:30:06,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:07,288 INFO L130 PetriNetUnfolder]: 8460/13156 cut-off events. [2023-01-28 06:30:07,288 INFO L131 PetriNetUnfolder]: For 15407/15407 co-relation queries the response was YES. [2023-01-28 06:30:07,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38164 conditions, 13156 events. 8460/13156 cut-off events. For 15407/15407 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 92065 event pairs, 5228 based on Foata normal form. 84/12302 useless extension candidates. Maximal degree in co-relation 38146. Up to 9521 conditions per place. [2023-01-28 06:30:07,362 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 110 selfloop transitions, 32 changer transitions 4/152 dead transitions. [2023-01-28 06:30:07,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 152 transitions, 1168 flow [2023-01-28 06:30:07,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:30:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:30:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 787 transitions. [2023-01-28 06:30:07,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39868287740628167 [2023-01-28 06:30:07,365 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 787 transitions. [2023-01-28 06:30:07,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 787 transitions. [2023-01-28 06:30:07,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:07,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 787 transitions. [2023-01-28 06:30:07,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 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:30:07,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:07,370 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:07,370 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 395 flow. Second operand 6 states and 787 transitions. [2023-01-28 06:30:07,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 152 transitions, 1168 flow [2023-01-28 06:30:07,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 152 transitions, 1168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:30:07,459 INFO L231 Difference]: Finished difference. Result has 72 places, 91 transitions, 804 flow [2023-01-28 06:30:07,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=804, PETRI_PLACES=72, PETRI_TRANSITIONS=91} [2023-01-28 06:30:07,459 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2023-01-28 06:30:07,459 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 91 transitions, 804 flow [2023-01-28 06:30:07,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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:30:07,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:07,460 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:07,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-01-28 06:30:07,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:30:07,664 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:30:07,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:07,665 INFO L85 PathProgramCache]: Analyzing trace with hash -819042120, now seen corresponding path program 1 times [2023-01-28 06:30:07,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:07,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699940794] [2023-01-28 06:30:07,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:07,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 06:30:07,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:07,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699940794] [2023-01-28 06:30:07,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699940794] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:30:07,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172026162] [2023-01-28 06:30:07,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:07,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:30:07,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:30:07,722 INFO L229 MonitoredProcess]: Starting monitored process 9 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:30:07,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-28 06:30:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:07,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 06:30:07,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:30:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 06:30:07,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:30:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 06:30:07,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172026162] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:30:07,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:30:07,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-01-28 06:30:07,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31151623] [2023-01-28 06:30:07,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:30:07,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:30:07,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:07,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:30:07,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:30:07,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 329 [2023-01-28 06:30:07,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 91 transitions, 804 flow. Second operand has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 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:30:07,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:07,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 329 [2023-01-28 06:30:07,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:08,396 INFO L130 PetriNetUnfolder]: 4652/8054 cut-off events. [2023-01-28 06:30:08,396 INFO L131 PetriNetUnfolder]: For 14790/16274 co-relation queries the response was YES. [2023-01-28 06:30:08,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24202 conditions, 8054 events. 4652/8054 cut-off events. For 14790/16274 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 61485 event pairs, 2922 based on Foata normal form. 146/7454 useless extension candidates. Maximal degree in co-relation 24179. Up to 5679 conditions per place. [2023-01-28 06:30:08,441 INFO L137 encePairwiseOnDemand]: 326/329 looper letters, 65 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2023-01-28 06:30:08,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 126 transitions, 1088 flow [2023-01-28 06:30:08,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:30:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:30:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 591 transitions. [2023-01-28 06:30:08,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4490881458966565 [2023-01-28 06:30:08,443 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 591 transitions. [2023-01-28 06:30:08,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 591 transitions. [2023-01-28 06:30:08,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:08,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 591 transitions. [2023-01-28 06:30:08,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 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:30:08,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 329.0) internal successors, (1645), 5 states have internal predecessors, (1645), 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:30:08,447 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 329.0) internal successors, (1645), 5 states have internal predecessors, (1645), 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:30:08,447 INFO L175 Difference]: Start difference. First operand has 72 places, 91 transitions, 804 flow. Second operand 4 states and 591 transitions. [2023-01-28 06:30:08,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 126 transitions, 1088 flow [2023-01-28 06:30:08,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 126 transitions, 1068 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-01-28 06:30:08,538 INFO L231 Difference]: Finished difference. Result has 76 places, 92 transitions, 800 flow [2023-01-28 06:30:08,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=800, PETRI_PLACES=76, PETRI_TRANSITIONS=92} [2023-01-28 06:30:08,538 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 36 predicate places. [2023-01-28 06:30:08,538 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 92 transitions, 800 flow [2023-01-28 06:30:08,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 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:30:08,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:08,539 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:08,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-28 06:30:08,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-01-28 06:30:08,743 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:30:08,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:08,744 INFO L85 PathProgramCache]: Analyzing trace with hash -316172729, now seen corresponding path program 2 times [2023-01-28 06:30:08,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:08,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545098364] [2023-01-28 06:30:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:08,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:08,803 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:30:08,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:08,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545098364] [2023-01-28 06:30:08,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545098364] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:08,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:08,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:30:08,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641336351] [2023-01-28 06:30:08,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:08,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:30:08,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:08,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:30:08,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:30:08,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-01-28 06:30:08,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 92 transitions, 800 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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:30:08,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:08,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-01-28 06:30:08,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:10,028 INFO L130 PetriNetUnfolder]: 9916/15548 cut-off events. [2023-01-28 06:30:10,028 INFO L131 PetriNetUnfolder]: For 33363/33363 co-relation queries the response was YES. [2023-01-28 06:30:10,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50105 conditions, 15548 events. 9916/15548 cut-off events. For 33363/33363 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 113354 event pairs, 4358 based on Foata normal form. 78/14574 useless extension candidates. Maximal degree in co-relation 50080. Up to 7461 conditions per place. [2023-01-28 06:30:10,114 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 117 selfloop transitions, 40 changer transitions 3/166 dead transitions. [2023-01-28 06:30:10,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 166 transitions, 1508 flow [2023-01-28 06:30:10,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:30:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:30:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 787 transitions. [2023-01-28 06:30:10,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39868287740628167 [2023-01-28 06:30:10,117 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 787 transitions. [2023-01-28 06:30:10,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 787 transitions. [2023-01-28 06:30:10,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:10,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 787 transitions. [2023-01-28 06:30:10,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 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:30:10,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:10,122 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:10,122 INFO L175 Difference]: Start difference. First operand has 76 places, 92 transitions, 800 flow. Second operand 6 states and 787 transitions. [2023-01-28 06:30:10,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 166 transitions, 1508 flow [2023-01-28 06:30:10,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 166 transitions, 1500 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 06:30:10,394 INFO L231 Difference]: Finished difference. Result has 83 places, 104 transitions, 1075 flow [2023-01-28 06:30:10,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1075, PETRI_PLACES=83, PETRI_TRANSITIONS=104} [2023-01-28 06:30:10,394 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2023-01-28 06:30:10,394 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 104 transitions, 1075 flow [2023-01-28 06:30:10,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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:30:10,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:10,395 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:10,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-01-28 06:30:10,395 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:30:10,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:10,395 INFO L85 PathProgramCache]: Analyzing trace with hash 195544307, now seen corresponding path program 3 times [2023-01-28 06:30:10,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:10,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001390945] [2023-01-28 06:30:10,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:10,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:10,444 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:30:10,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:10,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001390945] [2023-01-28 06:30:10,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001390945] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:10,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:10,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:30:10,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951106620] [2023-01-28 06:30:10,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:10,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:30:10,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:10,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:30:10,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:30:10,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-01-28 06:30:10,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 104 transitions, 1075 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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:30:10,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:10,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-01-28 06:30:10,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:12,134 INFO L130 PetriNetUnfolder]: 11112/17638 cut-off events. [2023-01-28 06:30:12,134 INFO L131 PetriNetUnfolder]: For 56005/56005 co-relation queries the response was YES. [2023-01-28 06:30:12,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59731 conditions, 17638 events. 11112/17638 cut-off events. For 56005/56005 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 134004 event pairs, 7374 based on Foata normal form. 84/16589 useless extension candidates. Maximal degree in co-relation 59702. Up to 13601 conditions per place. [2023-01-28 06:30:12,216 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 146 selfloop transitions, 40 changer transitions 4/196 dead transitions. [2023-01-28 06:30:12,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 196 transitions, 2152 flow [2023-01-28 06:30:12,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:30:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:30:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 788 transitions. [2023-01-28 06:30:12,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39918946301925023 [2023-01-28 06:30:12,219 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 788 transitions. [2023-01-28 06:30:12,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 788 transitions. [2023-01-28 06:30:12,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:12,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 788 transitions. [2023-01-28 06:30:12,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 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:30:12,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:12,223 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:12,223 INFO L175 Difference]: Start difference. First operand has 83 places, 104 transitions, 1075 flow. Second operand 6 states and 788 transitions. [2023-01-28 06:30:12,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 196 transitions, 2152 flow [2023-01-28 06:30:12,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 196 transitions, 2128 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-01-28 06:30:12,838 INFO L231 Difference]: Finished difference. Result has 92 places, 134 transitions, 1653 flow [2023-01-28 06:30:12,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1653, PETRI_PLACES=92, PETRI_TRANSITIONS=134} [2023-01-28 06:30:12,838 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 52 predicate places. [2023-01-28 06:30:12,838 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 134 transitions, 1653 flow [2023-01-28 06:30:12,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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:30:12,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:12,839 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:12,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-01-28 06:30:12,839 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:30:12,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:12,839 INFO L85 PathProgramCache]: Analyzing trace with hash 824640343, now seen corresponding path program 1 times [2023-01-28 06:30:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:12,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926102539] [2023-01-28 06:30:12,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:12,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:12,896 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:30:12,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:12,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926102539] [2023-01-28 06:30:12,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926102539] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:12,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:12,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:30:12,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383220796] [2023-01-28 06:30:12,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:12,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:30:12,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:12,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:30:12,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:30:12,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 329 [2023-01-28 06:30:12,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 134 transitions, 1653 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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:30:12,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:12,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 329 [2023-01-28 06:30:12,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:13,342 INFO L130 PetriNetUnfolder]: 2859/5413 cut-off events. [2023-01-28 06:30:13,343 INFO L131 PetriNetUnfolder]: For 17980/18226 co-relation queries the response was YES. [2023-01-28 06:30:13,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18603 conditions, 5413 events. 2859/5413 cut-off events. For 17980/18226 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 40247 event pairs, 1411 based on Foata normal form. 12/5100 useless extension candidates. Maximal degree in co-relation 18569. Up to 3092 conditions per place. [2023-01-28 06:30:13,374 INFO L137 encePairwiseOnDemand]: 323/329 looper letters, 66 selfloop transitions, 6 changer transitions 0/121 dead transitions. [2023-01-28 06:30:13,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 121 transitions, 1315 flow [2023-01-28 06:30:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:30:13,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:30:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-01-28 06:30:13,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47315096251266464 [2023-01-28 06:30:13,376 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-01-28 06:30:13,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-01-28 06:30:13,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:13,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-01-28 06:30:13,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:30:13,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 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:30:13,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 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:30:13,379 INFO L175 Difference]: Start difference. First operand has 92 places, 134 transitions, 1653 flow. Second operand 3 states and 467 transitions. [2023-01-28 06:30:13,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 121 transitions, 1315 flow [2023-01-28 06:30:13,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 121 transitions, 1240 flow, removed 31 selfloop flow, removed 1 redundant places. [2023-01-28 06:30:13,528 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 870 flow [2023-01-28 06:30:13,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2023-01-28 06:30:13,529 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 53 predicate places. [2023-01-28 06:30:13,529 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 870 flow [2023-01-28 06:30:13,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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:30:13,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:13,529 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:13,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-01-28 06:30:13,529 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:30:13,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:13,529 INFO L85 PathProgramCache]: Analyzing trace with hash 423314739, now seen corresponding path program 1 times [2023-01-28 06:30:13,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:13,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536875090] [2023-01-28 06:30:13,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:13,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-01-28 06:30:13,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:13,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536875090] [2023-01-28 06:30:13,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536875090] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:30:13,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785285120] [2023-01-28 06:30:13,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:13,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:30:13,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:30:13,569 INFO L229 MonitoredProcess]: Starting monitored process 10 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:30:13,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-28 06:30:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:13,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 06:30:13,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:30:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-01-28 06:30:13,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:30:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-01-28 06:30:13,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785285120] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:30:13,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:30:13,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-01-28 06:30:13,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356482023] [2023-01-28 06:30:13,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:30:13,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:30:13,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:13,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:30:13,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:30:13,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 329 [2023-01-28 06:30:13,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 870 flow. Second operand has 5 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 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:30:13,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:13,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 329 [2023-01-28 06:30:13,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:14,335 INFO L130 PetriNetUnfolder]: 3159/5673 cut-off events. [2023-01-28 06:30:14,335 INFO L131 PetriNetUnfolder]: For 17258/17538 co-relation queries the response was YES. [2023-01-28 06:30:14,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19543 conditions, 5673 events. 3159/5673 cut-off events. For 17258/17538 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 40530 event pairs, 1809 based on Foata normal form. 104/5716 useless extension candidates. Maximal degree in co-relation 19509. Up to 3820 conditions per place. [2023-01-28 06:30:14,366 INFO L137 encePairwiseOnDemand]: 326/329 looper letters, 76 selfloop transitions, 3 changer transitions 0/128 dead transitions. [2023-01-28 06:30:14,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 128 transitions, 1230 flow [2023-01-28 06:30:14,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:30:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:30:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 589 transitions. [2023-01-28 06:30:14,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44756838905775076 [2023-01-28 06:30:14,367 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 589 transitions. [2023-01-28 06:30:14,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 589 transitions. [2023-01-28 06:30:14,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:14,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 589 transitions. [2023-01-28 06:30:14,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 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:30:14,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 329.0) internal successors, (1645), 5 states have internal predecessors, (1645), 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:30:14,370 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 329.0) internal successors, (1645), 5 states have internal predecessors, (1645), 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:30:14,370 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 870 flow. Second operand 4 states and 589 transitions. [2023-01-28 06:30:14,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 128 transitions, 1230 flow [2023-01-28 06:30:14,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 128 transitions, 1216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:30:14,430 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 880 flow [2023-01-28 06:30:14,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=880, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2023-01-28 06:30:14,430 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 56 predicate places. [2023-01-28 06:30:14,430 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 880 flow [2023-01-28 06:30:14,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 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:30:14,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:14,431 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:14,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-01-28 06:30:14,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:30:14,635 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:30:14,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1402124064, now seen corresponding path program 2 times [2023-01-28 06:30:14,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:14,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068555250] [2023-01-28 06:30:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:14,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-01-28 06:30:14,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:14,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068555250] [2023-01-28 06:30:14,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068555250] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:14,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:14,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:30:14,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529210852] [2023-01-28 06:30:14,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:14,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:30:14,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:14,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:30:14,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:30:14,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-01-28 06:30:14,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 880 flow. Second operand has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 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:30:14,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:14,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-01-28 06:30:14,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:15,554 INFO L130 PetriNetUnfolder]: 5188/8517 cut-off events. [2023-01-28 06:30:15,554 INFO L131 PetriNetUnfolder]: For 26480/26480 co-relation queries the response was YES. [2023-01-28 06:30:15,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30299 conditions, 8517 events. 5188/8517 cut-off events. For 26480/26480 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 59381 event pairs, 2417 based on Foata normal form. 94/8368 useless extension candidates. Maximal degree in co-relation 30263. Up to 4028 conditions per place. [2023-01-28 06:30:15,597 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 112 selfloop transitions, 32 changer transitions 8/158 dead transitions. [2023-01-28 06:30:15,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 158 transitions, 1646 flow [2023-01-28 06:30:15,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:30:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:30:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 780 transitions. [2023-01-28 06:30:15,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951367781155015 [2023-01-28 06:30:15,599 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 780 transitions. [2023-01-28 06:30:15,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 780 transitions. [2023-01-28 06:30:15,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:15,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 780 transitions. [2023-01-28 06:30:15,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:30:15,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:15,603 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:15,603 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 880 flow. Second operand 6 states and 780 transitions. [2023-01-28 06:30:15,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 158 transitions, 1646 flow [2023-01-28 06:30:15,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 158 transitions, 1612 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-01-28 06:30:15,762 INFO L231 Difference]: Finished difference. Result has 103 places, 93 transitions, 1022 flow [2023-01-28 06:30:15,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1022, PETRI_PLACES=103, PETRI_TRANSITIONS=93} [2023-01-28 06:30:15,763 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 63 predicate places. [2023-01-28 06:30:15,763 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 93 transitions, 1022 flow [2023-01-28 06:30:15,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 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:30:15,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:15,763 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:15,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-01-28 06:30:15,764 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:30:15,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2102118292, now seen corresponding path program 1 times [2023-01-28 06:30:15,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:15,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785689750] [2023-01-28 06:30:15,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:15,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-01-28 06:30:15,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:15,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785689750] [2023-01-28 06:30:15,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785689750] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:15,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:15,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:30:15,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943437632] [2023-01-28 06:30:15,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:15,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:30:15,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:15,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:30:15,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:30:15,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-01-28 06:30:15,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 93 transitions, 1022 flow. Second operand has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 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:30:15,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:15,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-01-28 06:30:15,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:16,590 INFO L130 PetriNetUnfolder]: 5245/8711 cut-off events. [2023-01-28 06:30:16,590 INFO L131 PetriNetUnfolder]: For 31328/31328 co-relation queries the response was YES. [2023-01-28 06:30:16,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31555 conditions, 8711 events. 5245/8711 cut-off events. For 31328/31328 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 61566 event pairs, 2864 based on Foata normal form. 110/8772 useless extension candidates. Maximal degree in co-relation 31515. Up to 4663 conditions per place. [2023-01-28 06:30:16,639 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 103 selfloop transitions, 24 changer transitions 23/156 dead transitions. [2023-01-28 06:30:16,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 156 transitions, 1754 flow [2023-01-28 06:30:16,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:30:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:30:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 771 transitions. [2023-01-28 06:30:16,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3905775075987842 [2023-01-28 06:30:16,641 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 771 transitions. [2023-01-28 06:30:16,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 771 transitions. [2023-01-28 06:30:16,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:16,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 771 transitions. [2023-01-28 06:30:16,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 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:30:16,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:16,645 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:16,645 INFO L175 Difference]: Start difference. First operand has 103 places, 93 transitions, 1022 flow. Second operand 6 states and 771 transitions. [2023-01-28 06:30:16,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 156 transitions, 1754 flow [2023-01-28 06:30:16,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 156 transitions, 1725 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-01-28 06:30:16,818 INFO L231 Difference]: Finished difference. Result has 110 places, 89 transitions, 1031 flow [2023-01-28 06:30:16,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1031, PETRI_PLACES=110, PETRI_TRANSITIONS=89} [2023-01-28 06:30:16,819 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 70 predicate places. [2023-01-28 06:30:16,819 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 89 transitions, 1031 flow [2023-01-28 06:30:16,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 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:30:16,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:16,819 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:16,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-01-28 06:30:16,820 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:30:16,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:16,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1615814549, now seen corresponding path program 1 times [2023-01-28 06:30:16,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:16,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872318318] [2023-01-28 06:30:16,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:16,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-01-28 06:30:16,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:16,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872318318] [2023-01-28 06:30:16,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872318318] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:16,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:16,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:30:16,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173229127] [2023-01-28 06:30:16,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:16,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:30:16,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:16,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:30:16,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:30:16,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-01-28 06:30:16,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 89 transitions, 1031 flow. Second operand has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 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:30:16,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:16,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-01-28 06:30:16,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:17,639 INFO L130 PetriNetUnfolder]: 4719/7811 cut-off events. [2023-01-28 06:30:17,639 INFO L131 PetriNetUnfolder]: For 29294/29294 co-relation queries the response was YES. [2023-01-28 06:30:17,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28494 conditions, 7811 events. 4719/7811 cut-off events. For 29294/29294 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 53959 event pairs, 2292 based on Foata normal form. 104/7866 useless extension candidates. Maximal degree in co-relation 28451. Up to 3857 conditions per place. [2023-01-28 06:30:17,683 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 101 selfloop transitions, 24 changer transitions 17/148 dead transitions. [2023-01-28 06:30:17,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 148 transitions, 1706 flow [2023-01-28 06:30:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:30:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:30:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 774 transitions. [2023-01-28 06:30:17,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39209726443769 [2023-01-28 06:30:17,684 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 774 transitions. [2023-01-28 06:30:17,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 774 transitions. [2023-01-28 06:30:17,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:17,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 774 transitions. [2023-01-28 06:30:17,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 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:30:17,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:17,688 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:17,688 INFO L175 Difference]: Start difference. First operand has 110 places, 89 transitions, 1031 flow. Second operand 6 states and 774 transitions. [2023-01-28 06:30:17,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 148 transitions, 1706 flow [2023-01-28 06:30:17,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 148 transitions, 1611 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-01-28 06:30:17,878 INFO L231 Difference]: Finished difference. Result has 111 places, 85 transitions, 954 flow [2023-01-28 06:30:17,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=954, PETRI_PLACES=111, PETRI_TRANSITIONS=85} [2023-01-28 06:30:17,879 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 71 predicate places. [2023-01-28 06:30:17,879 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 85 transitions, 954 flow [2023-01-28 06:30:17,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 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:30:17,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:17,880 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:17,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-01-28 06:30:17,880 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:30:17,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:17,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1537568021, now seen corresponding path program 1 times [2023-01-28 06:30:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557253752] [2023-01-28 06:30:17,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:17,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-01-28 06:30:17,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:17,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557253752] [2023-01-28 06:30:17,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557253752] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:17,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:17,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:30:17,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063236136] [2023-01-28 06:30:17,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:17,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:30:17,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:17,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:30:17,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:30:17,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-01-28 06:30:17,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 85 transitions, 954 flow. Second operand has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 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:30:17,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:17,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-01-28 06:30:17,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:18,748 INFO L130 PetriNetUnfolder]: 4276/6932 cut-off events. [2023-01-28 06:30:18,749 INFO L131 PetriNetUnfolder]: For 24559/24559 co-relation queries the response was YES. [2023-01-28 06:30:18,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25356 conditions, 6932 events. 4276/6932 cut-off events. For 24559/24559 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 45124 event pairs, 2371 based on Foata normal form. 114/6997 useless extension candidates. Maximal degree in co-relation 25316. Up to 4036 conditions per place. [2023-01-28 06:30:18,771 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 87 selfloop transitions, 16 changer transitions 23/132 dead transitions. [2023-01-28 06:30:18,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 132 transitions, 1464 flow [2023-01-28 06:30:18,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:30:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:30:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions. [2023-01-28 06:30:18,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3880445795339412 [2023-01-28 06:30:18,774 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 766 transitions. [2023-01-28 06:30:18,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 766 transitions. [2023-01-28 06:30:18,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:18,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 766 transitions. [2023-01-28 06:30:18,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 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:30:18,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:18,778 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 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:30:18,778 INFO L175 Difference]: Start difference. First operand has 111 places, 85 transitions, 954 flow. Second operand 6 states and 766 transitions. [2023-01-28 06:30:18,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 132 transitions, 1464 flow [2023-01-28 06:30:18,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 132 transitions, 1436 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-01-28 06:30:18,897 INFO L231 Difference]: Finished difference. Result has 115 places, 75 transitions, 798 flow [2023-01-28 06:30:18,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=798, PETRI_PLACES=115, PETRI_TRANSITIONS=75} [2023-01-28 06:30:18,897 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 75 predicate places. [2023-01-28 06:30:18,897 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 75 transitions, 798 flow [2023-01-28 06:30:18,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 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:30:18,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:18,898 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:18,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-01-28 06:30:18,898 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:30:18,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:18,898 INFO L85 PathProgramCache]: Analyzing trace with hash -380507573, now seen corresponding path program 1 times [2023-01-28 06:30:18,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:18,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660144560] [2023-01-28 06:30:18,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:18,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-01-28 06:30:18,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:18,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660144560] [2023-01-28 06:30:18,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660144560] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:18,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:18,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 06:30:18,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106391844] [2023-01-28 06:30:18,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:18,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:30:18,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:18,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:30:18,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:30:18,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 329 [2023-01-28 06:30:18,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 75 transitions, 798 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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:30:18,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:18,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 329 [2023-01-28 06:30:18,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:19,625 INFO L130 PetriNetUnfolder]: 3814/6098 cut-off events. [2023-01-28 06:30:19,625 INFO L131 PetriNetUnfolder]: For 21716/21716 co-relation queries the response was YES. [2023-01-28 06:30:19,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22085 conditions, 6098 events. 3814/6098 cut-off events. For 21716/21716 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 38410 event pairs, 2003 based on Foata normal form. 12/6075 useless extension candidates. Maximal degree in co-relation 22043. Up to 3476 conditions per place. [2023-01-28 06:30:19,655 INFO L137 encePairwiseOnDemand]: 319/329 looper letters, 73 selfloop transitions, 15 changer transitions 26/120 dead transitions. [2023-01-28 06:30:19,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 120 transitions, 1229 flow [2023-01-28 06:30:19,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:30:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:30:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 838 transitions. [2023-01-28 06:30:19,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3638732088580113 [2023-01-28 06:30:19,657 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 838 transitions. [2023-01-28 06:30:19,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 838 transitions. [2023-01-28 06:30:19,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:19,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 838 transitions. [2023-01-28 06:30:19,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 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:30:19,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 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:30:19,660 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 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:30:19,660 INFO L175 Difference]: Start difference. First operand has 115 places, 75 transitions, 798 flow. Second operand 7 states and 838 transitions. [2023-01-28 06:30:19,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 120 transitions, 1229 flow [2023-01-28 06:30:19,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 120 transitions, 1145 flow, removed 8 selfloop flow, removed 11 redundant places. [2023-01-28 06:30:19,867 INFO L231 Difference]: Finished difference. Result has 111 places, 71 transitions, 687 flow [2023-01-28 06:30:19,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=687, PETRI_PLACES=111, PETRI_TRANSITIONS=71} [2023-01-28 06:30:19,867 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 71 predicate places. [2023-01-28 06:30:19,867 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 71 transitions, 687 flow [2023-01-28 06:30:19,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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:30:19,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:19,868 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:19,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-01-28 06:30:19,869 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:30:19,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:19,869 INFO L85 PathProgramCache]: Analyzing trace with hash -207543005, now seen corresponding path program 1 times [2023-01-28 06:30:19,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:19,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59064404] [2023-01-28 06:30:19,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:19,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-01-28 06:30:19,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:19,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59064404] [2023-01-28 06:30:19,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59064404] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:19,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:19,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 06:30:19,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882923910] [2023-01-28 06:30:19,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:19,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:30:19,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:19,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:30:19,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:30:19,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 329 [2023-01-28 06:30:19,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 71 transitions, 687 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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:30:19,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:19,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 329 [2023-01-28 06:30:19,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:20,586 INFO L130 PetriNetUnfolder]: 3658/5782 cut-off events. [2023-01-28 06:30:20,587 INFO L131 PetriNetUnfolder]: For 16052/16052 co-relation queries the response was YES. [2023-01-28 06:30:20,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20778 conditions, 5782 events. 3658/5782 cut-off events. For 16052/16052 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 35539 event pairs, 1848 based on Foata normal form. 12/5759 useless extension candidates. Maximal degree in co-relation 20745. Up to 3201 conditions per place. [2023-01-28 06:30:20,613 INFO L137 encePairwiseOnDemand]: 319/329 looper letters, 69 selfloop transitions, 12 changer transitions 28/114 dead transitions. [2023-01-28 06:30:20,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 114 transitions, 1099 flow [2023-01-28 06:30:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:30:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:30:20,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 835 transitions. [2023-01-28 06:30:20,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36257056013894917 [2023-01-28 06:30:20,615 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 835 transitions. [2023-01-28 06:30:20,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 835 transitions. [2023-01-28 06:30:20,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:20,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 835 transitions. [2023-01-28 06:30:20,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 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:30:20,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 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:30:20,619 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 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:30:20,619 INFO L175 Difference]: Start difference. First operand has 111 places, 71 transitions, 687 flow. Second operand 7 states and 835 transitions. [2023-01-28 06:30:20,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 114 transitions, 1099 flow [2023-01-28 06:30:20,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 114 transitions, 1045 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-01-28 06:30:20,714 INFO L231 Difference]: Finished difference. Result has 108 places, 63 transitions, 567 flow [2023-01-28 06:30:20,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=567, PETRI_PLACES=108, PETRI_TRANSITIONS=63} [2023-01-28 06:30:20,715 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 68 predicate places. [2023-01-28 06:30:20,715 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 63 transitions, 567 flow [2023-01-28 06:30:20,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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:30:20,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:20,715 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:20,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-01-28 06:30:20,715 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:30:20,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:20,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1486769261, now seen corresponding path program 1 times [2023-01-28 06:30:20,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:20,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931246848] [2023-01-28 06:30:20,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:20,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:20,787 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-01-28 06:30:20,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:20,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931246848] [2023-01-28 06:30:20,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931246848] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:20,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:20,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 06:30:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822364545] [2023-01-28 06:30:20,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:20,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:30:20,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:20,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:30:20,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:30:20,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 329 [2023-01-28 06:30:20,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 63 transitions, 567 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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:30:20,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:20,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 329 [2023-01-28 06:30:20,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:21,299 INFO L130 PetriNetUnfolder]: 2457/3917 cut-off events. [2023-01-28 06:30:21,299 INFO L131 PetriNetUnfolder]: For 10249/10249 co-relation queries the response was YES. [2023-01-28 06:30:21,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13818 conditions, 3917 events. 2457/3917 cut-off events. For 10249/10249 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 22182 event pairs, 1233 based on Foata normal form. 12/3898 useless extension candidates. Maximal degree in co-relation 13786. Up to 2172 conditions per place. [2023-01-28 06:30:21,316 INFO L137 encePairwiseOnDemand]: 321/329 looper letters, 62 selfloop transitions, 10 changer transitions 25/102 dead transitions. [2023-01-28 06:30:21,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 102 transitions, 918 flow [2023-01-28 06:30:21,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:30:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:30:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 829 transitions. [2023-01-28 06:30:21,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359965262700825 [2023-01-28 06:30:21,318 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 829 transitions. [2023-01-28 06:30:21,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 829 transitions. [2023-01-28 06:30:21,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:21,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 829 transitions. [2023-01-28 06:30:21,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 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:30:21,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 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:30:21,321 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 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:30:21,321 INFO L175 Difference]: Start difference. First operand has 108 places, 63 transitions, 567 flow. Second operand 7 states and 829 transitions. [2023-01-28 06:30:21,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 102 transitions, 918 flow [2023-01-28 06:30:21,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 102 transitions, 873 flow, removed 3 selfloop flow, removed 8 redundant places. [2023-01-28 06:30:21,372 INFO L231 Difference]: Finished difference. Result has 103 places, 58 transitions, 470 flow [2023-01-28 06:30:21,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=470, PETRI_PLACES=103, PETRI_TRANSITIONS=58} [2023-01-28 06:30:21,372 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 63 predicate places. [2023-01-28 06:30:21,372 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 58 transitions, 470 flow [2023-01-28 06:30:21,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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:30:21,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:21,373 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:21,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-01-28 06:30:21,373 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:30:21,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:21,373 INFO L85 PathProgramCache]: Analyzing trace with hash -687091357, now seen corresponding path program 1 times [2023-01-28 06:30:21,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:21,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613281621] [2023-01-28 06:30:21,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:21,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-01-28 06:30:21,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:21,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613281621] [2023-01-28 06:30:21,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613281621] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:21,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:21,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 06:30:21,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682076764] [2023-01-28 06:30:21,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:21,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:30:21,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:21,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:30:21,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:30:21,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 329 [2023-01-28 06:30:21,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 58 transitions, 470 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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:30:21,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:21,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 329 [2023-01-28 06:30:21,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:22,012 INFO L130 PetriNetUnfolder]: 2301/3601 cut-off events. [2023-01-28 06:30:22,013 INFO L131 PetriNetUnfolder]: For 8645/8645 co-relation queries the response was YES. [2023-01-28 06:30:22,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12501 conditions, 3601 events. 2301/3601 cut-off events. For 8645/8645 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 19364 event pairs, 1114 based on Foata normal form. 12/3582 useless extension candidates. Maximal degree in co-relation 12472. Up to 2007 conditions per place. [2023-01-28 06:30:22,031 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 48 selfloop transitions, 7 changer transitions 36/95 dead transitions. [2023-01-28 06:30:22,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 95 transitions, 808 flow [2023-01-28 06:30:22,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:30:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:30:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 825 transitions. [2023-01-28 06:30:22,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35822839774207554 [2023-01-28 06:30:22,034 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 825 transitions. [2023-01-28 06:30:22,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 825 transitions. [2023-01-28 06:30:22,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:22,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 825 transitions. [2023-01-28 06:30:22,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 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:30:22,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 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:30:22,038 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 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:30:22,039 INFO L175 Difference]: Start difference. First operand has 103 places, 58 transitions, 470 flow. Second operand 7 states and 825 transitions. [2023-01-28 06:30:22,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 95 transitions, 808 flow [2023-01-28 06:30:22,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 95 transitions, 746 flow, removed 9 selfloop flow, removed 8 redundant places. [2023-01-28 06:30:22,078 INFO L231 Difference]: Finished difference. Result has 96 places, 48 transitions, 334 flow [2023-01-28 06:30:22,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=334, PETRI_PLACES=96, PETRI_TRANSITIONS=48} [2023-01-28 06:30:22,079 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 56 predicate places. [2023-01-28 06:30:22,079 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 48 transitions, 334 flow [2023-01-28 06:30:22,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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:30:22,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:22,079 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:22,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-01-28 06:30:22,079 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:30:22,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:22,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1657476839, now seen corresponding path program 1 times [2023-01-28 06:30:22,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:22,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275393472] [2023-01-28 06:30:22,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:22,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-01-28 06:30:22,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:22,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275393472] [2023-01-28 06:30:22,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275393472] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:22,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:22,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 06:30:22,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162120164] [2023-01-28 06:30:22,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:22,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:30:22,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:22,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:30:22,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:30:22,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 329 [2023-01-28 06:30:22,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 48 transitions, 334 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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:30:22,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:22,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 329 [2023-01-28 06:30:22,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:22,439 INFO L130 PetriNetUnfolder]: 1133/1767 cut-off events. [2023-01-28 06:30:22,439 INFO L131 PetriNetUnfolder]: For 2966/2966 co-relation queries the response was YES. [2023-01-28 06:30:22,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5686 conditions, 1767 events. 1133/1767 cut-off events. For 2966/2966 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7978 event pairs, 652 based on Foata normal form. 18/1754 useless extension candidates. Maximal degree in co-relation 5659. Up to 1233 conditions per place. [2023-01-28 06:30:22,446 INFO L137 encePairwiseOnDemand]: 322/329 looper letters, 42 selfloop transitions, 3 changer transitions 26/75 dead transitions. [2023-01-28 06:30:22,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 75 transitions, 578 flow [2023-01-28 06:30:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:30:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:30:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 810 transitions. [2023-01-28 06:30:22,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3517151541467651 [2023-01-28 06:30:22,448 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 810 transitions. [2023-01-28 06:30:22,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 810 transitions. [2023-01-28 06:30:22,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:22,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 810 transitions. [2023-01-28 06:30:22,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 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:30:22,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 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:30:22,451 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 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:30:22,451 INFO L175 Difference]: Start difference. First operand has 96 places, 48 transitions, 334 flow. Second operand 7 states and 810 transitions. [2023-01-28 06:30:22,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 75 transitions, 578 flow [2023-01-28 06:30:22,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 493 flow, removed 9 selfloop flow, removed 16 redundant places. [2023-01-28 06:30:22,460 INFO L231 Difference]: Finished difference. Result has 77 places, 40 transitions, 194 flow [2023-01-28 06:30:22,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=194, PETRI_PLACES=77, PETRI_TRANSITIONS=40} [2023-01-28 06:30:22,460 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2023-01-28 06:30:22,460 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 40 transitions, 194 flow [2023-01-28 06:30:22,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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:30:22,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:22,461 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:22,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-01-28 06:30:22,461 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:30:22,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:22,461 INFO L85 PathProgramCache]: Analyzing trace with hash -931249861, now seen corresponding path program 1 times [2023-01-28 06:30:22,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:22,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683700702] [2023-01-28 06:30:22,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:22,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-01-28 06:30:22,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:22,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683700702] [2023-01-28 06:30:22,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683700702] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:22,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:22,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 06:30:22,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741726734] [2023-01-28 06:30:22,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:22,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:30:22,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:22,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:30:22,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:30:22,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 329 [2023-01-28 06:30:22,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 40 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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:30:22,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:22,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 329 [2023-01-28 06:30:22,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:22,796 INFO L130 PetriNetUnfolder]: 1034/1566 cut-off events. [2023-01-28 06:30:22,796 INFO L131 PetriNetUnfolder]: For 1710/1710 co-relation queries the response was YES. [2023-01-28 06:30:22,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4696 conditions, 1566 events. 1034/1566 cut-off events. For 1710/1710 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6798 event pairs, 571 based on Foata normal form. 18/1553 useless extension candidates. Maximal degree in co-relation 4679. Up to 1064 conditions per place. [2023-01-28 06:30:22,801 INFO L137 encePairwiseOnDemand]: 322/329 looper letters, 0 selfloop transitions, 0 changer transitions 62/62 dead transitions. [2023-01-28 06:30:22,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 62 transitions, 399 flow [2023-01-28 06:30:22,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:30:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:30:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 801 transitions. [2023-01-28 06:30:22,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3478072079895788 [2023-01-28 06:30:22,803 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 801 transitions. [2023-01-28 06:30:22,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 801 transitions. [2023-01-28 06:30:22,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:22,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 801 transitions. [2023-01-28 06:30:22,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 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:30:22,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 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:30:22,806 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 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:30:22,806 INFO L175 Difference]: Start difference. First operand has 77 places, 40 transitions, 194 flow. Second operand 7 states and 801 transitions. [2023-01-28 06:30:22,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 62 transitions, 399 flow [2023-01-28 06:30:22,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 371 flow, removed 3 selfloop flow, removed 8 redundant places. [2023-01-28 06:30:22,810 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2023-01-28 06:30:22,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2023-01-28 06:30:22,811 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-01-28 06:30:22,811 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2023-01-28 06:30:22,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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:30:22,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 06:30:22,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-01-28 06:30:22,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-01-28 06:30:22,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-01-28 06:30:22,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-01-28 06:30:22,812 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:22,812 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-01-28 06:30:22,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 168 transitions, 357 flow [2023-01-28 06:30:22,829 INFO L130 PetriNetUnfolder]: 25/202 cut-off events. [2023-01-28 06:30:22,829 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-01-28 06:30:22,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 202 events. 25/202 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 484 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 149. Up to 8 conditions per place. [2023-01-28 06:30:22,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 168 transitions, 357 flow [2023-01-28 06:30:22,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 168 transitions, 357 flow [2023-01-28 06:30:22,831 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:30:22,832 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 168 transitions, 357 flow [2023-01-28 06:30:22,832 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 168 transitions, 357 flow [2023-01-28 06:30:22,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 168 transitions, 357 flow [2023-01-28 06:30:22,848 INFO L130 PetriNetUnfolder]: 25/202 cut-off events. [2023-01-28 06:30:22,848 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-01-28 06:30:22,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 202 events. 25/202 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 484 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 149. Up to 8 conditions per place. [2023-01-28 06:30:22,856 INFO L119 LiptonReduction]: Number of co-enabled transitions 15312 [2023-01-28 06:30:25,408 INFO L134 LiptonReduction]: Checked pairs total: 23205 [2023-01-28 06:30:25,408 INFO L136 LiptonReduction]: Total number of compositions: 158 [2023-01-28 06:30:25,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-01-28 06:30:25,409 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;@6ccd1f1f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:30:25,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-28 06:30:25,413 INFO L130 PetriNetUnfolder]: 12/54 cut-off events. [2023-01-28 06:30:25,413 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-01-28 06:30:25,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:25,413 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-01-28 06:30:25,413 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 06:30:25,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:25,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1065229616, now seen corresponding path program 1 times [2023-01-28 06:30:25,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:25,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372137939] [2023-01-28 06:30:25,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:25,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:30:25,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:30:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:30:25,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:30:25,443 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:30:25,444 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-28 06:30:25,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-01-28 06:30:25,444 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-01-28 06:30:25,446 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-01-28 06:30:25,446 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-28 06:30:25,446 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-01-28 06:30:25,476 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:30:25,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 213 transitions, 458 flow [2023-01-28 06:30:25,499 INFO L130 PetriNetUnfolder]: 33/259 cut-off events. [2023-01-28 06:30:25,499 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-28 06:30:25,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 259 events. 33/259 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 716 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 210. Up to 10 conditions per place. [2023-01-28 06:30:25,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 213 transitions, 458 flow [2023-01-28 06:30:25,504 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 213 transitions, 458 flow [2023-01-28 06:30:25,504 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:30:25,504 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 213 transitions, 458 flow [2023-01-28 06:30:25,504 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 213 transitions, 458 flow [2023-01-28 06:30:25,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 213 transitions, 458 flow [2023-01-28 06:30:25,525 INFO L130 PetriNetUnfolder]: 33/259 cut-off events. [2023-01-28 06:30:25,526 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-28 06:30:25,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 259 events. 33/259 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 716 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 210. Up to 10 conditions per place. [2023-01-28 06:30:25,536 INFO L119 LiptonReduction]: Number of co-enabled transitions 28336 [2023-01-28 06:30:28,602 INFO L134 LiptonReduction]: Checked pairs total: 42708 [2023-01-28 06:30:28,602 INFO L136 LiptonReduction]: Total number of compositions: 199 [2023-01-28 06:30:28,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:30:28,603 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;@6ccd1f1f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:30:28,603 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 06:30:28,604 INFO L130 PetriNetUnfolder]: 1/10 cut-off events. [2023-01-28 06:30:28,605 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:30:28,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:28,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-28 06:30:28,605 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:30:28,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:28,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1374319252, now seen corresponding path program 1 times [2023-01-28 06:30:28,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:28,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310588771] [2023-01-28 06:30:28,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:28,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:28,613 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:30:28,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:28,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310588771] [2023-01-28 06:30:28,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310588771] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:28,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:28,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:30:28,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813827083] [2023-01-28 06:30:28,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:28,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-28 06:30:28,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:28,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-28 06:30:28,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-28 06:30:28,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 412 [2023-01-28 06:30:28,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 58 transitions, 148 flow. Second operand has 2 states, 2 states have (on average 185.5) internal successors, (371), 2 states have internal predecessors, (371), 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:30:28,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:28,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 412 [2023-01-28 06:30:28,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:29,128 INFO L130 PetriNetUnfolder]: 5548/8708 cut-off events. [2023-01-28 06:30:29,129 INFO L131 PetriNetUnfolder]: For 1921/1921 co-relation queries the response was YES. [2023-01-28 06:30:29,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16654 conditions, 8708 events. 5548/8708 cut-off events. For 1921/1921 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 54973 event pairs, 4064 based on Foata normal form. 1141/8209 useless extension candidates. Maximal degree in co-relation 2704. Up to 6799 conditions per place. [2023-01-28 06:30:29,176 INFO L137 encePairwiseOnDemand]: 403/412 looper letters, 26 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-01-28 06:30:29,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 182 flow [2023-01-28 06:30:29,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-28 06:30:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-28 06:30:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 401 transitions. [2023-01-28 06:30:29,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4866504854368932 [2023-01-28 06:30:29,177 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 401 transitions. [2023-01-28 06:30:29,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 401 transitions. [2023-01-28 06:30:29,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:29,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 401 transitions. [2023-01-28 06:30:29,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 200.5) internal successors, (401), 2 states have internal predecessors, (401), 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:30:29,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 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:30:29,178 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 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:30:29,178 INFO L175 Difference]: Start difference. First operand has 51 places, 58 transitions, 148 flow. Second operand 2 states and 401 transitions. [2023-01-28 06:30:29,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 182 flow [2023-01-28 06:30:29,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 170 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-01-28 06:30:29,180 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 118 flow [2023-01-28 06:30:29,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2023-01-28 06:30:29,180 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-01-28 06:30:29,181 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 118 flow [2023-01-28 06:30:29,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 185.5) internal successors, (371), 2 states have internal predecessors, (371), 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:30:29,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:29,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:29,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-01-28 06:30:29,181 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:30:29,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:29,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1480801169, now seen corresponding path program 1 times [2023-01-28 06:30:29,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:29,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670531210] [2023-01-28 06:30:29,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:29,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:29,204 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:30:29,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:29,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670531210] [2023-01-28 06:30:29,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670531210] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:29,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:29,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:30:29,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590384477] [2023-01-28 06:30:29,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:29,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:30:29,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:29,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:30:29,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:30:29,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 412 [2023-01-28 06:30:29,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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:30:29,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:29,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 412 [2023-01-28 06:30:29,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:29,742 INFO L130 PetriNetUnfolder]: 6635/10007 cut-off events. [2023-01-28 06:30:29,742 INFO L131 PetriNetUnfolder]: For 508/508 co-relation queries the response was YES. [2023-01-28 06:30:29,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18831 conditions, 10007 events. 6635/10007 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 61881 event pairs, 3346 based on Foata normal form. 0/8153 useless extension candidates. Maximal degree in co-relation 18824. Up to 6799 conditions per place. [2023-01-28 06:30:29,796 INFO L137 encePairwiseOnDemand]: 409/412 looper letters, 44 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-01-28 06:30:29,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 69 transitions, 265 flow [2023-01-28 06:30:29,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:30:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:30:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2023-01-28 06:30:29,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603559870550162 [2023-01-28 06:30:29,797 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 569 transitions. [2023-01-28 06:30:29,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 569 transitions. [2023-01-28 06:30:29,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:29,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 569 transitions. [2023-01-28 06:30:29,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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:30:29,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 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:30:29,798 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 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:30:29,798 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 118 flow. Second operand 3 states and 569 transitions. [2023-01-28 06:30:29,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 69 transitions, 265 flow [2023-01-28 06:30:29,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:30:29,800 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 130 flow [2023-01-28 06:30:29,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2023-01-28 06:30:29,800 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-01-28 06:30:29,800 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 130 flow [2023-01-28 06:30:29,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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:30:29,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:29,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:29,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-01-28 06:30:29,801 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:30:29,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:29,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1836093859, now seen corresponding path program 1 times [2023-01-28 06:30:29,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:29,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958700883] [2023-01-28 06:30:29,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:29,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:30:29,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:29,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958700883] [2023-01-28 06:30:29,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958700883] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:29,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:29,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:30:29,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704675599] [2023-01-28 06:30:29,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:29,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:30:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:29,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:30:29,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:30:29,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 412 [2023-01-28 06:30:29,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 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:30:29,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:29,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 412 [2023-01-28 06:30:29,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:32,716 INFO L130 PetriNetUnfolder]: 50051/66335 cut-off events. [2023-01-28 06:30:32,716 INFO L131 PetriNetUnfolder]: For 8154/8154 co-relation queries the response was YES. [2023-01-28 06:30:32,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138257 conditions, 66335 events. 50051/66335 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 2595. Compared 402158 event pairs, 26045 based on Foata normal form. 0/48456 useless extension candidates. Maximal degree in co-relation 138248. Up to 45728 conditions per place. [2023-01-28 06:30:33,438 INFO L137 encePairwiseOnDemand]: 405/412 looper letters, 70 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2023-01-28 06:30:33,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 83 transitions, 363 flow [2023-01-28 06:30:33,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:30:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:30:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2023-01-28 06:30:33,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377022653721683 [2023-01-28 06:30:33,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2023-01-28 06:30:33,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2023-01-28 06:30:33,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:33,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2023-01-28 06:30:33,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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:30:33,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 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:30:33,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 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:30:33,442 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 130 flow. Second operand 3 states and 541 transitions. [2023-01-28 06:30:33,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 83 transitions, 363 flow [2023-01-28 06:30:33,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 359 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 06:30:33,446 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 168 flow [2023-01-28 06:30:33,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2023-01-28 06:30:33,446 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2023-01-28 06:30:33,446 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 168 flow [2023-01-28 06:30:33,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 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:30:33,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:33,447 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:33,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-01-28 06:30:33,447 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:30:33,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:33,447 INFO L85 PathProgramCache]: Analyzing trace with hash 624867628, now seen corresponding path program 1 times [2023-01-28 06:30:33,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:33,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650410575] [2023-01-28 06:30:33,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:33,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:33,469 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:30:33,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:33,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650410575] [2023-01-28 06:30:33,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650410575] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:33,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:33,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:30:33,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100467180] [2023-01-28 06:30:33,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:33,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:30:33,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:33,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:30:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:30:33,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 412 [2023-01-28 06:30:33,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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:30:33,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:33,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 412 [2023-01-28 06:30:33,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:34,441 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 39#L705-6true, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,441 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-01-28 06:30:34,441 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:30:34,441 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 06:30:34,441 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 06:30:34,492 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 39#L705-6true, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,492 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-01-28 06:30:34,492 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:30:34,492 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:30:34,492 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:30:34,492 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, 146#L712true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,492 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-01-28 06:30:34,492 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:30:34,492 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:30:34,492 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:30:34,499 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 8#L718true, 157#L718true, 210#true, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:34,499 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-01-28 06:30:34,499 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:30:34,499 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:30:34,499 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 06:30:34,532 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 146#L712true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,532 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,532 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,532 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:30:34,532 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:30:34,533 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:34,533 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,533 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:30:34,533 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,533 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:30:34,537 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:34,537 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,537 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:30:34,537 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:30:34,537 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,537 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,537 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,538 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:30:34,538 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,538 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 06:30:34,547 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, 151#L718true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 39#L705-6true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,547 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,547 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,547 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,547 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,561 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,561 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,561 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,561 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,561 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,566 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:34,566 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,566 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,566 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,566 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,567 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:34,567 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,567 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,567 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,567 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,569 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, 133#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:34,570 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,570 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,570 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,570 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:34,580 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 39#L705-6true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,580 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,580 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,580 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,580 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,581 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, 109#L729-4true, 146#L712true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,581 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,581 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,581 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,581 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,587 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 151#L718true, 109#L729-4true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,587 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,587 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,587 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,587 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,590 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 8#L718true, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,590 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,590 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,590 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,590 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,590 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,590 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,590 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,590 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,590 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,593 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, 133#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:34,593 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,593 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,593 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,593 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:34,603 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, 146#L712true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,603 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,603 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,603 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,603 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,604 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:34,604 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,604 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,604 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,604 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,608 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 8#L718true, 157#L718true, 210#true, 166#thr1EXITtrue, 109#L729-4true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,608 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,608 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,608 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,608 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,608 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 151#L718true, 109#L729-4true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,608 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,608 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,608 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,608 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,610 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,610 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,610 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,610 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,610 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:34,612 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 8#L718true, 157#L718true, 210#true, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,612 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-01-28 06:30:34,612 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,612 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:34,613 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,616 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:34,616 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-01-28 06:30:34,616 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,616 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:34,617 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,617 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:34,617 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-01-28 06:30:34,617 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,617 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:34,617 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,620 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, 133#thr1EXITtrue, 109#L729-4true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,620 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-01-28 06:30:34,620 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,620 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:34,620 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:34,622 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 8#L718true, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,622 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-01-28 06:30:34,622 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-01-28 06:30:34,622 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:34,622 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:34,622 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,622 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-01-28 06:30:34,622 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-01-28 06:30:34,622 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:34,622 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:34,624 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, 133#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:34,625 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-01-28 06:30:34,625 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:34,625 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:34,625 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-01-28 06:30:34,627 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-01-28 06:30:34,627 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-01-28 06:30:34,627 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-01-28 06:30:34,627 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-01-28 06:30:34,627 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-01-28 06:30:34,629 INFO L130 PetriNetUnfolder]: 12187/18671 cut-off events. [2023-01-28 06:30:34,629 INFO L131 PetriNetUnfolder]: For 3987/4454 co-relation queries the response was YES. [2023-01-28 06:30:34,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38323 conditions, 18671 events. 12187/18671 cut-off events. For 3987/4454 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 129636 event pairs, 7107 based on Foata normal form. 0/15238 useless extension candidates. Maximal degree in co-relation 38313. Up to 12735 conditions per place. [2023-01-28 06:30:34,740 INFO L137 encePairwiseOnDemand]: 409/412 looper letters, 47 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-01-28 06:30:34,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 330 flow [2023-01-28 06:30:34,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:30:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:30:34,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2023-01-28 06:30:34,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.459546925566343 [2023-01-28 06:30:34,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2023-01-28 06:30:34,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2023-01-28 06:30:34,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:34,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2023-01-28 06:30:34,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 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:30:34,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 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:30:34,743 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 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:30:34,743 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 168 flow. Second operand 3 states and 568 transitions. [2023-01-28 06:30:34,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 330 flow [2023-01-28 06:30:34,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:30:34,748 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 168 flow [2023-01-28 06:30:34,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2023-01-28 06:30:34,748 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-01-28 06:30:34,748 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 168 flow [2023-01-28 06:30:34,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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:30:34,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:34,748 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:34,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-01-28 06:30:34,749 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:30:34,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:34,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1200327327, now seen corresponding path program 1 times [2023-01-28 06:30:34,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:34,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016665303] [2023-01-28 06:30:34,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:34,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 06:30:34,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:34,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016665303] [2023-01-28 06:30:34,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016665303] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:34,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:34,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:30:34,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065429613] [2023-01-28 06:30:34,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:34,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:30:34,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:34,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:30:34,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:30:34,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 412 [2023-01-28 06:30:34,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:30:34,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:34,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 412 [2023-01-28 06:30:34,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:39,987 INFO L130 PetriNetUnfolder]: 67143/91062 cut-off events. [2023-01-28 06:30:39,987 INFO L131 PetriNetUnfolder]: For 23681/23681 co-relation queries the response was YES. [2023-01-28 06:30:40,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206073 conditions, 91062 events. 67143/91062 cut-off events. For 23681/23681 co-relation queries the response was YES. Maximal size of possible extension queue 3655. Compared 606689 event pairs, 34289 based on Foata normal form. 0/70457 useless extension candidates. Maximal degree in co-relation 206062. Up to 60226 conditions per place. [2023-01-28 06:30:40,458 INFO L137 encePairwiseOnDemand]: 405/412 looper letters, 75 selfloop transitions, 9 changer transitions 0/91 dead transitions. [2023-01-28 06:30:40,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 91 transitions, 442 flow [2023-01-28 06:30:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:30:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:30:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2023-01-28 06:30:40,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4368932038834951 [2023-01-28 06:30:40,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 540 transitions. [2023-01-28 06:30:40,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 540 transitions. [2023-01-28 06:30:40,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:40,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 540 transitions. [2023-01-28 06:30:40,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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:30:40,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 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:30:40,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 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:30:40,462 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 168 flow. Second operand 3 states and 540 transitions. [2023-01-28 06:30:40,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 91 transitions, 442 flow [2023-01-28 06:30:40,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 91 transitions, 438 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 06:30:40,476 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 236 flow [2023-01-28 06:30:40,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2023-01-28 06:30:40,477 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-01-28 06:30:40,477 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 236 flow [2023-01-28 06:30:40,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:30:40,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:40,477 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:40,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-01-28 06:30:40,477 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:30:40,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1313240605, now seen corresponding path program 1 times [2023-01-28 06:30:40,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:40,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178628237] [2023-01-28 06:30:40,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:40,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:40,507 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:30:40,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:40,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178628237] [2023-01-28 06:30:40,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178628237] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:40,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:40,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:30:40,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660531011] [2023-01-28 06:30:40,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:40,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:30:40,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:40,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:30:40,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:30:40,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 412 [2023-01-28 06:30:40,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:30:40,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:40,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 412 [2023-01-28 06:30:40,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:42,432 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 29#L714-1true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, 215#true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, 135#L729-5true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:42,432 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 06:30:42,432 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:42,432 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:42,432 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:42,432 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 29#L714-1true, 133#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, 215#true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, 135#L729-5true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:42,432 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-01-28 06:30:42,432 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:42,432 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:42,432 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:42,439 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, 30#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 133#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, 215#true, 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, 135#L729-5true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:42,439 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-01-28 06:30:42,440 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:42,440 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:30:42,440 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:42,440 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, 30#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 8#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, 215#true, 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, 135#L729-5true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:42,440 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 06:30:42,440 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:42,440 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 06:30:42,440 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 06:30:42,579 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 29#L714-1true, 133#thr1EXITtrue, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, 215#true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:42,579 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-01-28 06:30:42,579 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-01-28 06:30:42,579 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:42,579 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:42,579 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 29#L714-1true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, 109#L729-4true, 215#true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:42,579 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-01-28 06:30:42,580 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:42,580 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:42,580 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:42,587 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, 30#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 133#thr1EXITtrue, 151#L718true, 109#L729-4true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 215#true, 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:42,587 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-01-28 06:30:42,587 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:42,587 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-01-28 06:30:42,587 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:42,587 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, 30#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 8#L718true, 109#L729-4true, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 215#true, 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:30:42,587 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-01-28 06:30:42,587 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:42,587 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:30:42,587 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:30:42,634 INFO L130 PetriNetUnfolder]: 20002/30478 cut-off events. [2023-01-28 06:30:42,634 INFO L131 PetriNetUnfolder]: For 10630/12773 co-relation queries the response was YES. [2023-01-28 06:30:42,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67665 conditions, 30478 events. 20002/30478 cut-off events. For 10630/12773 co-relation queries the response was YES. Maximal size of possible extension queue 1493. Compared 227808 event pairs, 11800 based on Foata normal form. 51/25180 useless extension candidates. Maximal degree in co-relation 67653. Up to 21369 conditions per place. [2023-01-28 06:30:42,807 INFO L137 encePairwiseOnDemand]: 409/412 looper letters, 50 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-01-28 06:30:42,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 411 flow [2023-01-28 06:30:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:30:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:30:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2023-01-28 06:30:42,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4587378640776699 [2023-01-28 06:30:42,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2023-01-28 06:30:42,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2023-01-28 06:30:42,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:42,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2023-01-28 06:30:42,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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:30:42,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 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:30:42,811 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 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:30:42,811 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 236 flow. Second operand 3 states and 567 transitions. [2023-01-28 06:30:42,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 411 flow [2023-01-28 06:30:42,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 391 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:30:42,822 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 230 flow [2023-01-28 06:30:42,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2023-01-28 06:30:42,823 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-01-28 06:30:42,823 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 230 flow [2023-01-28 06:30:42,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:30:42,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:42,823 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:42,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-01-28 06:30:42,823 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:30:42,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:42,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1025945555, now seen corresponding path program 1 times [2023-01-28 06:30:42,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:42,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400748227] [2023-01-28 06:30:42,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:42,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-28 06:30:42,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:42,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400748227] [2023-01-28 06:30:42,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400748227] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:42,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:30:42,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:30:42,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001303540] [2023-01-28 06:30:42,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:42,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:30:42,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:42,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:30:42,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:30:42,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 412 [2023-01-28 06:30:42,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 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:30:42,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:42,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 412 [2023-01-28 06:30:42,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:50,336 INFO L130 PetriNetUnfolder]: 87085/119079 cut-off events. [2023-01-28 06:30:50,336 INFO L131 PetriNetUnfolder]: For 52521/52521 co-relation queries the response was YES. [2023-01-28 06:30:50,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291047 conditions, 119079 events. 87085/119079 cut-off events. For 52521/52521 co-relation queries the response was YES. Maximal size of possible extension queue 4977. Compared 830885 event pairs, 43332 based on Foata normal form. 0/97207 useless extension candidates. Maximal degree in co-relation 291034. Up to 75826 conditions per place. [2023-01-28 06:30:50,973 INFO L137 encePairwiseOnDemand]: 405/412 looper letters, 81 selfloop transitions, 14 changer transitions 0/102 dead transitions. [2023-01-28 06:30:50,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 102 transitions, 565 flow [2023-01-28 06:30:50,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:30:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:30:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2023-01-28 06:30:50,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436084142394822 [2023-01-28 06:30:50,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 539 transitions. [2023-01-28 06:30:50,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 539 transitions. [2023-01-28 06:30:50,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:50,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 539 transitions. [2023-01-28 06:30:50,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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:30:50,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 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:30:50,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 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:30:50,976 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 230 flow. Second operand 3 states and 539 transitions. [2023-01-28 06:30:50,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 102 transitions, 565 flow [2023-01-28 06:30:51,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 561 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 06:30:51,023 INFO L231 Difference]: Finished difference. Result has 65 places, 71 transitions, 352 flow [2023-01-28 06:30:51,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=65, PETRI_TRANSITIONS=71} [2023-01-28 06:30:51,023 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2023-01-28 06:30:51,023 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 71 transitions, 352 flow [2023-01-28 06:30:51,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 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:30:51,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:51,024 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:51,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-01-28 06:30:51,024 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:30:51,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:51,024 INFO L85 PathProgramCache]: Analyzing trace with hash -632120706, now seen corresponding path program 1 times [2023-01-28 06:30:51,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:51,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648056713] [2023-01-28 06:30:51,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:51,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:30:51,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:51,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648056713] [2023-01-28 06:30:51,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648056713] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:30:51,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350008576] [2023-01-28 06:30:51,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:51,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:30:51,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:30:51,057 INFO L229 MonitoredProcess]: Starting monitored process 11 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:30:51,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-28 06:30:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:51,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 06:30:51,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:30:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:30:51,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:30:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:30:51,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350008576] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:30:51,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:30:51,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-01-28 06:30:51,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057931610] [2023-01-28 06:30:51,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:30:51,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:30:51,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:51,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:30:51,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:30:51,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 412 [2023-01-28 06:30:51,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 71 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 176.6) internal successors, (883), 5 states have internal predecessors, (883), 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:30:51,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:51,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 412 [2023-01-28 06:30:51,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:30:54,442 INFO L130 PetriNetUnfolder]: 30977/46901 cut-off events. [2023-01-28 06:30:54,442 INFO L131 PetriNetUnfolder]: For 27668/33621 co-relation queries the response was YES. [2023-01-28 06:30:54,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115280 conditions, 46901 events. 30977/46901 cut-off events. For 27668/33621 co-relation queries the response was YES. Maximal size of possible extension queue 2209. Compared 368566 event pairs, 13766 based on Foata normal form. 210/40112 useless extension candidates. Maximal degree in co-relation 115266. Up to 30913 conditions per place. [2023-01-28 06:30:54,941 INFO L137 encePairwiseOnDemand]: 409/412 looper letters, 76 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2023-01-28 06:30:54,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 118 transitions, 680 flow [2023-01-28 06:30:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:30:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:30:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 763 transitions. [2023-01-28 06:30:54,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46298543689320387 [2023-01-28 06:30:54,943 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 763 transitions. [2023-01-28 06:30:54,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 763 transitions. [2023-01-28 06:30:54,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:30:54,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 763 transitions. [2023-01-28 06:30:54,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 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:30:54,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 412.0) internal successors, (2060), 5 states have internal predecessors, (2060), 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:30:54,945 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 412.0) internal successors, (2060), 5 states have internal predecessors, (2060), 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:30:54,945 INFO L175 Difference]: Start difference. First operand has 65 places, 71 transitions, 352 flow. Second operand 4 states and 763 transitions. [2023-01-28 06:30:54,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 118 transitions, 680 flow [2023-01-28 06:30:55,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 118 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:30:55,002 INFO L231 Difference]: Finished difference. Result has 67 places, 72 transitions, 340 flow [2023-01-28 06:30:55,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=67, PETRI_TRANSITIONS=72} [2023-01-28 06:30:55,003 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2023-01-28 06:30:55,003 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 72 transitions, 340 flow [2023-01-28 06:30:55,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.6) internal successors, (883), 5 states have internal predecessors, (883), 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:30:55,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:30:55,003 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:30:55,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-28 06:30:55,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-01-28 06:30:55,204 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:30:55,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:30:55,204 INFO L85 PathProgramCache]: Analyzing trace with hash 602199332, now seen corresponding path program 2 times [2023-01-28 06:30:55,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:30:55,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126792970] [2023-01-28 06:30:55,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:30:55,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:30:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:30:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 06:30:55,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:30:55,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126792970] [2023-01-28 06:30:55,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126792970] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:30:55,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730559262] [2023-01-28 06:30:55,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 06:30:55,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:30:55,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:30:55,242 INFO L229 MonitoredProcess]: Starting monitored process 12 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:30:55,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-28 06:30:55,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 06:30:55,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:30:55,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 06:30:55,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:30:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 06:30:55,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 06:30:55,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730559262] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:30:55,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 06:30:55,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-01-28 06:30:55,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43998737] [2023-01-28 06:30:55,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:30:55,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:30:55,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:30:55,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:30:55,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:30:55,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 412 [2023-01-28 06:30:55,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 72 transitions, 340 flow. Second operand has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 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:30:55,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:30:55,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 412 [2023-01-28 06:30:55,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:31:05,808 INFO L130 PetriNetUnfolder]: 113375/156451 cut-off events. [2023-01-28 06:31:05,809 INFO L131 PetriNetUnfolder]: For 104399/104399 co-relation queries the response was YES. [2023-01-28 06:31:06,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411032 conditions, 156451 events. 113375/156451 cut-off events. For 104399/104399 co-relation queries the response was YES. Maximal size of possible extension queue 6431. Compared 1157414 event pairs, 50552 based on Foata normal form. 0/130849 useless extension candidates. Maximal degree in co-relation 411017. Up to 84722 conditions per place. [2023-01-28 06:31:07,027 INFO L137 encePairwiseOnDemand]: 402/412 looper letters, 158 selfloop transitions, 32 changer transitions 0/197 dead transitions. [2023-01-28 06:31:07,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 197 transitions, 1188 flow [2023-01-28 06:31:07,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:31:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:31:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1043 transitions. [2023-01-28 06:31:07,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42192556634304207 [2023-01-28 06:31:07,028 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1043 transitions. [2023-01-28 06:31:07,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1043 transitions. [2023-01-28 06:31:07,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:31:07,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1043 transitions. [2023-01-28 06:31:07,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 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:31:07,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 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:31:07,031 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 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:31:07,031 INFO L175 Difference]: Start difference. First operand has 67 places, 72 transitions, 340 flow. Second operand 6 states and 1043 transitions. [2023-01-28 06:31:07,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 197 transitions, 1188 flow [2023-01-28 06:31:07,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 197 transitions, 1180 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 06:31:07,085 INFO L231 Difference]: Finished difference. Result has 74 places, 91 transitions, 594 flow [2023-01-28 06:31:07,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=594, PETRI_PLACES=74, PETRI_TRANSITIONS=91} [2023-01-28 06:31:07,085 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2023-01-28 06:31:07,085 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 91 transitions, 594 flow [2023-01-28 06:31:07,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 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:31:07,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:31:07,085 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:31:07,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-28 06:31:07,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2023-01-28 06:31:07,286 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:31:07,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:31:07,286 INFO L85 PathProgramCache]: Analyzing trace with hash -628959772, now seen corresponding path program 3 times [2023-01-28 06:31:07,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:31:07,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247728655] [2023-01-28 06:31:07,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:31:07,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:31:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:31:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 06:31:07,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:31:07,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247728655] [2023-01-28 06:31:07,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247728655] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:31:07,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35071672] [2023-01-28 06:31:07,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 06:31:07,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:31:07,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:31:07,326 INFO L229 MonitoredProcess]: Starting monitored process 13 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:31:07,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-28 06:31:07,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-01-28 06:31:07,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:31:07,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 06:31:07,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:31:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 06:31:07,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 06:31:07,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35071672] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:31:07,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 06:31:07,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-01-28 06:31:07,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457304575] [2023-01-28 06:31:07,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:31:07,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:31:07,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:31:07,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:31:07,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:31:07,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 412 [2023-01-28 06:31:07,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 91 transitions, 594 flow. Second operand has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 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:31:07,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:31:07,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 412 [2023-01-28 06:31:07,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:31:22,401 INFO L130 PetriNetUnfolder]: 143479/202081 cut-off events. [2023-01-28 06:31:22,401 INFO L131 PetriNetUnfolder]: For 236524/236524 co-relation queries the response was YES. [2023-01-28 06:31:22,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562500 conditions, 202081 events. 143479/202081 cut-off events. For 236524/236524 co-relation queries the response was YES. Maximal size of possible extension queue 8899. Compared 1603197 event pairs, 80452 based on Foata normal form. 780/176724 useless extension candidates. Maximal degree in co-relation 562481. Up to 137654 conditions per place. [2023-01-28 06:31:23,773 INFO L137 encePairwiseOnDemand]: 402/412 looper letters, 187 selfloop transitions, 54 changer transitions 0/248 dead transitions. [2023-01-28 06:31:23,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 248 transitions, 1948 flow [2023-01-28 06:31:23,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:31:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:31:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1042 transitions. [2023-01-28 06:31:23,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4215210355987055 [2023-01-28 06:31:23,774 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1042 transitions. [2023-01-28 06:31:23,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1042 transitions. [2023-01-28 06:31:23,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:31:23,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1042 transitions. [2023-01-28 06:31:23,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.66666666666666) internal successors, (1042), 6 states have internal predecessors, (1042), 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:31:23,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 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:31:23,777 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 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:31:23,777 INFO L175 Difference]: Start difference. First operand has 74 places, 91 transitions, 594 flow. Second operand 6 states and 1042 transitions. [2023-01-28 06:31:23,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 248 transitions, 1948 flow [2023-01-28 06:31:28,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 248 transitions, 1948 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:31:28,033 INFO L231 Difference]: Finished difference. Result has 83 places, 141 transitions, 1370 flow [2023-01-28 06:31:28,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1370, PETRI_PLACES=83, PETRI_TRANSITIONS=141} [2023-01-28 06:31:28,033 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-01-28 06:31:28,033 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 141 transitions, 1370 flow [2023-01-28 06:31:28,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 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:31:28,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:31:28,034 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:31:28,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-28 06:31:28,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:31:28,234 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:31:28,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:31:28,234 INFO L85 PathProgramCache]: Analyzing trace with hash -156028, now seen corresponding path program 1 times [2023-01-28 06:31:28,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:31:28,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077343568] [2023-01-28 06:31:28,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:31:28,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:31:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:31:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 06:31:28,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:31:28,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077343568] [2023-01-28 06:31:28,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077343568] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:31:28,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320445254] [2023-01-28 06:31:28,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:31:28,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:31:28,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:31:28,267 INFO L229 MonitoredProcess]: Starting monitored process 14 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:31:28,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-28 06:31:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:31:28,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 06:31:28,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:31:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 06:31:28,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:31:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 06:31:28,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320445254] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:31:28,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:31:28,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-01-28 06:31:28,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884800263] [2023-01-28 06:31:28,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:31:28,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:31:28,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:31:28,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:31:28,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:31:28,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 412 [2023-01-28 06:31:28,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 141 transitions, 1370 flow. Second operand has 5 states, 5 states have (on average 176.6) internal successors, (883), 5 states have internal predecessors, (883), 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:31:28,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:31:28,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 412 [2023-01-28 06:31:28,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:31:33,810 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][42], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), Black: 235#(<= |thr1Thread1of4ForFork0_findMax_~i~0#1| (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1)), Black: 215#true, 415#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), 196#true, 120#L714-1true, Black: 223#(= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|), Black: 403#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 8#L718true, Black: 412#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 387#(<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 228#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 422#true, Black: 487#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 489#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 475#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 497#true, Black: 471#(< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 135#L729-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:31:33,811 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-01-28 06:31:33,811 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:31:33,811 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:31:33,811 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:31:33,883 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][42], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 133#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 489#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), Black: 235#(<= |thr1Thread1of4ForFork0_findMax_~i~0#1| (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1)), Black: 215#true, 196#true, 120#L714-1true, Black: 223#(= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|), Black: 403#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), Black: 412#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 387#(<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 415#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 228#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 487#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 475#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), Black: 471#(< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 497#true, 347#true, 135#L729-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:31:33,883 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-01-28 06:31:33,883 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:31:33,883 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:31:33,884 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:31:33,884 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][42], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 489#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), Black: 235#(<= |thr1Thread1of4ForFork0_findMax_~i~0#1| (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1)), Black: 215#true, 196#true, 120#L714-1true, Black: 223#(= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|), Black: 403#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 8#L718true, Black: 412#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 387#(<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 415#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 228#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 487#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 475#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), Black: 471#(< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 497#true, 347#true, 135#L729-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:31:33,884 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-01-28 06:31:33,884 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:31:33,884 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:31:33,884 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 06:31:34,519 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][42], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 133#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), Black: 235#(<= |thr1Thread1of4ForFork0_findMax_~i~0#1| (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1)), 415#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 215#true, 196#true, 120#L714-1true, Black: 223#(= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|), Black: 403#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), Black: 412#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 387#(<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 228#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 422#true, Black: 487#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 489#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 475#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), Black: 471#(< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 497#true, 135#L729-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:31:34,519 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-01-28 06:31:34,519 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:31:34,519 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 06:31:34,519 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 06:31:35,306 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][42], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 133#thr1EXITtrue, 109#L729-4true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), Black: 235#(<= |thr1Thread1of4ForFork0_findMax_~i~0#1| (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1)), Black: 215#true, 415#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), 196#true, 120#L714-1true, Black: 223#(= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|), Black: 403#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), Black: 412#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 387#(<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 228#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 422#true, Black: 487#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 489#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 475#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 497#true, Black: 471#(< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-01-28 06:31:35,306 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-01-28 06:31:35,307 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-01-28 06:31:35,307 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-01-28 06:31:35,307 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-01-28 06:31:35,939 INFO L130 PetriNetUnfolder]: 54953/87625 cut-off events. [2023-01-28 06:31:35,939 INFO L131 PetriNetUnfolder]: For 162523/192271 co-relation queries the response was YES. [2023-01-28 06:31:36,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242663 conditions, 87625 events. 54953/87625 cut-off events. For 162523/192271 co-relation queries the response was YES. Maximal size of possible extension queue 4544. Compared 809273 event pairs, 32870 based on Foata normal form. 1767/77177 useless extension candidates. Maximal degree in co-relation 242639. Up to 60836 conditions per place. [2023-01-28 06:31:36,637 INFO L137 encePairwiseOnDemand]: 409/412 looper letters, 86 selfloop transitions, 3 changer transitions 0/188 dead transitions. [2023-01-28 06:31:36,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 188 transitions, 1730 flow [2023-01-28 06:31:36,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:31:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:31:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 761 transitions. [2023-01-28 06:31:36,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46177184466019416 [2023-01-28 06:31:36,638 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 761 transitions. [2023-01-28 06:31:36,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 761 transitions. [2023-01-28 06:31:36,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:31:36,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 761 transitions. [2023-01-28 06:31:36,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 190.25) internal successors, (761), 4 states have internal predecessors, (761), 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:31:36,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 412.0) internal successors, (2060), 5 states have internal predecessors, (2060), 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:31:36,640 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 412.0) internal successors, (2060), 5 states have internal predecessors, (2060), 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:31:36,640 INFO L175 Difference]: Start difference. First operand has 83 places, 141 transitions, 1370 flow. Second operand 4 states and 761 transitions. [2023-01-28 06:31:36,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 188 transitions, 1730 flow [2023-01-28 06:31:37,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 188 transitions, 1692 flow, removed 19 selfloop flow, removed 0 redundant places. [2023-01-28 06:31:37,627 INFO L231 Difference]: Finished difference. Result has 87 places, 142 transitions, 1348 flow [2023-01-28 06:31:37,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1348, PETRI_PLACES=87, PETRI_TRANSITIONS=142} [2023-01-28 06:31:37,628 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2023-01-28 06:31:37,628 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 142 transitions, 1348 flow [2023-01-28 06:31:37,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.6) internal successors, (883), 5 states have internal predecessors, (883), 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:31:37,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:31:37,628 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:31:37,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-01-28 06:31:37,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2023-01-28 06:31:37,829 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:31:37,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:31:37,829 INFO L85 PathProgramCache]: Analyzing trace with hash -753939769, now seen corresponding path program 1 times [2023-01-28 06:31:37,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:31:37,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665976303] [2023-01-28 06:31:37,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:31:37,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:31:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:31:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-01-28 06:31:37,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:31:37,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665976303] [2023-01-28 06:31:37,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665976303] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:31:37,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:31:37,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:31:37,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285628369] [2023-01-28 06:31:37,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:31:37,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:31:37,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:31:37,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:31:37,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:31:37,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 412 [2023-01-28 06:31:37,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 142 transitions, 1348 flow. Second operand has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 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:31:38,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:31:38,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 412 [2023-01-28 06:31:38,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:32:05,506 INFO L130 PetriNetUnfolder]: 213630/292988 cut-off events. [2023-01-28 06:32:05,506 INFO L131 PetriNetUnfolder]: For 612145/612145 co-relation queries the response was YES. [2023-01-28 06:32:06,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908410 conditions, 292988 events. 213630/292988 cut-off events. For 612145/612145 co-relation queries the response was YES. Maximal size of possible extension queue 11430. Compared 2263025 event pairs, 42377 based on Foata normal form. 0/261306 useless extension candidates. Maximal degree in co-relation 908384. Up to 133327 conditions per place. [2023-01-28 06:32:07,960 INFO L137 encePairwiseOnDemand]: 401/412 looper letters, 209 selfloop transitions, 136 changer transitions 0/352 dead transitions. [2023-01-28 06:32:07,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 352 transitions, 3829 flow [2023-01-28 06:32:07,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:32:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:32:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 914 transitions. [2023-01-28 06:32:07,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4436893203883495 [2023-01-28 06:32:07,961 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 914 transitions. [2023-01-28 06:32:07,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 914 transitions. [2023-01-28 06:32:07,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:32:07,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 914 transitions. [2023-01-28 06:32:07,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.8) internal successors, (914), 5 states have internal predecessors, (914), 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:32:07,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 412.0) internal successors, (2472), 6 states have internal predecessors, (2472), 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:32:07,964 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 412.0) internal successors, (2472), 6 states have internal predecessors, (2472), 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:32:07,965 INFO L175 Difference]: Start difference. First operand has 87 places, 142 transitions, 1348 flow. Second operand 5 states and 914 transitions. [2023-01-28 06:32:07,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 352 transitions, 3829 flow [2023-01-28 06:32:22,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 352 transitions, 3797 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-01-28 06:32:22,586 INFO L231 Difference]: Finished difference. Result has 93 places, 233 transitions, 3106 flow [2023-01-28 06:32:22,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3106, PETRI_PLACES=93, PETRI_TRANSITIONS=233} [2023-01-28 06:32:22,586 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 42 predicate places. [2023-01-28 06:32:22,586 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 233 transitions, 3106 flow [2023-01-28 06:32:22,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 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:32:22,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:32:22,586 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:32:22,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-01-28 06:32:22,587 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:32:22,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:32:22,587 INFO L85 PathProgramCache]: Analyzing trace with hash -650424333, now seen corresponding path program 2 times [2023-01-28 06:32:22,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:32:22,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500231217] [2023-01-28 06:32:22,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:32:22,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:32:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:32:22,623 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:32:22,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:32:22,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500231217] [2023-01-28 06:32:22,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500231217] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:32:22,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:32:22,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:32:22,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229391705] [2023-01-28 06:32:22,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:32:22,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:32:22,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:32:22,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:32:22,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:32:22,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 412 [2023-01-28 06:32:22,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 233 transitions, 3106 flow. Second operand has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 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:32:22,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:32:22,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 412 [2023-01-28 06:32:22,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:32:56,814 INFO L130 PetriNetUnfolder]: 247842/345304 cut-off events. [2023-01-28 06:32:56,814 INFO L131 PetriNetUnfolder]: For 1019772/1019772 co-relation queries the response was YES. [2023-01-28 06:32:58,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165152 conditions, 345304 events. 247842/345304 cut-off events. For 1019772/1019772 co-relation queries the response was YES. Maximal size of possible extension queue 14369. Compared 2825282 event pairs, 149114 based on Foata normal form. 996/327168 useless extension candidates. Maximal degree in co-relation 1165123. Up to 266851 conditions per place. [2023-01-28 06:32:59,842 INFO L137 encePairwiseOnDemand]: 402/412 looper letters, 329 selfloop transitions, 109 changer transitions 0/445 dead transitions. [2023-01-28 06:32:59,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 445 transitions, 5915 flow [2023-01-28 06:32:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:32:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:32:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1043 transitions. [2023-01-28 06:32:59,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42192556634304207 [2023-01-28 06:32:59,843 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1043 transitions. [2023-01-28 06:32:59,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1043 transitions. [2023-01-28 06:32:59,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:32:59,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1043 transitions. [2023-01-28 06:32:59,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 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:32:59,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 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:32:59,846 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 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:32:59,846 INFO L175 Difference]: Start difference. First operand has 93 places, 233 transitions, 3106 flow. Second operand 6 states and 1043 transitions. [2023-01-28 06:32:59,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 445 transitions, 5915 flow [2023-01-28 06:34:37,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 445 transitions, 5843 flow, removed 36 selfloop flow, removed 0 redundant places. [2023-01-28 06:34:37,805 INFO L231 Difference]: Finished difference. Result has 102 places, 325 transitions, 4909 flow [2023-01-28 06:34:37,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=3074, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4909, PETRI_PLACES=102, PETRI_TRANSITIONS=325} [2023-01-28 06:34:37,805 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 51 predicate places. [2023-01-28 06:34:37,805 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 325 transitions, 4909 flow [2023-01-28 06:34:37,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 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:34:37,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:34:37,806 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:34:37,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-01-28 06:34:37,806 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:34:37,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:34:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1331678785, now seen corresponding path program 3 times [2023-01-28 06:34:37,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:34:37,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18858690] [2023-01-28 06:34:37,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:34:37,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:34:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:34:37,841 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:34:37,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:34:37,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18858690] [2023-01-28 06:34:37,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18858690] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:34:37,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:34:37,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:34:37,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286039809] [2023-01-28 06:34:37,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:34:37,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:34:37,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:34:37,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:34:37,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:34:37,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 412 [2023-01-28 06:34:37,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 325 transitions, 4909 flow. Second operand has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 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:34:37,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:34:37,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 412 [2023-01-28 06:34:37,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:35:23,352 INFO L130 PetriNetUnfolder]: 271154/379300 cut-off events. [2023-01-28 06:35:23,352 INFO L131 PetriNetUnfolder]: For 1433484/1433484 co-relation queries the response was YES. [2023-01-28 06:35:25,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353261 conditions, 379300 events. 271154/379300 cut-off events. For 1433484/1433484 co-relation queries the response was YES. Maximal size of possible extension queue 16577. Compared 3182351 event pairs, 121372 based on Foata normal form. 870/359990 useless extension candidates. Maximal degree in co-relation 1353227. Up to 203677 conditions per place. [2023-01-28 06:35:27,027 INFO L137 encePairwiseOnDemand]: 402/412 looper letters, 288 selfloop transitions, 208 changer transitions 0/503 dead transitions. [2023-01-28 06:35:27,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 503 transitions, 7484 flow [2023-01-28 06:35:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:35:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:35:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1042 transitions. [2023-01-28 06:35:27,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4215210355987055 [2023-01-28 06:35:27,029 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1042 transitions. [2023-01-28 06:35:27,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1042 transitions. [2023-01-28 06:35:27,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:35:27,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1042 transitions. [2023-01-28 06:35:27,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.66666666666666) internal successors, (1042), 6 states have internal predecessors, (1042), 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:35:27,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 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:35:27,032 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 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:35:27,032 INFO L175 Difference]: Start difference. First operand has 102 places, 325 transitions, 4909 flow. Second operand 6 states and 1042 transitions. [2023-01-28 06:35:27,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 503 transitions, 7484 flow [2023-01-28 06:38:25,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 503 transitions, 7294 flow, removed 95 selfloop flow, removed 0 redundant places. [2023-01-28 06:38:25,071 INFO L231 Difference]: Finished difference. Result has 111 places, 376 transitions, 6360 flow [2023-01-28 06:38:25,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=4751, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6360, PETRI_PLACES=111, PETRI_TRANSITIONS=376} [2023-01-28 06:38:25,072 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 60 predicate places. [2023-01-28 06:38:25,072 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 376 transitions, 6360 flow [2023-01-28 06:38:25,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 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:38:25,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:38:25,072 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:38:25,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2023-01-28 06:38:25,072 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:38:25,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:38:25,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1241520557, now seen corresponding path program 1 times [2023-01-28 06:38:25,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:38:25,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657227594] [2023-01-28 06:38:25,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:38:25,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:38:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:38:25,137 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:38:25,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:38:25,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657227594] [2023-01-28 06:38:25,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657227594] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:38:25,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:38:25,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:38:25,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641722668] [2023-01-28 06:38:25,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:38:25,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:38:25,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:38:25,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:38:25,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:38:25,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 412 [2023-01-28 06:38:25,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 376 transitions, 6360 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 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:38:25,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:38:25,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 412 [2023-01-28 06:38:25,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:38:34,460 INFO L130 PetriNetUnfolder]: 48295/79703 cut-off events. [2023-01-28 06:38:34,461 INFO L131 PetriNetUnfolder]: For 349776/356326 co-relation queries the response was YES. [2023-01-28 06:38:34,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285060 conditions, 79703 events. 48295/79703 cut-off events. For 349776/356326 co-relation queries the response was YES. Maximal size of possible extension queue 2886. Compared 731638 event pairs, 17868 based on Foata normal form. 1262/77196 useless extension candidates. Maximal degree in co-relation 285021. Up to 39973 conditions per place. [2023-01-28 06:38:35,440 INFO L137 encePairwiseOnDemand]: 404/412 looper letters, 96 selfloop transitions, 8 changer transitions 0/293 dead transitions. [2023-01-28 06:38:35,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 293 transitions, 4499 flow [2023-01-28 06:38:35,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:38:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:38:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2023-01-28 06:38:35,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47896440129449835 [2023-01-28 06:38:35,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 592 transitions. [2023-01-28 06:38:35,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 592 transitions. [2023-01-28 06:38:35,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:38:35,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 592 transitions. [2023-01-28 06:38:35,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:38:35,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 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:38:35,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 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:38:35,444 INFO L175 Difference]: Start difference. First operand has 111 places, 376 transitions, 6360 flow. Second operand 3 states and 592 transitions. [2023-01-28 06:38:35,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 293 transitions, 4499 flow [2023-01-28 06:38:47,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 293 transitions, 4361 flow, removed 69 selfloop flow, removed 0 redundant places. [2023-01-28 06:38:47,828 INFO L231 Difference]: Finished difference. Result has 113 places, 246 transitions, 3768 flow [2023-01-28 06:38:47,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=3752, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3768, PETRI_PLACES=113, PETRI_TRANSITIONS=246} [2023-01-28 06:38:47,829 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 62 predicate places. [2023-01-28 06:38:47,829 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 246 transitions, 3768 flow [2023-01-28 06:38:47,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 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:38:47,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:38:47,829 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:38:47,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2023-01-28 06:38:47,829 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:38:47,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:38:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash -251650996, now seen corresponding path program 1 times [2023-01-28 06:38:47,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:38:47,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777567386] [2023-01-28 06:38:47,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:38:47,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:38:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:38:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-01-28 06:38:47,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:38:47,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777567386] [2023-01-28 06:38:47,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777567386] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:38:47,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166143819] [2023-01-28 06:38:47,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:38:47,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:38:47,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:38:47,870 INFO L229 MonitoredProcess]: Starting monitored process 15 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:38:47,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-28 06:38:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:38:47,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 06:38:47,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:38:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-01-28 06:38:47,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:38:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-01-28 06:38:47,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166143819] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:38:47,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:38:47,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-01-28 06:38:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511983716] [2023-01-28 06:38:47,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:38:47,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:38:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:38:47,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:38:47,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:38:47,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 412 [2023-01-28 06:38:47,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 246 transitions, 3768 flow. Second operand has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 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:38:47,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:38:47,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 412 [2023-01-28 06:38:47,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:38:57,236 INFO L130 PetriNetUnfolder]: 54615/83725 cut-off events. [2023-01-28 06:38:57,236 INFO L131 PetriNetUnfolder]: For 352257/360104 co-relation queries the response was YES. [2023-01-28 06:38:58,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305851 conditions, 83725 events. 54615/83725 cut-off events. For 352257/360104 co-relation queries the response was YES. Maximal size of possible extension queue 2966. Compared 701537 event pairs, 25129 based on Foata normal form. 1652/83754 useless extension candidates. Maximal degree in co-relation 305811. Up to 55352 conditions per place. [2023-01-28 06:38:58,304 INFO L137 encePairwiseOnDemand]: 409/412 looper letters, 143 selfloop transitions, 3 changer transitions 0/335 dead transitions. [2023-01-28 06:38:58,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 335 transitions, 4810 flow [2023-01-28 06:38:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:38:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:38:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 759 transitions. [2023-01-28 06:38:58,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46055825242718446 [2023-01-28 06:38:58,306 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 759 transitions. [2023-01-28 06:38:58,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 759 transitions. [2023-01-28 06:38:58,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:38:58,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 759 transitions. [2023-01-28 06:38:58,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 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:38:58,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 412.0) internal successors, (2060), 5 states have internal predecessors, (2060), 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:38:58,309 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 412.0) internal successors, (2060), 5 states have internal predecessors, (2060), 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:38:58,309 INFO L175 Difference]: Start difference. First operand has 113 places, 246 transitions, 3768 flow. Second operand 4 states and 759 transitions. [2023-01-28 06:38:58,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 335 transitions, 4810 flow [2023-01-28 06:39:03,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 335 transitions, 4790 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:39:03,917 INFO L231 Difference]: Finished difference. Result has 116 places, 247 transitions, 3776 flow [2023-01-28 06:39:03,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=3760, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3776, PETRI_PLACES=116, PETRI_TRANSITIONS=247} [2023-01-28 06:39:03,918 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 65 predicate places. [2023-01-28 06:39:03,918 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 247 transitions, 3776 flow [2023-01-28 06:39:03,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 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:39:03,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:39:03,918 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:39:03,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-01-28 06:39:04,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:39:04,119 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:39:04,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:39:04,119 INFO L85 PathProgramCache]: Analyzing trace with hash -423676854, now seen corresponding path program 2 times [2023-01-28 06:39:04,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:39:04,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663202014] [2023-01-28 06:39:04,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:39:04,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:39:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:39:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-01-28 06:39:04,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:39:04,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663202014] [2023-01-28 06:39:04,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663202014] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:39:04,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:39:04,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:39:04,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159693250] [2023-01-28 06:39:04,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:39:04,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:39:04,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:39:04,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:39:04,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:39:04,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 412 [2023-01-28 06:39:04,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 247 transitions, 3776 flow. Second operand has 5 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 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:39:04,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:39:04,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 412 [2023-01-28 06:39:04,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:39:23,213 INFO L130 PetriNetUnfolder]: 111369/165873 cut-off events. [2023-01-28 06:39:23,214 INFO L131 PetriNetUnfolder]: For 678952/678952 co-relation queries the response was YES. [2023-01-28 06:39:24,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611827 conditions, 165873 events. 111369/165873 cut-off events. For 678952/678952 co-relation queries the response was YES. Maximal size of possible extension queue 6760. Compared 1424121 event pairs, 53479 based on Foata normal form. 1000/163154 useless extension candidates. Maximal degree in co-relation 611785. Up to 83886 conditions per place. [2023-01-28 06:39:25,298 INFO L137 encePairwiseOnDemand]: 402/412 looper letters, 274 selfloop transitions, 172 changer transitions 2/455 dead transitions. [2023-01-28 06:39:25,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 455 transitions, 6850 flow [2023-01-28 06:39:25,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:39:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:39:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1035 transitions. [2023-01-28 06:39:25,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186893203883495 [2023-01-28 06:39:25,301 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1035 transitions. [2023-01-28 06:39:25,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1035 transitions. [2023-01-28 06:39:25,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:39:25,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1035 transitions. [2023-01-28 06:39:25,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.5) internal successors, (1035), 6 states have internal predecessors, (1035), 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:39:25,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 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:39:25,320 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 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:39:25,320 INFO L175 Difference]: Start difference. First operand has 116 places, 247 transitions, 3776 flow. Second operand 6 states and 1035 transitions. [2023-01-28 06:39:25,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 455 transitions, 6850 flow [2023-01-28 06:39:54,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 455 transitions, 6834 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-28 06:39:54,050 INFO L231 Difference]: Finished difference. Result has 123 places, 311 transitions, 5503 flow [2023-01-28 06:39:54,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=3733, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5503, PETRI_PLACES=123, PETRI_TRANSITIONS=311} [2023-01-28 06:39:54,051 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 72 predicate places. [2023-01-28 06:39:54,051 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 311 transitions, 5503 flow [2023-01-28 06:39:54,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 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:39:54,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:39:54,051 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:39:54,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2023-01-28 06:39:54,052 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:39:54,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:39:54,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1676756770, now seen corresponding path program 1 times [2023-01-28 06:39:54,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:39:54,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066431407] [2023-01-28 06:39:54,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:39:54,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:39:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:39:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-01-28 06:39:54,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:39:54,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066431407] [2023-01-28 06:39:54,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066431407] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:39:54,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:39:54,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:39:54,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352021783] [2023-01-28 06:39:54,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:39:54,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:39:54,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:39:54,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:39:54,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:39:54,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 412 [2023-01-28 06:39:54,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 311 transitions, 5503 flow. Second operand has 5 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 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:39:54,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:39:54,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 412 [2023-01-28 06:39:54,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:40:17,351 INFO L130 PetriNetUnfolder]: 120241/181233 cut-off events. [2023-01-28 06:40:17,351 INFO L131 PetriNetUnfolder]: For 872865/872865 co-relation queries the response was YES. [2023-01-28 06:40:18,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688078 conditions, 181233 events. 120241/181233 cut-off events. For 872865/872865 co-relation queries the response was YES. Maximal size of possible extension queue 8476. Compared 1605206 event pairs, 60607 based on Foata normal form. 1082/181748 useless extension candidates. Maximal degree in co-relation 688032. Up to 92996 conditions per place. [2023-01-28 06:40:19,130 INFO L137 encePairwiseOnDemand]: 402/412 looper letters, 312 selfloop transitions, 206 changer transitions 5/530 dead transitions. [2023-01-28 06:40:19,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 530 transitions, 9027 flow [2023-01-28 06:40:19,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:40:19,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:40:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1033 transitions. [2023-01-28 06:40:19,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4178802588996764 [2023-01-28 06:40:19,131 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1033 transitions. [2023-01-28 06:40:19,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1033 transitions. [2023-01-28 06:40:19,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:40:19,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1033 transitions. [2023-01-28 06:40:19,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 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:40:19,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 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:40:19,134 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 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:40:19,134 INFO L175 Difference]: Start difference. First operand has 123 places, 311 transitions, 5503 flow. Second operand 6 states and 1033 transitions. [2023-01-28 06:40:19,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 530 transitions, 9027 flow [2023-01-28 06:41:02,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 530 transitions, 9027 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:41:02,589 INFO L231 Difference]: Finished difference. Result has 132 places, 362 transitions, 7283 flow [2023-01-28 06:41:02,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=5363, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7283, PETRI_PLACES=132, PETRI_TRANSITIONS=362} [2023-01-28 06:41:02,589 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 81 predicate places. [2023-01-28 06:41:02,589 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 362 transitions, 7283 flow [2023-01-28 06:41:02,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 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:41:02,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:41:02,590 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:41:02,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2023-01-28 06:41:02,590 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 06:41:02,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:41:02,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1345945472, now seen corresponding path program 1 times [2023-01-28 06:41:02,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:41:02,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131120481] [2023-01-28 06:41:02,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:41:02,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:41:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:41:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-01-28 06:41:02,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:41:02,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131120481] [2023-01-28 06:41:02,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131120481] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:41:02,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:41:02,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:41:02,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595181810] [2023-01-28 06:41:02,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:41:02,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:41:02,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:41:02,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:41:02,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:41:02,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 412 [2023-01-28 06:41:02,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 362 transitions, 7283 flow. Second operand has 5 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 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:41:02,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:41:02,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 412 [2023-01-28 06:41:02,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:41:31,537 INFO L130 PetriNetUnfolder]: 129480/198524 cut-off events. [2023-01-28 06:41:31,538 INFO L131 PetriNetUnfolder]: For 1215925/1215925 co-relation queries the response was YES. [2023-01-28 06:41:33,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788223 conditions, 198524 events. 129480/198524 cut-off events. For 1215925/1215925 co-relation queries the response was YES. Maximal size of possible extension queue 10848. Compared 1849377 event pairs, 62717 based on Foata normal form. 1224/199391 useless extension candidates. Maximal degree in co-relation 788172. Up to 97730 conditions per place. [2023-01-28 06:41:34,013 INFO L137 encePairwiseOnDemand]: 402/412 looper letters, 361 selfloop transitions, 246 changer transitions 3/617 dead transitions. [2023-01-28 06:41:34,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 617 transitions, 12028 flow [2023-01-28 06:41:34,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:41:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:41:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1034 transitions. [2023-01-28 06:41:34,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41828478964401294 [2023-01-28 06:41:34,015 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1034 transitions. [2023-01-28 06:41:34,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1034 transitions. [2023-01-28 06:41:34,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:41:34,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1034 transitions. [2023-01-28 06:41:34,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.33333333333334) internal successors, (1034), 6 states have internal predecessors, (1034), 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:41:34,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 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:41:34,017 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 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:41:34,017 INFO L175 Difference]: Start difference. First operand has 132 places, 362 transitions, 7283 flow. Second operand 6 states and 1034 transitions. [2023-01-28 06:41:34,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 617 transitions, 12028 flow Received shutdown request... [2023-01-28 06:42:13,243 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 06:42:14,252 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 [2023-01-28 06:42:15,143 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 06:42:15,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2023-01-28 06:42:15,144 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2023-01-28 06:42:15,144 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 06:42:15,144 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-01-28 06:42:15,144 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-01-28 06:42:15,144 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 06:42:15,144 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:15,144 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-01-28 06:42:15,145 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2023-01-28 06:42:15,145 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:42:15,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:42:15 BasicIcfg [2023-01-28 06:42:15,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:42:15,150 INFO L158 Benchmark]: Toolchain (without parser) took 750772.86ms. Allocated memory was 364.9MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 314.0MB in the beginning and 9.4GB in the end (delta: -9.1GB). Peak memory consumption was 7.9GB. Max. memory is 16.0GB. [2023-01-28 06:42:15,150 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:42:15,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.29ms. Allocated memory is still 364.9MB. Free memory was 313.8MB in the beginning and 338.2MB in the end (delta: -24.3MB). Peak memory consumption was 24.7MB. Max. memory is 16.0GB. [2023-01-28 06:42:15,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.09ms. Allocated memory is still 364.9MB. Free memory was 338.2MB in the beginning and 336.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:42:15,151 INFO L158 Benchmark]: Boogie Preprocessor took 31.25ms. Allocated memory is still 364.9MB. Free memory was 336.2MB in the beginning and 334.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:42:15,151 INFO L158 Benchmark]: RCFGBuilder took 431.04ms. Allocated memory is still 364.9MB. Free memory was 334.7MB in the beginning and 319.4MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-01-28 06:42:15,151 INFO L158 Benchmark]: TraceAbstraction took 749813.30ms. Allocated memory was 364.9MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 318.8MB in the beginning and 9.4GB in the end (delta: -9.1GB). Peak memory consumption was 7.9GB. Max. memory is 16.0GB. [2023-01-28 06:42:15,152 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 451.29ms. Allocated memory is still 364.9MB. Free memory was 313.8MB in the beginning and 338.2MB in the end (delta: -24.3MB). Peak memory consumption was 24.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 41.09ms. Allocated memory is still 364.9MB. Free memory was 338.2MB in the beginning and 336.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.25ms. Allocated memory is still 364.9MB. Free memory was 336.2MB in the beginning and 334.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 431.04ms. Allocated memory is still 364.9MB. Free memory was 334.7MB in the beginning and 319.4MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 749813.30ms. Allocated memory was 364.9MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 318.8MB in the beginning and 9.4GB in the end (delta: -9.1GB). Peak memory consumption was 7.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 73 PlacesBefore, 12 PlacesAfterwards, 78 TransitionsBefore, 10 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 5 FixpointIterations, 19 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 7 ChoiceCompositions, 81 TotalNumberOfCompositions, 894 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 869, independent: 857, independent conditional: 0, independent unconditional: 857, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 607, independent: 603, independent conditional: 0, independent unconditional: 603, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 869, independent: 254, independent conditional: 0, independent unconditional: 254, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 607, unknown conditional: 0, unknown unconditional: 607] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 73 PlacesBefore, 12 PlacesAfterwards, 78 TransitionsBefore, 10 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 7 ChoiceCompositions, 83 TotalNumberOfCompositions, 924 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 875, independent: 861, independent conditional: 0, independent unconditional: 861, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 603, independent: 599, independent conditional: 0, independent unconditional: 599, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 875, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 603, unknown conditional: 0, unknown unconditional: 603] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 113 PlacesBefore, 29 PlacesAfterwards, 123 TransitionsBefore, 32 TransitionsAfterwards, 6248 CoEnabledTransitionPairs, 7 FixpointIterations, 19 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 23 ConcurrentYvCompositions, 7 ChoiceCompositions, 115 TotalNumberOfCompositions, 9776 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6373, independent: 6188, independent conditional: 0, independent unconditional: 6188, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3383, independent: 3360, independent conditional: 0, independent unconditional: 3360, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6373, independent: 2828, independent conditional: 0, independent unconditional: 2828, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 3383, unknown conditional: 0, unknown unconditional: 3383] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 113 PlacesBefore, 29 PlacesAfterwards, 123 TransitionsBefore, 32 TransitionsAfterwards, 6248 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 20 ConcurrentYvCompositions, 7 ChoiceCompositions, 110 TotalNumberOfCompositions, 8937 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5923, independent: 5762, independent conditional: 0, independent unconditional: 5762, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3297, independent: 3275, independent conditional: 0, independent unconditional: 3275, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5923, independent: 2487, independent conditional: 0, independent unconditional: 2487, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 3297, unknown conditional: 0, unknown unconditional: 3297] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 153 PlacesBefore, 40 PlacesAfterwards, 168 TransitionsBefore, 45 TransitionsAfterwards, 15312 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 99 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 10 ChoiceCompositions, 161 TotalNumberOfCompositions, 23024 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13782, independent: 13546, independent conditional: 0, independent unconditional: 13546, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8210, independent: 8182, independent conditional: 0, independent unconditional: 8182, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 13782, independent: 5364, independent conditional: 0, independent unconditional: 5364, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 8210, unknown conditional: 0, unknown unconditional: 8210] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 153 PlacesBefore, 40 PlacesAfterwards, 168 TransitionsBefore, 45 TransitionsAfterwards, 15312 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 98 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 10 ChoiceCompositions, 158 TotalNumberOfCompositions, 23205 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13777, independent: 13537, independent conditional: 0, independent unconditional: 13537, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8012, independent: 7982, independent conditional: 0, independent unconditional: 7982, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 13777, independent: 5555, independent conditional: 0, independent unconditional: 5555, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 8012, unknown conditional: 0, unknown unconditional: 8012] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 169, Positive conditional cache size: 0, Positive unconditional cache size: 169, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 193 PlacesBefore, 51 PlacesAfterwards, 213 TransitionsBefore, 58 TransitionsAfterwards, 28336 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 126 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 41 ConcurrentYvCompositions, 13 ChoiceCompositions, 199 TotalNumberOfCompositions, 42708 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 23137, independent: 22823, independent conditional: 0, independent unconditional: 22823, dependent: 314, dependent conditional: 0, dependent unconditional: 314, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15003, independent: 14962, independent conditional: 0, independent unconditional: 14962, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 23137, independent: 7861, independent conditional: 0, independent unconditional: 7861, dependent: 273, dependent conditional: 0, dependent unconditional: 273, unknown: 15003, unknown conditional: 0, unknown unconditional: 15003] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 229, Positive conditional cache size: 0, Positive unconditional cache size: 229, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 109 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.9s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 2, 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.1s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 4 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, 147 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: 5.5s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 736 IncrementalHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 46 mSDtfsCounter, 736 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=11, InterpolantAutomatonStates: 45, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 274 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 461 SizeOfPredicates, 4 NumberOfNonLiveVariables, 592 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 76/84 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, 185 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: 24.3s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 961 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 961 mSDsluCounter, 258 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3700 IncrementalHoareTripleChecker+Invalid, 3764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 195 mSDtfsCounter, 3700 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 233 SyntacticMatches, 6 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1653occurred in iteration=13, InterpolantAutomatonStates: 125, 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.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 649 NumberOfCodeBlocks, 633 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 679 ConstructedInterpolants, 0 QuantifiedInterpolants, 1129 SizeOfPredicates, 4 NumberOfNonLiveVariables, 777 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 33 InterpolantComputations, 22 PerfectInterpolantSequences, 284/295 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 4 thread instances CFG has 6 procedures, 223 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 709.7s, OverallIterations: 19, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 704.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1170 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1170 mSDsluCounter, 279 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3242 IncrementalHoareTripleChecker+Invalid, 3292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 211 mSDtfsCounter, 3242 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 194 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7283occurred in iteration=18, InterpolantAutomatonStates: 76, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 453 NumberOfCodeBlocks, 437 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 797 SizeOfPredicates, 4 NumberOfNonLiveVariables, 760 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 186/197 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, 109 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.3s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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, 147 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.3s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 3 thread instances CFG has 5 procedures, 185 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: 2.6s, OverallIterations: 1, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred 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, 15 NumberOfCodeBlocks, 15 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 could not prove your program: Timeout Completed graceful shutdown