./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 963498115a8eca6e92c68ab7fa8168826446f05b9b398350c3ee0745adf1bb45 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:25:08,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:25:08,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:25:08,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:25:08,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:25:08,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:25:08,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:25:08,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:25:08,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:25:08,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:25:08,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:25:08,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:25:08,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:25:08,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:25:08,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:25:08,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:25:08,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:25:08,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:25:08,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:25:08,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:25:08,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:25:08,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:25:08,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:25:08,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:25:08,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:25:08,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:25:08,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:25:08,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:25:08,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:25:08,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:25:08,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:25:08,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:25:08,779 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:25:08,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:25:08,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:25:08,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:25:08,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:25:08,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:25:08,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:25:08,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:25:08,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:25:08,784 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:25:08,819 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:25:08,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:25:08,820 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:25:08,820 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:25:08,821 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:25:08,821 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:25:08,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:25:08,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:25:08,822 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:25:08,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:25:08,823 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:25:08,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:25:08,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:25:08,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:25:08,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:25:08,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:25:08,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:25:08,824 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:25:08,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:25:08,824 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:25:08,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:25:08,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:25:08,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:25:08,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:25:08,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:25:08,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:25:08,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:25:08,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:25:08,826 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:25:08,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:25:08,826 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:25:08,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:25:08,827 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:25:08,827 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:25:08,827 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:25:08,827 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 963498115a8eca6e92c68ab7fa8168826446f05b9b398350c3ee0745adf1bb45 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-08-30 16:25:09,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:25:09,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:25:09,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:25:09,166 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:25:09,166 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:25:09,168 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-08-30 16:25:10,401 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:25:10,700 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:25:10,702 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2023-08-30 16:25:10,718 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed75b7dc4/9ae4c9fef58148b781d54fc00732249b/FLAG6878dadb7 [2023-08-30 16:25:10,736 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed75b7dc4/9ae4c9fef58148b781d54fc00732249b [2023-08-30 16:25:10,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:25:10,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:25:10,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:25:10,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:25:10,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:25:10,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:25:10" (1/1) ... [2023-08-30 16:25:10,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d7222db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:25:10, skipping insertion in model container [2023-08-30 16:25:10,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:25:10" (1/1) ... [2023-08-30 16:25:10,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:25:10,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:25:11,119 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-08-30 16:25:11,131 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:25:11,139 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:25:11,209 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-08-30 16:25:11,215 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:25:11,253 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:25:11,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:25:11 WrapperNode [2023-08-30 16:25:11,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:25:11,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:25:11,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:25:11,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:25:11,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:25:11" (1/1) ... [2023-08-30 16:25:11,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:25:11" (1/1) ... [2023-08-30 16:25:11,288 INFO L138 Inliner]: procedures = 171, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2023-08-30 16:25:11,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:25:11,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:25:11,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:25:11,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:25:11,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:25:11" (1/1) ... [2023-08-30 16:25:11,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:25:11" (1/1) ... [2023-08-30 16:25:11,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:25:11" (1/1) ... [2023-08-30 16:25:11,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:25:11" (1/1) ... [2023-08-30 16:25:11,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:25:11" (1/1) ... [2023-08-30 16:25:11,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:25:11" (1/1) ... [2023-08-30 16:25:11,322 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:25:11" (1/1) ... [2023-08-30 16:25:11,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:25:11" (1/1) ... [2023-08-30 16:25:11,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:25:11,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:25:11,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:25:11,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:25:11,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:25:11" (1/1) ... [2023-08-30 16:25:11,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:25:11,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:25:11,365 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-08-30 16:25:11,367 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-08-30 16:25:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 16:25:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-30 16:25:11,396 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-30 16:25:11,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:25:11,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:25:11,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:25:11,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:25:11,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:25:11,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:25:11,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:25:11,404 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:25:11,538 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:25:11,540 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:25:11,753 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:25:11,802 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:25:11,802 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-30 16:25:11,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:25:11 BoogieIcfgContainer [2023-08-30 16:25:11,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:25:11,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:25:11,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:25:11,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:25:11,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:25:10" (1/3) ... [2023-08-30 16:25:11,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f241fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:25:11, skipping insertion in model container [2023-08-30 16:25:11,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:25:11" (2/3) ... [2023-08-30 16:25:11,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f241fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:25:11, skipping insertion in model container [2023-08-30 16:25:11,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:25:11" (3/3) ... [2023-08-30 16:25:11,811 INFO L112 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2023-08-30 16:25:11,821 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:25:11,830 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:25:11,830 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 16:25:11,830 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:25:11,908 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:25:11,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 161 flow [2023-08-30 16:25:12,023 INFO L130 PetriNetUnfolder]: 9/88 cut-off events. [2023-08-30 16:25:12,023 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:25:12,028 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-08-30 16:25:12,028 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 78 transitions, 161 flow [2023-08-30 16:25:12,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 78 transitions, 161 flow [2023-08-30 16:25:12,034 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:25:12,046 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 78 transitions, 161 flow [2023-08-30 16:25:12,049 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 78 transitions, 161 flow [2023-08-30 16:25:12,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 161 flow [2023-08-30 16:25:12,068 INFO L130 PetriNetUnfolder]: 9/88 cut-off events. [2023-08-30 16:25:12,068 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:25:12,069 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-08-30 16:25:12,070 INFO L119 LiptonReduction]: Number of co-enabled transitions 1144 [2023-08-30 16:25:14,627 INFO L134 LiptonReduction]: Checked pairs total: 894 [2023-08-30 16:25:14,627 INFO L136 LiptonReduction]: Total number of compositions: 81 [2023-08-30 16:25:14,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:25:14,644 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=true, 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;@51b45307, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:25:14,644 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-30 16:25:14,647 INFO L130 PetriNetUnfolder]: 1/9 cut-off events. [2023-08-30 16:25:14,647 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:25:14,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:14,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 16:25:14,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:14,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:14,653 INFO L85 PathProgramCache]: Analyzing trace with hash 365604591, now seen corresponding path program 1 times [2023-08-30 16:25:14,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:14,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253983320] [2023-08-30 16:25:14,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:14,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:25:14,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:14,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253983320] [2023-08-30 16:25:14,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253983320] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:14,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:14,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:25:14,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900914197] [2023-08-30 16:25:14,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:14,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 16:25:14,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:14,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 16:25:14,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 16:25:14,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 159 [2023-08-30 16:25:14,861 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-08-30 16:25:14,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:14,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 159 [2023-08-30 16:25:14,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:14,890 INFO L130 PetriNetUnfolder]: 7/19 cut-off events. [2023-08-30 16:25:14,890 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:25:14,891 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-08-30 16:25:14,892 INFO L137 encePairwiseOnDemand]: 157/159 looper letters, 0 selfloop transitions, 0 changer transitions 8/8 dead transitions. [2023-08-30 16:25:14,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 11 places, 8 transitions, 35 flow [2023-08-30 16:25:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 16:25:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 16:25:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 147 transitions. [2023-08-30 16:25:14,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46226415094339623 [2023-08-30 16:25:14,906 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 147 transitions. [2023-08-30 16:25:14,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 147 transitions. [2023-08-30 16:25:14,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:14,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 147 transitions. [2023-08-30 16:25:14,916 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-08-30 16:25:14,922 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-08-30 16:25:14,922 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-08-30 16:25:14,924 INFO L175 Difference]: Start difference. First operand has 12 places, 10 transitions, 25 flow. Second operand 2 states and 147 transitions. [2023-08-30 16:25:14,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 11 places, 8 transitions, 35 flow [2023-08-30 16:25:14,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 11 places, 8 transitions, 35 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:25:14,927 INFO L231 Difference]: Finished difference. Result has 11 places, 0 transitions, 0 flow [2023-08-30 16:25:14,929 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-08-30 16:25:14,932 INFO L281 CegarLoopForPetriNet]: 12 programPoint places, -1 predicate places. [2023-08-30 16:25:14,933 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 0 transitions, 0 flow [2023-08-30 16:25:14,933 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-08-30 16:25:14,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-08-30 16:25:14,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-08-30 16:25:14,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:25:14,936 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-30 16:25:14,946 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE (1/2) [2023-08-30 16:25:14,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 161 flow [2023-08-30 16:25:14,969 INFO L130 PetriNetUnfolder]: 9/88 cut-off events. [2023-08-30 16:25:14,970 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:25:14,970 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-08-30 16:25:14,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 78 transitions, 161 flow [2023-08-30 16:25:14,971 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 78 transitions, 161 flow [2023-08-30 16:25:14,972 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:25:14,972 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 78 transitions, 161 flow [2023-08-30 16:25:14,972 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 78 transitions, 161 flow [2023-08-30 16:25:14,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 161 flow [2023-08-30 16:25:14,981 INFO L130 PetriNetUnfolder]: 9/88 cut-off events. [2023-08-30 16:25:14,982 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:25:14,982 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-08-30 16:25:14,983 INFO L119 LiptonReduction]: Number of co-enabled transitions 1144 [2023-08-30 16:25:17,111 INFO L134 LiptonReduction]: Checked pairs total: 924 [2023-08-30 16:25:17,111 INFO L136 LiptonReduction]: Total number of compositions: 83 [2023-08-30 16:25:17,112 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-30 16:25:17,113 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=true, 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;@51b45307, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:25:17,114 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-30 16:25:17,116 INFO L130 PetriNetUnfolder]: 1/11 cut-off events. [2023-08-30 16:25:17,117 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:25:17,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:17,117 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-30 16:25:17,117 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 16:25:17,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:17,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1011638020, now seen corresponding path program 1 times [2023-08-30 16:25:17,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:17,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111839796] [2023-08-30 16:25:17,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:17,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:25:17,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:25:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:25:17,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:25:17,183 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:25:17,183 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-30 16:25:17,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:25:17,184 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-30 16:25:17,184 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-30 16:25:17,185 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 16:25:17,185 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-30 16:25:17,204 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:25:17,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 123 transitions, 258 flow [2023-08-30 16:25:17,224 INFO L130 PetriNetUnfolder]: 17/145 cut-off events. [2023-08-30 16:25:17,225 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:25:17,226 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-08-30 16:25:17,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 123 transitions, 258 flow [2023-08-30 16:25:17,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 123 transitions, 258 flow [2023-08-30 16:25:17,228 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:25:17,228 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 123 transitions, 258 flow [2023-08-30 16:25:17,229 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 123 transitions, 258 flow [2023-08-30 16:25:17,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 123 transitions, 258 flow [2023-08-30 16:25:17,250 INFO L130 PetriNetUnfolder]: 17/145 cut-off events. [2023-08-30 16:25:17,251 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:25:17,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-08-30 16:25:17,256 INFO L119 LiptonReduction]: Number of co-enabled transitions 6248 [2023-08-30 16:25:19,531 INFO L134 LiptonReduction]: Checked pairs total: 9776 [2023-08-30 16:25:19,531 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-30 16:25:19,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:25:19,534 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=true, 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;@51b45307, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:25:19,535 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-30 16:25:19,537 INFO L130 PetriNetUnfolder]: 2/15 cut-off events. [2023-08-30 16:25:19,537 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 16:25:19,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:19,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 16:25:19,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:19,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:19,538 INFO L85 PathProgramCache]: Analyzing trace with hash 698340090, now seen corresponding path program 1 times [2023-08-30 16:25:19,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:19,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775812153] [2023-08-30 16:25:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:19,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:25:19,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775812153] [2023-08-30 16:25:19,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775812153] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:19,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:19,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:25:19,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807666919] [2023-08-30 16:25:19,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:19,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 16:25:19,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:19,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 16:25:19,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 16:25:19,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 238 [2023-08-30 16:25:19,572 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-08-30 16:25:19,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:19,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 238 [2023-08-30 16:25:19,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:19,608 INFO L130 PetriNetUnfolder]: 98/222 cut-off events. [2023-08-30 16:25:19,608 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-30 16:25:19,609 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-08-30 16:25:19,610 INFO L137 encePairwiseOnDemand]: 233/238 looper letters, 14 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-30 16:25:19,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 94 flow [2023-08-30 16:25:19,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 16:25:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 16:25:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 233 transitions. [2023-08-30 16:25:19,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894957983193277 [2023-08-30 16:25:19,613 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 233 transitions. [2023-08-30 16:25:19,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 233 transitions. [2023-08-30 16:25:19,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:19,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 233 transitions. [2023-08-30 16:25:19,614 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-08-30 16:25:19,616 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-08-30 16:25:19,616 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-08-30 16:25:19,616 INFO L175 Difference]: Start difference. First operand has 29 places, 32 transitions, 76 flow. Second operand 2 states and 233 transitions. [2023-08-30 16:25:19,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 94 flow [2023-08-30 16:25:19,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 92 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-30 16:25:19,618 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 64 flow [2023-08-30 16:25:19,618 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-08-30 16:25:19,619 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-08-30 16:25:19,619 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 64 flow [2023-08-30 16:25:19,620 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-08-30 16:25:19,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:19,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:19,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:25:19,620 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:19,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:19,621 INFO L85 PathProgramCache]: Analyzing trace with hash -620647984, now seen corresponding path program 1 times [2023-08-30 16:25:19,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:19,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894721285] [2023-08-30 16:25:19,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:19,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:25:19,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:19,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894721285] [2023-08-30 16:25:19,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894721285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:19,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:19,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:25:19,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197239854] [2023-08-30 16:25:19,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:19,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:25:19,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:19,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:25:19,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:25:19,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 238 [2023-08-30 16:25:19,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:19,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:19,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 238 [2023-08-30 16:25:19,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:19,807 INFO L130 PetriNetUnfolder]: 115/243 cut-off events. [2023-08-30 16:25:19,807 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 16:25:19,809 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-08-30 16:25:19,811 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 20 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-08-30 16:25:19,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 129 flow [2023-08-30 16:25:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:25:19,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:25:19,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-08-30 16:25:19,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4565826330532213 [2023-08-30 16:25:19,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-08-30 16:25:19,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-08-30 16:25:19,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:19,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-08-30 16:25:19,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:19,822 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-08-30 16:25:19,823 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-08-30 16:25:19,823 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 64 flow. Second operand 3 states and 326 transitions. [2023-08-30 16:25:19,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 129 flow [2023-08-30 16:25:19,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 129 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:25:19,825 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 76 flow [2023-08-30 16:25:19,825 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-08-30 16:25:19,827 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2023-08-30 16:25:19,827 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 76 flow [2023-08-30 16:25:19,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:19,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:19,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:19,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:25:19,829 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:19,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:19,830 INFO L85 PathProgramCache]: Analyzing trace with hash -450613029, now seen corresponding path program 1 times [2023-08-30 16:25:19,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:19,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335852395] [2023-08-30 16:25:19,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:19,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:25:19,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:19,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335852395] [2023-08-30 16:25:19,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335852395] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:19,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:19,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:25:19,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633043758] [2023-08-30 16:25:19,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:19,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:25:19,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:19,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:25:19,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:25:19,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 238 [2023-08-30 16:25:19,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 76 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-08-30 16:25:19,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:19,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 238 [2023-08-30 16:25:19,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:19,992 INFO L130 PetriNetUnfolder]: 188/384 cut-off events. [2023-08-30 16:25:19,992 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-08-30 16:25:19,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 384 events. 188/384 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1780 event pairs, 80 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 786. Up to 205 conditions per place. [2023-08-30 16:25:19,995 INFO L137 encePairwiseOnDemand]: 233/238 looper letters, 25 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2023-08-30 16:25:19,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 161 flow [2023-08-30 16:25:19,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:25:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:25:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-30 16:25:19,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4495798319327731 [2023-08-30 16:25:19,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-30 16:25:19,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-30 16:25:19,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:19,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-30 16:25:19,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:19,999 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-08-30 16:25:20,000 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-08-30 16:25:20,000 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 76 flow. Second operand 3 states and 321 transitions. [2023-08-30 16:25:20,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 161 flow [2023-08-30 16:25:20,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 157 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 16:25:20,002 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 98 flow [2023-08-30 16:25:20,002 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-08-30 16:25:20,003 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2023-08-30 16:25:20,003 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 98 flow [2023-08-30 16:25:20,003 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-08-30 16:25:20,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:20,004 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:20,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:25:20,004 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:20,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:20,004 INFO L85 PathProgramCache]: Analyzing trace with hash -885022386, now seen corresponding path program 1 times [2023-08-30 16:25:20,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:20,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540163416] [2023-08-30 16:25:20,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:20,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:25:20,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:20,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540163416] [2023-08-30 16:25:20,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540163416] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:20,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:20,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:25:20,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629615987] [2023-08-30 16:25:20,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:20,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:25:20,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:20,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:25:20,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:25:20,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 238 [2023-08-30 16:25:20,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:20,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:20,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 238 [2023-08-30 16:25:20,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:20,181 INFO L130 PetriNetUnfolder]: 147/336 cut-off events. [2023-08-30 16:25:20,181 INFO L131 PetriNetUnfolder]: For 77/79 co-relation queries the response was YES. [2023-08-30 16:25:20,182 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-08-30 16:25:20,183 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 22 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-08-30 16:25:20,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 170 flow [2023-08-30 16:25:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:25:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:25:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-08-30 16:25:20,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45518207282913165 [2023-08-30 16:25:20,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-08-30 16:25:20,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-08-30 16:25:20,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:20,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-08-30 16:25:20,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:20,188 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-08-30 16:25:20,189 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-08-30 16:25:20,189 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 98 flow. Second operand 3 states and 325 transitions. [2023-08-30 16:25:20,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 170 flow [2023-08-30 16:25:20,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:25:20,191 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 102 flow [2023-08-30 16:25:20,191 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-08-30 16:25:20,191 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2023-08-30 16:25:20,191 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 102 flow [2023-08-30 16:25:20,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:20,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:20,192 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:20,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:25:20,192 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:20,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:20,193 INFO L85 PathProgramCache]: Analyzing trace with hash 155201366, now seen corresponding path program 1 times [2023-08-30 16:25:20,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:20,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379736106] [2023-08-30 16:25:20,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:20,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 16:25:20,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:20,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379736106] [2023-08-30 16:25:20,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379736106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:20,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:20,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:25:20,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732493768] [2023-08-30 16:25:20,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:20,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:25:20,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:20,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:25:20,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:25:20,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 238 [2023-08-30 16:25:20,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 102 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-08-30 16:25:20,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:20,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 238 [2023-08-30 16:25:20,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:20,314 INFO L130 PetriNetUnfolder]: 252/451 cut-off events. [2023-08-30 16:25:20,314 INFO L131 PetriNetUnfolder]: For 127/129 co-relation queries the response was YES. [2023-08-30 16:25:20,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1099 conditions, 451 events. 252/451 cut-off events. For 127/129 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2021 event pairs, 108 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 1090. Up to 261 conditions per place. [2023-08-30 16:25:20,316 INFO L137 encePairwiseOnDemand]: 233/238 looper letters, 26 selfloop transitions, 4 changer transitions 3/41 dead transitions. [2023-08-30 16:25:20,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 198 flow [2023-08-30 16:25:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:25:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:25:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-08-30 16:25:20,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481792717086835 [2023-08-30 16:25:20,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-08-30 16:25:20,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-08-30 16:25:20,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:20,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-08-30 16:25:20,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:20,321 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-08-30 16:25:20,321 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-08-30 16:25:20,321 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 102 flow. Second operand 3 states and 320 transitions. [2023-08-30 16:25:20,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 198 flow [2023-08-30 16:25:20,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 194 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 16:25:20,323 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 120 flow [2023-08-30 16:25:20,323 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-08-30 16:25:20,324 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2023-08-30 16:25:20,324 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 120 flow [2023-08-30 16:25:20,324 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-08-30 16:25:20,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:20,324 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:20,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:25:20,325 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:20,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:20,325 INFO L85 PathProgramCache]: Analyzing trace with hash -901131739, now seen corresponding path program 1 times [2023-08-30 16:25:20,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:20,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862148293] [2023-08-30 16:25:20,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:20,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:25:20,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:20,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862148293] [2023-08-30 16:25:20,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862148293] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:25:20,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144192970] [2023-08-30 16:25:20,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:20,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:25:20,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:25:20,385 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-08-30 16:25:20,416 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-08-30 16:25:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:20,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 16:25:20,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:25:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:25:20,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:25:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:25:20,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144192970] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:25:20,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:25:20,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-30 16:25:20,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410582783] [2023-08-30 16:25:20,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:25:20,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:20,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:20,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:20,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:25:20,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 238 [2023-08-30 16:25:20,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:20,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:20,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 238 [2023-08-30 16:25:20,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:20,672 INFO L130 PetriNetUnfolder]: 171/353 cut-off events. [2023-08-30 16:25:20,672 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2023-08-30 16:25:20,673 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-08-30 16:25:20,674 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 28 selfloop transitions, 3 changer transitions 2/48 dead transitions. [2023-08-30 16:25:20,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 248 flow [2023-08-30 16:25:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:25:20,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:25:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 431 transitions. [2023-08-30 16:25:20,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527310924369748 [2023-08-30 16:25:20,676 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 431 transitions. [2023-08-30 16:25:20,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 431 transitions. [2023-08-30 16:25:20,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:20,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 431 transitions. [2023-08-30 16:25:20,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:20,679 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-08-30 16:25:20,680 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-08-30 16:25:20,680 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 120 flow. Second operand 4 states and 431 transitions. [2023-08-30 16:25:20,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 248 flow [2023-08-30 16:25:20,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:25:20,682 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 128 flow [2023-08-30 16:25:20,682 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-08-30 16:25:20,683 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2023-08-30 16:25:20,683 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 128 flow [2023-08-30 16:25:20,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:20,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:20,683 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:20,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 16:25:20,888 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-08-30 16:25:20,889 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:20,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:20,889 INFO L85 PathProgramCache]: Analyzing trace with hash 163582672, now seen corresponding path program 2 times [2023-08-30 16:25:20,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:20,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368204201] [2023-08-30 16:25:20,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:20,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 16:25:20,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:20,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368204201] [2023-08-30 16:25:20,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368204201] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:25:20,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254920887] [2023-08-30 16:25:20,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 16:25:20,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:25:20,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:25:20,957 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-08-30 16:25:20,989 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-08-30 16:25:21,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 16:25:21,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 16:25:21,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 16:25:21,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:25:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-30 16:25:21,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 16:25:21,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254920887] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:21,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 16:25:21,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-30 16:25:21,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069041539] [2023-08-30 16:25:21,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:21,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:21,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:21,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:21,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:25:21,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 238 [2023-08-30 16:25:21,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:21,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:21,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 238 [2023-08-30 16:25:21,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:21,250 INFO L130 PetriNetUnfolder]: 319/581 cut-off events. [2023-08-30 16:25:21,250 INFO L131 PetriNetUnfolder]: For 341/341 co-relation queries the response was YES. [2023-08-30 16:25:21,251 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-08-30 16:25:21,253 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 28 selfloop transitions, 5 changer transitions 13/51 dead transitions. [2023-08-30 16:25:21,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 290 flow [2023-08-30 16:25:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:25:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:25:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2023-08-30 16:25:21,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4126050420168067 [2023-08-30 16:25:21,255 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 491 transitions. [2023-08-30 16:25:21,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 491 transitions. [2023-08-30 16:25:21,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:21,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 491 transitions. [2023-08-30 16:25:21,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:21,258 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-08-30 16:25:21,259 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-08-30 16:25:21,259 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 128 flow. Second operand 5 states and 491 transitions. [2023-08-30 16:25:21,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 290 flow [2023-08-30 16:25:21,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 274 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 16:25:21,263 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 139 flow [2023-08-30 16:25:21,263 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-08-30 16:25:21,266 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2023-08-30 16:25:21,266 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 139 flow [2023-08-30 16:25:21,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:21,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:21,267 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:21,275 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-08-30 16:25:21,472 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-08-30 16:25:21,473 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:21,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash -739491320, now seen corresponding path program 3 times [2023-08-30 16:25:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:21,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371313553] [2023-08-30 16:25:21,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:21,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 16:25:21,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:21,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371313553] [2023-08-30 16:25:21,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371313553] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:25:21,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477682123] [2023-08-30 16:25:21,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 16:25:21,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:25:21,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:25:21,527 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-08-30 16:25:21,554 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-08-30 16:25:21,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 16:25:21,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 16:25:21,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 16:25:21,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:25:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-30 16:25:21,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 16:25:21,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477682123] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:21,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 16:25:21,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-30 16:25:21,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008761389] [2023-08-30 16:25:21,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:21,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:21,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:21,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:21,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:25:21,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 238 [2023-08-30 16:25:21,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:21,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:21,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 238 [2023-08-30 16:25:21,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:21,845 INFO L130 PetriNetUnfolder]: 312/576 cut-off events. [2023-08-30 16:25:21,846 INFO L131 PetriNetUnfolder]: For 422/422 co-relation queries the response was YES. [2023-08-30 16:25:21,847 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-08-30 16:25:21,849 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 31 selfloop transitions, 5 changer transitions 10/51 dead transitions. [2023-08-30 16:25:21,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 305 flow [2023-08-30 16:25:21,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:25:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:25:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-08-30 16:25:21,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4134453781512605 [2023-08-30 16:25:21,851 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-08-30 16:25:21,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-08-30 16:25:21,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:21,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-08-30 16:25:21,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:21,854 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-08-30 16:25:21,855 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-08-30 16:25:21,855 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 139 flow. Second operand 5 states and 492 transitions. [2023-08-30 16:25:21,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 305 flow [2023-08-30 16:25:21,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 296 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 16:25:21,859 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 153 flow [2023-08-30 16:25:21,859 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-08-30 16:25:21,860 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2023-08-30 16:25:21,860 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 153 flow [2023-08-30 16:25:21,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:21,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:21,861 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:21,868 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-08-30 16:25:22,066 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-08-30 16:25:22,066 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:22,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash -754301488, now seen corresponding path program 1 times [2023-08-30 16:25:22,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:22,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886272900] [2023-08-30 16:25:22,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:22,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 16:25:22,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886272900] [2023-08-30 16:25:22,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886272900] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:25:22,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517693641] [2023-08-30 16:25:22,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:22,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:25:22,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:25:22,117 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-08-30 16:25:22,150 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-08-30 16:25:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:22,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 16:25:22,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:25:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 16:25:22,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:25:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 16:25:22,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517693641] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:25:22,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:25:22,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-08-30 16:25:22,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959809815] [2023-08-30 16:25:22,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:25:22,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:25:22,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:22,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:25:22,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:25:22,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 238 [2023-08-30 16:25:22,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:22,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:22,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 238 [2023-08-30 16:25:22,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:22,312 INFO L130 PetriNetUnfolder]: 147/331 cut-off events. [2023-08-30 16:25:22,313 INFO L131 PetriNetUnfolder]: For 208/214 co-relation queries the response was YES. [2023-08-30 16:25:22,314 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-08-30 16:25:22,315 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 30 selfloop transitions, 3 changer transitions 2/49 dead transitions. [2023-08-30 16:25:22,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 287 flow [2023-08-30 16:25:22,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:25:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:25:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 429 transitions. [2023-08-30 16:25:22,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45063025210084034 [2023-08-30 16:25:22,317 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 429 transitions. [2023-08-30 16:25:22,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 429 transitions. [2023-08-30 16:25:22,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:22,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 429 transitions. [2023-08-30 16:25:22,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:22,320 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-08-30 16:25:22,320 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-08-30 16:25:22,320 INFO L175 Difference]: Start difference. First operand has 49 places, 32 transitions, 153 flow. Second operand 4 states and 429 transitions. [2023-08-30 16:25:22,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 287 flow [2023-08-30 16:25:22,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 264 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-30 16:25:22,323 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 146 flow [2023-08-30 16:25:22,323 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-08-30 16:25:22,323 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2023-08-30 16:25:22,324 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 146 flow [2023-08-30 16:25:22,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:22,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:22,324 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:22,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-30 16:25:22,530 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-08-30 16:25:22,530 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:22,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:22,530 INFO L85 PathProgramCache]: Analyzing trace with hash 484809876, now seen corresponding path program 2 times [2023-08-30 16:25:22,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:22,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895076787] [2023-08-30 16:25:22,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:22,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 16:25:22,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:22,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895076787] [2023-08-30 16:25:22,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895076787] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:22,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:22,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:25:22,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726481959] [2023-08-30 16:25:22,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:22,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:22,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:22,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:22,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:25:22,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 238 [2023-08-30 16:25:22,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:22,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:22,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 238 [2023-08-30 16:25:22,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:22,743 INFO L130 PetriNetUnfolder]: 257/491 cut-off events. [2023-08-30 16:25:22,743 INFO L131 PetriNetUnfolder]: For 298/298 co-relation queries the response was YES. [2023-08-30 16:25:22,745 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-08-30 16:25:22,746 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 29 selfloop transitions, 5 changer transitions 12/51 dead transitions. [2023-08-30 16:25:22,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 51 transitions, 309 flow [2023-08-30 16:25:22,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:25:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:25:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2023-08-30 16:25:22,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41092436974789914 [2023-08-30 16:25:22,749 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 489 transitions. [2023-08-30 16:25:22,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 489 transitions. [2023-08-30 16:25:22,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:22,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 489 transitions. [2023-08-30 16:25:22,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:22,754 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-08-30 16:25:22,754 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-08-30 16:25:22,755 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 146 flow. Second operand 5 states and 489 transitions. [2023-08-30 16:25:22,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 51 transitions, 309 flow [2023-08-30 16:25:22,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 293 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 16:25:22,758 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 157 flow [2023-08-30 16:25:22,758 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-08-30 16:25:22,759 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2023-08-30 16:25:22,759 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 157 flow [2023-08-30 16:25:22,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:22,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:22,759 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:22,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:25:22,760 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:22,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:22,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1621444078, now seen corresponding path program 3 times [2023-08-30 16:25:22,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:22,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261604446] [2023-08-30 16:25:22,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:22,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 16:25:22,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:22,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261604446] [2023-08-30 16:25:22,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261604446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:22,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:22,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:25:22,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530531883] [2023-08-30 16:25:22,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:22,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:22,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:22,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:22,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:25:22,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 238 [2023-08-30 16:25:22,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:22,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:22,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 238 [2023-08-30 16:25:22,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:23,127 INFO L130 PetriNetUnfolder]: 250/486 cut-off events. [2023-08-30 16:25:23,127 INFO L131 PetriNetUnfolder]: For 422/422 co-relation queries the response was YES. [2023-08-30 16:25:23,129 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-08-30 16:25:23,130 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 32 selfloop transitions, 5 changer transitions 10/52 dead transitions. [2023-08-30 16:25:23,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 330 flow [2023-08-30 16:25:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:25:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:25:23,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2023-08-30 16:25:23,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2023-08-30 16:25:23,133 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 490 transitions. [2023-08-30 16:25:23,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 490 transitions. [2023-08-30 16:25:23,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:23,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 490 transitions. [2023-08-30 16:25:23,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:23,137 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-08-30 16:25:23,137 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-08-30 16:25:23,138 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 157 flow. Second operand 5 states and 490 transitions. [2023-08-30 16:25:23,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 330 flow [2023-08-30 16:25:23,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 319 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 16:25:23,141 INFO L231 Difference]: Finished difference. Result has 55 places, 33 transitions, 170 flow [2023-08-30 16:25:23,141 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-08-30 16:25:23,142 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 26 predicate places. [2023-08-30 16:25:23,142 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 33 transitions, 170 flow [2023-08-30 16:25:23,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:23,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:23,142 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-08-30 16:25:23,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:25:23,143 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:23,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:23,144 INFO L85 PathProgramCache]: Analyzing trace with hash 10729971, now seen corresponding path program 1 times [2023-08-30 16:25:23,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:23,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242738156] [2023-08-30 16:25:23,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:23,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 16:25:23,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:23,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242738156] [2023-08-30 16:25:23,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242738156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:23,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:23,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:25:23,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244413261] [2023-08-30 16:25:23,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:23,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:25:23,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:23,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:25:23,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:25:23,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2023-08-30 16:25:23,236 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-08-30 16:25:23,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:23,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2023-08-30 16:25:23,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:23,271 INFO L130 PetriNetUnfolder]: 83/175 cut-off events. [2023-08-30 16:25:23,271 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-08-30 16:25:23,271 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-08-30 16:25:23,272 INFO L137 encePairwiseOnDemand]: 236/238 looper letters, 0 selfloop transitions, 0 changer transitions 29/29 dead transitions. [2023-08-30 16:25:23,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 168 flow [2023-08-30 16:25:23,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:25:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:25:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-30 16:25:23,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2023-08-30 16:25:23,273 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-30 16:25:23,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-30 16:25:23,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:23,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-30 16:25:23,274 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-08-30 16:25:23,276 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-08-30 16:25:23,276 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-08-30 16:25:23,276 INFO L175 Difference]: Start difference. First operand has 55 places, 33 transitions, 170 flow. Second operand 3 states and 336 transitions. [2023-08-30 16:25:23,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 168 flow [2023-08-30 16:25:23,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 163 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-30 16:25:23,278 INFO L231 Difference]: Finished difference. Result has 34 places, 0 transitions, 0 flow [2023-08-30 16:25:23,278 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-08-30 16:25:23,279 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2023-08-30 16:25:23,279 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 0 transitions, 0 flow [2023-08-30 16:25:23,280 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-08-30 16:25:23,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-30 16:25:23,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-30 16:25:23,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-30 16:25:23,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:25:23,280 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:23,281 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-30 16:25:23,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 123 transitions, 258 flow [2023-08-30 16:25:23,295 INFO L130 PetriNetUnfolder]: 17/145 cut-off events. [2023-08-30 16:25:23,295 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:25:23,296 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-08-30 16:25:23,296 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 123 transitions, 258 flow [2023-08-30 16:25:23,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 123 transitions, 258 flow [2023-08-30 16:25:23,297 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:25:23,298 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 123 transitions, 258 flow [2023-08-30 16:25:23,298 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 123 transitions, 258 flow [2023-08-30 16:25:23,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 123 transitions, 258 flow [2023-08-30 16:25:23,312 INFO L130 PetriNetUnfolder]: 17/145 cut-off events. [2023-08-30 16:25:23,312 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:25:23,313 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-08-30 16:25:23,316 INFO L119 LiptonReduction]: Number of co-enabled transitions 6248 [2023-08-30 16:25:25,590 INFO L134 LiptonReduction]: Checked pairs total: 8937 [2023-08-30 16:25:25,590 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-30 16:25:25,592 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-30 16:25:25,592 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=true, 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;@51b45307, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:25:25,592 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-30 16:25:25,595 INFO L130 PetriNetUnfolder]: 6/34 cut-off events. [2023-08-30 16:25:25,595 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:25:25,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:25,595 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-30 16:25:25,595 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 16:25:25,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:25,595 INFO L85 PathProgramCache]: Analyzing trace with hash 225006693, now seen corresponding path program 1 times [2023-08-30 16:25:25,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:25,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314069603] [2023-08-30 16:25:25,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:25,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:25:25,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:25:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:25:25,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:25:25,611 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:25:25,612 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-30 16:25:25,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 16:25:25,612 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-30 16:25:25,612 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-30 16:25:25,613 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 16:25:25,613 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-30 16:25:25,634 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:25:25,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 168 transitions, 357 flow [2023-08-30 16:25:25,655 INFO L130 PetriNetUnfolder]: 25/202 cut-off events. [2023-08-30 16:25:25,656 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-30 16:25:25,657 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-08-30 16:25:25,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 168 transitions, 357 flow [2023-08-30 16:25:25,659 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 168 transitions, 357 flow [2023-08-30 16:25:25,659 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:25:25,659 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 168 transitions, 357 flow [2023-08-30 16:25:25,659 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 168 transitions, 357 flow [2023-08-30 16:25:25,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 168 transitions, 357 flow [2023-08-30 16:25:25,677 INFO L130 PetriNetUnfolder]: 25/202 cut-off events. [2023-08-30 16:25:25,678 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-30 16:25:25,679 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-08-30 16:25:25,686 INFO L119 LiptonReduction]: Number of co-enabled transitions 15312 [2023-08-30 16:25:28,392 INFO L134 LiptonReduction]: Checked pairs total: 23024 [2023-08-30 16:25:28,392 INFO L136 LiptonReduction]: Total number of compositions: 161 [2023-08-30 16:25:28,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:25:28,393 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=true, 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;@51b45307, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:25:28,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 16:25:28,395 INFO L130 PetriNetUnfolder]: 2/15 cut-off events. [2023-08-30 16:25:28,396 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 16:25:28,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:28,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 16:25:28,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:28,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:28,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2142436163, now seen corresponding path program 1 times [2023-08-30 16:25:28,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:28,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388700740] [2023-08-30 16:25:28,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:28,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:25:28,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:28,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388700740] [2023-08-30 16:25:28,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388700740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:28,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:28,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:25:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83453751] [2023-08-30 16:25:28,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:28,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 16:25:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:28,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 16:25:28,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 16:25:28,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 329 [2023-08-30 16:25:28,421 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-08-30 16:25:28,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:28,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 329 [2023-08-30 16:25:28,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:28,555 INFO L130 PetriNetUnfolder]: 798/1428 cut-off events. [2023-08-30 16:25:28,555 INFO L131 PetriNetUnfolder]: For 211/211 co-relation queries the response was YES. [2023-08-30 16:25:28,559 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-08-30 16:25:28,565 INFO L137 encePairwiseOnDemand]: 322/329 looper letters, 20 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2023-08-30 16:25:28,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 137 flow [2023-08-30 16:25:28,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 16:25:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 16:25:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 317 transitions. [2023-08-30 16:25:28,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817629179331307 [2023-08-30 16:25:28,567 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 317 transitions. [2023-08-30 16:25:28,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 317 transitions. [2023-08-30 16:25:28,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:28,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 317 transitions. [2023-08-30 16:25:28,568 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-08-30 16:25:28,570 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-08-30 16:25:28,570 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-08-30 16:25:28,570 INFO L175 Difference]: Start difference. First operand has 40 places, 45 transitions, 111 flow. Second operand 2 states and 317 transitions. [2023-08-30 16:25:28,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 137 flow [2023-08-30 16:25:28,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 131 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-30 16:25:28,571 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 91 flow [2023-08-30 16:25:28,571 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-08-30 16:25:28,572 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-30 16:25:28,572 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 91 flow [2023-08-30 16:25:28,573 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-08-30 16:25:28,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:28,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:28,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 16:25:28,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:28,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:28,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2034945852, now seen corresponding path program 1 times [2023-08-30 16:25:28,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:28,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611118764] [2023-08-30 16:25:28,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:28,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:25:28,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:28,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611118764] [2023-08-30 16:25:28,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611118764] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:28,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:28,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:25:28,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612205233] [2023-08-30 16:25:28,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:28,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:25:28,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:28,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:25:28,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:25:28,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 329 [2023-08-30 16:25:28,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 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-08-30 16:25:28,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:28,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 329 [2023-08-30 16:25:28,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:28,764 INFO L130 PetriNetUnfolder]: 953/1621 cut-off events. [2023-08-30 16:25:28,764 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2023-08-30 16:25:28,768 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-08-30 16:25:28,775 INFO L137 encePairwiseOnDemand]: 326/329 looper letters, 32 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-30 16:25:28,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 197 flow [2023-08-30 16:25:28,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:25:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:25:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-08-30 16:25:28,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4579533941236069 [2023-08-30 16:25:28,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-08-30 16:25:28,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-08-30 16:25:28,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:28,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-08-30 16:25:28,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 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-08-30 16:25:28,781 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-08-30 16:25:28,781 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-08-30 16:25:28,781 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 91 flow. Second operand 3 states and 452 transitions. [2023-08-30 16:25:28,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 197 flow [2023-08-30 16:25:28,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 197 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:25:28,784 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 103 flow [2023-08-30 16:25:28,785 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-08-30 16:25:28,785 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-30 16:25:28,785 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 103 flow [2023-08-30 16:25:28,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 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-08-30 16:25:28,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:28,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:28,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 16:25:28,786 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:28,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:28,786 INFO L85 PathProgramCache]: Analyzing trace with hash 841924197, now seen corresponding path program 1 times [2023-08-30 16:25:28,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:28,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843262148] [2023-08-30 16:25:28,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:28,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:25:28,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:28,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843262148] [2023-08-30 16:25:28,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843262148] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:28,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:28,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:25:28,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154730047] [2023-08-30 16:25:28,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:28,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:25:28,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:28,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:25:28,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:25:28,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 329 [2023-08-30 16:25:28,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:28,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:28,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 329 [2023-08-30 16:25:28,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:29,152 INFO L130 PetriNetUnfolder]: 2141/3506 cut-off events. [2023-08-30 16:25:29,153 INFO L131 PetriNetUnfolder]: For 527/527 co-relation queries the response was YES. [2023-08-30 16:25:29,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7035 conditions, 3506 events. 2141/3506 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 21242 event pairs, 978 based on Foata normal form. 0/2939 useless extension candidates. Maximal degree in co-relation 7027. Up to 2067 conditions per place. [2023-08-30 16:25:29,173 INFO L137 encePairwiseOnDemand]: 323/329 looper letters, 39 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-08-30 16:25:29,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 235 flow [2023-08-30 16:25:29,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:25:29,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:25:29,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-30 16:25:29,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4518743667679838 [2023-08-30 16:25:29,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-30 16:25:29,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-30 16:25:29,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:29,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-30 16:25:29,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:29,178 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-08-30 16:25:29,178 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-08-30 16:25:29,178 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 103 flow. Second operand 3 states and 446 transitions. [2023-08-30 16:25:29,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 235 flow [2023-08-30 16:25:29,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 231 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 16:25:29,180 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 133 flow [2023-08-30 16:25:29,180 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-08-30 16:25:29,180 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-30 16:25:29,180 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 133 flow [2023-08-30 16:25:29,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:29,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:29,181 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:29,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 16:25:29,181 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:29,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:29,182 INFO L85 PathProgramCache]: Analyzing trace with hash 834108639, now seen corresponding path program 1 times [2023-08-30 16:25:29,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:29,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220394851] [2023-08-30 16:25:29,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:29,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:25:29,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:29,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220394851] [2023-08-30 16:25:29,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220394851] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:29,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:29,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:25:29,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642125294] [2023-08-30 16:25:29,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:29,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:25:29,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:29,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:25:29,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:25:29,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 329 [2023-08-30 16:25:29,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:29,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:29,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 329 [2023-08-30 16:25:29,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:29,468 INFO L130 PetriNetUnfolder]: 1460/2516 cut-off events. [2023-08-30 16:25:29,468 INFO L131 PetriNetUnfolder]: For 558/597 co-relation queries the response was YES. [2023-08-30 16:25:29,474 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-08-30 16:25:29,487 INFO L137 encePairwiseOnDemand]: 326/329 looper letters, 35 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-30 16:25:29,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 254 flow [2023-08-30 16:25:29,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:25:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:25:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2023-08-30 16:25:29,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4569402228976697 [2023-08-30 16:25:29,489 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2023-08-30 16:25:29,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2023-08-30 16:25:29,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:29,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2023-08-30 16:25:29,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 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-08-30 16:25:29,492 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-08-30 16:25:29,493 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-08-30 16:25:29,493 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 133 flow. Second operand 3 states and 451 transitions. [2023-08-30 16:25:29,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 254 flow [2023-08-30 16:25:29,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:25:29,495 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 135 flow [2023-08-30 16:25:29,495 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-08-30 16:25:29,495 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-08-30 16:25:29,496 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 135 flow [2023-08-30 16:25:29,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:29,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:29,496 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:29,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 16:25:29,496 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:29,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:29,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1719529064, now seen corresponding path program 1 times [2023-08-30 16:25:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:29,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368033215] [2023-08-30 16:25:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:29,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 16:25:29,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:29,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368033215] [2023-08-30 16:25:29,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368033215] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:29,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:29,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:25:29,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581770971] [2023-08-30 16:25:29,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:29,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:25:29,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:29,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:25:29,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:25:29,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 329 [2023-08-30 16:25:29,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:29,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:29,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 329 [2023-08-30 16:25:29,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:29,950 INFO L130 PetriNetUnfolder]: 3108/5088 cut-off events. [2023-08-30 16:25:29,950 INFO L131 PetriNetUnfolder]: For 1534/1572 co-relation queries the response was YES. [2023-08-30 16:25:29,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11319 conditions, 5088 events. 3108/5088 cut-off events. For 1534/1572 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 32631 event pairs, 1382 based on Foata normal form. 0/4383 useless extension candidates. Maximal degree in co-relation 11309. Up to 2859 conditions per place. [2023-08-30 16:25:29,989 INFO L137 encePairwiseOnDemand]: 323/329 looper letters, 43 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-08-30 16:25:29,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 294 flow [2023-08-30 16:25:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:25:29,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:25:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-30 16:25:29,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4508611955420466 [2023-08-30 16:25:29,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-30 16:25:29,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-30 16:25:29,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:29,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-30 16:25:29,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:29,994 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-08-30 16:25:29,995 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-08-30 16:25:29,995 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 135 flow. Second operand 3 states and 445 transitions. [2023-08-30 16:25:29,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 294 flow [2023-08-30 16:25:29,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 290 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 16:25:29,999 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 183 flow [2023-08-30 16:25:29,999 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-08-30 16:25:29,999 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2023-08-30 16:25:30,000 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 183 flow [2023-08-30 16:25:30,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:30,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:30,000 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:30,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 16:25:30,000 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:30,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:30,001 INFO L85 PathProgramCache]: Analyzing trace with hash 454990788, now seen corresponding path program 1 times [2023-08-30 16:25:30,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:30,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149692534] [2023-08-30 16:25:30,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:30,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 16:25:30,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:30,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149692534] [2023-08-30 16:25:30,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149692534] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:30,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:30,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:25:30,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845226854] [2023-08-30 16:25:30,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:30,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:25:30,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:30,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:25:30,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:25:30,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 329 [2023-08-30 16:25:30,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 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-08-30 16:25:30,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:30,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 329 [2023-08-30 16:25:30,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:30,434 INFO L130 PetriNetUnfolder]: 2167/3900 cut-off events. [2023-08-30 16:25:30,435 INFO L131 PetriNetUnfolder]: For 1435/1596 co-relation queries the response was YES. [2023-08-30 16:25:30,445 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-08-30 16:25:30,459 INFO L137 encePairwiseOnDemand]: 326/329 looper letters, 38 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-30 16:25:30,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 317 flow [2023-08-30 16:25:30,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:25:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:25:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-08-30 16:25:30,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45592705167173253 [2023-08-30 16:25:30,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-08-30 16:25:30,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-08-30 16:25:30,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:30,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-08-30 16:25:30,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 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-08-30 16:25:30,465 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-08-30 16:25:30,466 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-08-30 16:25:30,466 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 183 flow. Second operand 3 states and 450 transitions. [2023-08-30 16:25:30,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 317 flow [2023-08-30 16:25:30,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:25:30,471 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 181 flow [2023-08-30 16:25:30,472 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-08-30 16:25:30,472 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-08-30 16:25:30,472 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 181 flow [2023-08-30 16:25:30,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 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-08-30 16:25:30,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:30,473 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:30,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 16:25:30,473 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:30,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:30,474 INFO L85 PathProgramCache]: Analyzing trace with hash -421046865, now seen corresponding path program 1 times [2023-08-30 16:25:30,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:30,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512378029] [2023-08-30 16:25:30,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:30,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-30 16:25:30,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512378029] [2023-08-30 16:25:30,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512378029] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:30,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:30,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:25:30,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531116296] [2023-08-30 16:25:30,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:30,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:25:30,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:30,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:25:30,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:25:30,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 329 [2023-08-30 16:25:30,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:30,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:30,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 329 [2023-08-30 16:25:30,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:31,074 INFO L130 PetriNetUnfolder]: 4282/6439 cut-off events. [2023-08-30 16:25:31,075 INFO L131 PetriNetUnfolder]: For 2968/3095 co-relation queries the response was YES. [2023-08-30 16:25:31,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16360 conditions, 6439 events. 4282/6439 cut-off events. For 2968/3095 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 38396 event pairs, 1929 based on Foata normal form. 0/5646 useless extension candidates. Maximal degree in co-relation 16348. Up to 3930 conditions per place. [2023-08-30 16:25:31,119 INFO L137 encePairwiseOnDemand]: 323/329 looper letters, 47 selfloop transitions, 10 changer transitions 0/69 dead transitions. [2023-08-30 16:25:31,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 69 transitions, 373 flow [2023-08-30 16:25:31,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:25:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:25:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2023-08-30 16:25:31,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44984802431610943 [2023-08-30 16:25:31,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2023-08-30 16:25:31,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2023-08-30 16:25:31,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:31,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2023-08-30 16:25:31,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:31,124 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-08-30 16:25:31,125 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-08-30 16:25:31,125 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 181 flow. Second operand 3 states and 444 transitions. [2023-08-30 16:25:31,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 69 transitions, 373 flow [2023-08-30 16:25:31,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 369 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 16:25:31,131 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 255 flow [2023-08-30 16:25:31,131 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-08-30 16:25:31,132 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2023-08-30 16:25:31,132 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 255 flow [2023-08-30 16:25:31,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:31,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:31,136 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:31,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 16:25:31,137 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:31,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1301200443, now seen corresponding path program 1 times [2023-08-30 16:25:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:31,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20012372] [2023-08-30 16:25:31,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:31,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:25:31,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:31,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20012372] [2023-08-30 16:25:31,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20012372] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:25:31,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541557140] [2023-08-30 16:25:31,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:31,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:25:31,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:25:31,185 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-08-30 16:25:31,216 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-08-30 16:25:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:31,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 16:25:31,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:25:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:25:31,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:25:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:25:31,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541557140] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:25:31,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:25:31,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-30 16:25:31,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149040757] [2023-08-30 16:25:31,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:25:31,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:31,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:31,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:25:31,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 329 [2023-08-30 16:25:31,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:31,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:31,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 329 [2023-08-30 16:25:31,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:31,898 INFO L130 PetriNetUnfolder]: 2937/4831 cut-off events. [2023-08-30 16:25:31,899 INFO L131 PetriNetUnfolder]: For 3272/3601 co-relation queries the response was YES. [2023-08-30 16:25:31,912 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-08-30 16:25:31,931 INFO L137 encePairwiseOnDemand]: 326/329 looper letters, 58 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2023-08-30 16:25:31,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 513 flow [2023-08-30 16:25:31,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:25:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:25:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 601 transitions. [2023-08-30 16:25:31,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4566869300911854 [2023-08-30 16:25:31,934 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 601 transitions. [2023-08-30 16:25:31,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 601 transitions. [2023-08-30 16:25:31,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:31,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 601 transitions. [2023-08-30 16:25:31,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:31,937 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-08-30 16:25:31,938 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-08-30 16:25:31,938 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 255 flow. Second operand 4 states and 601 transitions. [2023-08-30 16:25:31,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 513 flow [2023-08-30 16:25:31,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 88 transitions, 489 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:25:31,952 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 251 flow [2023-08-30 16:25:31,953 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-08-30 16:25:31,954 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2023-08-30 16:25:31,954 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 251 flow [2023-08-30 16:25:31,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:31,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:31,954 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:31,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 16:25:32,159 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-08-30 16:25:32,160 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:32,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash -976937712, now seen corresponding path program 2 times [2023-08-30 16:25:32,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:32,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203126067] [2023-08-30 16:25:32,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:32,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:32,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 16:25:32,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:32,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203126067] [2023-08-30 16:25:32,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203126067] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:25:32,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009564570] [2023-08-30 16:25:32,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 16:25:32,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:25:32,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:25:32,229 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-08-30 16:25:32,232 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-08-30 16:25:32,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 16:25:32,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 16:25:32,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 16:25:32,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:25:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-30 16:25:32,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 16:25:32,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009564570] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:32,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 16:25:32,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-30 16:25:32,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901987354] [2023-08-30 16:25:32,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:32,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:32,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:32,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:32,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:25:32,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 329 [2023-08-30 16:25:32,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:32,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:32,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 329 [2023-08-30 16:25:32,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:33,256 INFO L130 PetriNetUnfolder]: 5951/9319 cut-off events. [2023-08-30 16:25:33,256 INFO L131 PetriNetUnfolder]: For 7040/7154 co-relation queries the response was YES. [2023-08-30 16:25:33,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25526 conditions, 9319 events. 5951/9319 cut-off events. For 7040/7154 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 62493 event pairs, 2496 based on Foata normal form. 38/8454 useless extension candidates. Maximal degree in co-relation 25512. Up to 4631 conditions per place. [2023-08-30 16:25:33,325 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 87 selfloop transitions, 20 changer transitions 1/117 dead transitions. [2023-08-30 16:25:33,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 117 transitions, 713 flow [2023-08-30 16:25:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:25:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:25:33,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 848 transitions. [2023-08-30 16:25:33,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42958459979736574 [2023-08-30 16:25:33,328 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 848 transitions. [2023-08-30 16:25:33,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 848 transitions. [2023-08-30 16:25:33,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:33,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 848 transitions. [2023-08-30 16:25:33,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:33,333 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-08-30 16:25:33,333 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-08-30 16:25:33,333 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 251 flow. Second operand 6 states and 848 transitions. [2023-08-30 16:25:33,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 117 transitions, 713 flow [2023-08-30 16:25:33,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 117 transitions, 705 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 16:25:33,340 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 395 flow [2023-08-30 16:25:33,340 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-08-30 16:25:33,341 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 23 predicate places. [2023-08-30 16:25:33,341 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 395 flow [2023-08-30 16:25:33,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:33,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:33,341 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:33,352 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-08-30 16:25:33,549 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-08-30 16:25:33,549 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:33,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:33,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1283723568, now seen corresponding path program 3 times [2023-08-30 16:25:33,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:33,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847098850] [2023-08-30 16:25:33,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:33,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 16:25:33,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:33,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847098850] [2023-08-30 16:25:33,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847098850] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:25:33,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076802220] [2023-08-30 16:25:33,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 16:25:33,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:25:33,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:25:33,606 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-08-30 16:25:33,609 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-08-30 16:25:33,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 16:25:33,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 16:25:33,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 16:25:33,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:25:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-30 16:25:33,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 16:25:33,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076802220] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:33,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 16:25:33,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-30 16:25:33,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167510438] [2023-08-30 16:25:33,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:33,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:33,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:33,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:33,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:25:33,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 329 [2023-08-30 16:25:33,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 395 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:33,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:33,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 329 [2023-08-30 16:25:33,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:34,914 INFO L130 PetriNetUnfolder]: 6964/11148 cut-off events. [2023-08-30 16:25:34,915 INFO L131 PetriNetUnfolder]: For 14331/14455 co-relation queries the response was YES. [2023-08-30 16:25:34,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32564 conditions, 11148 events. 6964/11148 cut-off events. For 14331/14455 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 79324 event pairs, 4120 based on Foata normal form. 86/10564 useless extension candidates. Maximal degree in co-relation 32546. Up to 7801 conditions per place. [2023-08-30 16:25:34,979 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 99 selfloop transitions, 32 changer transitions 3/143 dead transitions. [2023-08-30 16:25:34,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 143 transitions, 1114 flow [2023-08-30 16:25:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:25:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:25:34,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 847 transitions. [2023-08-30 16:25:34,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42907801418439717 [2023-08-30 16:25:34,983 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 847 transitions. [2023-08-30 16:25:34,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 847 transitions. [2023-08-30 16:25:34,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:34,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 847 transitions. [2023-08-30 16:25:34,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.16666666666666) internal successors, (847), 6 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:34,989 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-08-30 16:25:34,989 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-08-30 16:25:34,989 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 395 flow. Second operand 6 states and 847 transitions. [2023-08-30 16:25:34,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 143 transitions, 1114 flow [2023-08-30 16:25:35,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 143 transitions, 1114 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:25:35,052 INFO L231 Difference]: Finished difference. Result has 72 places, 91 transitions, 804 flow [2023-08-30 16:25:35,052 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-08-30 16:25:35,053 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2023-08-30 16:25:35,053 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 91 transitions, 804 flow [2023-08-30 16:25:35,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:35,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:35,054 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:35,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 16:25:35,259 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-08-30 16:25:35,259 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:35,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:35,259 INFO L85 PathProgramCache]: Analyzing trace with hash -819042120, now seen corresponding path program 1 times [2023-08-30 16:25:35,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:35,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007485086] [2023-08-30 16:25:35,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:35,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 16:25:35,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:35,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007485086] [2023-08-30 16:25:35,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007485086] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:25:35,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599303674] [2023-08-30 16:25:35,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:35,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:25:35,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:25:35,309 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-08-30 16:25:35,311 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-08-30 16:25:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:35,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 16:25:35,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:25:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 16:25:35,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:25:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 16:25:35,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599303674] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:25:35,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:25:35,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-30 16:25:35,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993414978] [2023-08-30 16:25:35,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:25:35,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:35,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:35,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:35,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:25:35,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 329 [2023-08-30 16:25:35,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 91 transitions, 804 flow. Second operand has 5 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:35,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:35,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 329 [2023-08-30 16:25:35,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:36,095 INFO L130 PetriNetUnfolder]: 4652/8054 cut-off events. [2023-08-30 16:25:36,096 INFO L131 PetriNetUnfolder]: For 14790/16274 co-relation queries the response was YES. [2023-08-30 16:25:36,128 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-08-30 16:25:36,163 INFO L137 encePairwiseOnDemand]: 326/329 looper letters, 65 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2023-08-30 16:25:36,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 126 transitions, 1088 flow [2023-08-30 16:25:36,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:25:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:25:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2023-08-30 16:25:36,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551671732522796 [2023-08-30 16:25:36,166 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 599 transitions. [2023-08-30 16:25:36,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 599 transitions. [2023-08-30 16:25:36,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:36,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 599 transitions. [2023-08-30 16:25:36,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:36,169 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-08-30 16:25:36,170 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-08-30 16:25:36,170 INFO L175 Difference]: Start difference. First operand has 72 places, 91 transitions, 804 flow. Second operand 4 states and 599 transitions. [2023-08-30 16:25:36,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 126 transitions, 1088 flow [2023-08-30 16:25:36,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 126 transitions, 1068 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-30 16:25:36,254 INFO L231 Difference]: Finished difference. Result has 76 places, 92 transitions, 800 flow [2023-08-30 16:25:36,255 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-08-30 16:25:36,255 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 36 predicate places. [2023-08-30 16:25:36,255 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 92 transitions, 800 flow [2023-08-30 16:25:36,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:36,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:36,268 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:36,283 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-08-30 16:25:36,480 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-08-30 16:25:36,480 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:36,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:36,481 INFO L85 PathProgramCache]: Analyzing trace with hash -316172729, now seen corresponding path program 2 times [2023-08-30 16:25:36,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:36,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156284270] [2023-08-30 16:25:36,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:36,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 16:25:36,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:36,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156284270] [2023-08-30 16:25:36,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156284270] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:36,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:36,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:25:36,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265679820] [2023-08-30 16:25:36,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:36,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:36,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:36,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:36,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:25:36,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 329 [2023-08-30 16:25:36,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 92 transitions, 800 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:36,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:36,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 329 [2023-08-30 16:25:36,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:37,684 INFO L130 PetriNetUnfolder]: 8222/13202 cut-off events. [2023-08-30 16:25:37,684 INFO L131 PetriNetUnfolder]: For 30557/30727 co-relation queries the response was YES. [2023-08-30 16:25:37,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42991 conditions, 13202 events. 8222/13202 cut-off events. For 30557/30727 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 97148 event pairs, 3489 based on Foata normal form. 110/12572 useless extension candidates. Maximal degree in co-relation 42966. Up to 6338 conditions per place. [2023-08-30 16:25:37,760 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 106 selfloop transitions, 40 changer transitions 2/157 dead transitions. [2023-08-30 16:25:37,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 157 transitions, 1454 flow [2023-08-30 16:25:37,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:25:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:25:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 847 transitions. [2023-08-30 16:25:37,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42907801418439717 [2023-08-30 16:25:37,767 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 847 transitions. [2023-08-30 16:25:37,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 847 transitions. [2023-08-30 16:25:37,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:37,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 847 transitions. [2023-08-30 16:25:37,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.16666666666666) internal successors, (847), 6 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:37,776 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-08-30 16:25:37,776 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-08-30 16:25:37,776 INFO L175 Difference]: Start difference. First operand has 76 places, 92 transitions, 800 flow. Second operand 6 states and 847 transitions. [2023-08-30 16:25:37,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 157 transitions, 1454 flow [2023-08-30 16:25:37,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 157 transitions, 1446 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 16:25:37,976 INFO L231 Difference]: Finished difference. Result has 83 places, 104 transitions, 1075 flow [2023-08-30 16:25:37,976 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-08-30 16:25:37,977 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2023-08-30 16:25:37,977 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 104 transitions, 1075 flow [2023-08-30 16:25:37,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:37,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:37,977 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:37,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-30 16:25:37,978 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:37,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:37,978 INFO L85 PathProgramCache]: Analyzing trace with hash 195544307, now seen corresponding path program 3 times [2023-08-30 16:25:37,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:37,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35767232] [2023-08-30 16:25:37,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:37,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 16:25:38,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:38,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35767232] [2023-08-30 16:25:38,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35767232] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:38,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:38,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:25:38,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376795160] [2023-08-30 16:25:38,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:38,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:38,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:38,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:38,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:25:38,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 329 [2023-08-30 16:25:38,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 104 transitions, 1075 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:38,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:38,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 329 [2023-08-30 16:25:38,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:39,348 INFO L130 PetriNetUnfolder]: 9232/15012 cut-off events. [2023-08-30 16:25:39,348 INFO L131 PetriNetUnfolder]: For 51223/51421 co-relation queries the response was YES. [2023-08-30 16:25:39,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51677 conditions, 15012 events. 9232/15012 cut-off events. For 51223/51421 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 115298 event pairs, 5888 based on Foata normal form. 88/14277 useless extension candidates. Maximal degree in co-relation 51648. Up to 11257 conditions per place. [2023-08-30 16:25:39,433 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 135 selfloop transitions, 40 changer transitions 3/187 dead transitions. [2023-08-30 16:25:39,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 187 transitions, 2098 flow [2023-08-30 16:25:39,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:25:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:25:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 848 transitions. [2023-08-30 16:25:39,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42958459979736574 [2023-08-30 16:25:39,439 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 848 transitions. [2023-08-30 16:25:39,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 848 transitions. [2023-08-30 16:25:39,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:39,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 848 transitions. [2023-08-30 16:25:39,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:39,444 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-08-30 16:25:39,444 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-08-30 16:25:39,445 INFO L175 Difference]: Start difference. First operand has 83 places, 104 transitions, 1075 flow. Second operand 6 states and 848 transitions. [2023-08-30 16:25:39,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 187 transitions, 2098 flow [2023-08-30 16:25:39,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 187 transitions, 2074 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-30 16:25:39,846 INFO L231 Difference]: Finished difference. Result has 92 places, 134 transitions, 1653 flow [2023-08-30 16:25:39,846 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-08-30 16:25:39,847 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 52 predicate places. [2023-08-30 16:25:39,847 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 134 transitions, 1653 flow [2023-08-30 16:25:39,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:39,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:39,847 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-08-30 16:25:39,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-30 16:25:39,848 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:39,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:39,848 INFO L85 PathProgramCache]: Analyzing trace with hash 824640343, now seen corresponding path program 1 times [2023-08-30 16:25:39,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:39,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805223907] [2023-08-30 16:25:39,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:39,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:39,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-08-30 16:25:39,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:39,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805223907] [2023-08-30 16:25:39,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805223907] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:39,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:39,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:25:39,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039630026] [2023-08-30 16:25:39,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:39,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:25:39,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:39,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:25:39,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:25:39,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 329 [2023-08-30 16:25:39,913 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-08-30 16:25:39,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:39,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 329 [2023-08-30 16:25:39,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:40,565 INFO L130 PetriNetUnfolder]: 2859/5413 cut-off events. [2023-08-30 16:25:40,565 INFO L131 PetriNetUnfolder]: For 17980/18226 co-relation queries the response was YES. [2023-08-30 16:25:40,586 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-08-30 16:25:40,598 INFO L137 encePairwiseOnDemand]: 323/329 looper letters, 66 selfloop transitions, 6 changer transitions 0/121 dead transitions. [2023-08-30 16:25:40,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 121 transitions, 1315 flow [2023-08-30 16:25:40,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:25:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:25:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-08-30 16:25:40,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47315096251266464 [2023-08-30 16:25:40,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-08-30 16:25:40,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-08-30 16:25:40,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:40,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-08-30 16:25:40,602 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-08-30 16:25:40,604 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-08-30 16:25:40,604 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-08-30 16:25:40,604 INFO L175 Difference]: Start difference. First operand has 92 places, 134 transitions, 1653 flow. Second operand 3 states and 467 transitions. [2023-08-30 16:25:40,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 121 transitions, 1315 flow [2023-08-30 16:25:40,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 121 transitions, 1240 flow, removed 31 selfloop flow, removed 1 redundant places. [2023-08-30 16:25:40,731 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 870 flow [2023-08-30 16:25:40,732 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-08-30 16:25:40,732 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 53 predicate places. [2023-08-30 16:25:40,732 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 870 flow [2023-08-30 16:25:40,732 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-08-30 16:25:40,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:40,733 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-08-30 16:25:40,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-30 16:25:40,733 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:40,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:40,733 INFO L85 PathProgramCache]: Analyzing trace with hash 423314739, now seen corresponding path program 1 times [2023-08-30 16:25:40,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:40,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597164539] [2023-08-30 16:25:40,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:40,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-30 16:25:40,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:40,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597164539] [2023-08-30 16:25:40,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597164539] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:25:40,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954313331] [2023-08-30 16:25:40,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:40,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:25:40,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:25:40,775 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-08-30 16:25:40,807 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-08-30 16:25:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:40,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 16:25:40,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:25:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-30 16:25:40,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:25:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-30 16:25:40,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954313331] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:25:40,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:25:40,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-30 16:25:40,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536404198] [2023-08-30 16:25:40,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:25:40,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:40,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:40,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:40,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:25:40,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 329 [2023-08-30 16:25:40,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 870 flow. Second operand has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:40,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:40,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 329 [2023-08-30 16:25:40,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:41,382 INFO L130 PetriNetUnfolder]: 3159/5673 cut-off events. [2023-08-30 16:25:41,382 INFO L131 PetriNetUnfolder]: For 17258/17538 co-relation queries the response was YES. [2023-08-30 16:25:41,402 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-08-30 16:25:41,414 INFO L137 encePairwiseOnDemand]: 326/329 looper letters, 76 selfloop transitions, 3 changer transitions 0/128 dead transitions. [2023-08-30 16:25:41,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 128 transitions, 1230 flow [2023-08-30 16:25:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:25:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:25:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2023-08-30 16:25:41,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45364741641337386 [2023-08-30 16:25:41,416 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 597 transitions. [2023-08-30 16:25:41,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 597 transitions. [2023-08-30 16:25:41,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:41,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 597 transitions. [2023-08-30 16:25:41,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:41,419 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-08-30 16:25:41,420 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-08-30 16:25:41,420 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 870 flow. Second operand 4 states and 597 transitions. [2023-08-30 16:25:41,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 128 transitions, 1230 flow [2023-08-30 16:25:41,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 128 transitions, 1216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:25:41,488 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 880 flow [2023-08-30 16:25:41,488 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-08-30 16:25:41,489 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 56 predicate places. [2023-08-30 16:25:41,489 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 880 flow [2023-08-30 16:25:41,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:41,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:41,489 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-08-30 16:25:41,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-30 16:25:41,694 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-08-30 16:25:41,695 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:41,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:41,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1402124064, now seen corresponding path program 2 times [2023-08-30 16:25:41,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:41,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917365761] [2023-08-30 16:25:41,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:41,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-30 16:25:41,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:41,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917365761] [2023-08-30 16:25:41,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917365761] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:41,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:41,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:25:41,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466364184] [2023-08-30 16:25:41,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:41,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:41,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:41,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:41,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:25:41,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 329 [2023-08-30 16:25:41,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 880 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:41,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:41,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 329 [2023-08-30 16:25:41,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:42,591 INFO L130 PetriNetUnfolder]: 4667/7794 cut-off events. [2023-08-30 16:25:42,591 INFO L131 PetriNetUnfolder]: For 24628/24724 co-relation queries the response was YES. [2023-08-30 16:25:42,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27729 conditions, 7794 events. 4667/7794 cut-off events. For 24628/24724 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 54809 event pairs, 2099 based on Foata normal form. 80/7623 useless extension candidates. Maximal degree in co-relation 27693. Up to 3606 conditions per place. [2023-08-30 16:25:42,637 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 97 selfloop transitions, 32 changer transitions 7/148 dead transitions. [2023-08-30 16:25:42,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 148 transitions, 1510 flow [2023-08-30 16:25:42,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:25:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:25:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 840 transitions. [2023-08-30 16:25:42,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2023-08-30 16:25:42,640 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 840 transitions. [2023-08-30 16:25:42,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 840 transitions. [2023-08-30 16:25:42,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:42,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 840 transitions. [2023-08-30 16:25:42,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:42,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-08-30 16:25:42,644 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-08-30 16:25:42,644 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 880 flow. Second operand 6 states and 840 transitions. [2023-08-30 16:25:42,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 148 transitions, 1510 flow [2023-08-30 16:25:42,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 148 transitions, 1482 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-30 16:25:42,792 INFO L231 Difference]: Finished difference. Result has 103 places, 93 transitions, 1022 flow [2023-08-30 16:25:42,792 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-08-30 16:25:42,792 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 63 predicate places. [2023-08-30 16:25:42,793 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 93 transitions, 1022 flow [2023-08-30 16:25:42,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:42,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:42,793 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-08-30 16:25:42,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-30 16:25:42,793 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:42,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:42,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2102118292, now seen corresponding path program 1 times [2023-08-30 16:25:42,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:42,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309117910] [2023-08-30 16:25:42,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:42,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-30 16:25:42,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:42,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309117910] [2023-08-30 16:25:42,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309117910] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:42,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:42,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:25:42,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194130663] [2023-08-30 16:25:42,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:42,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:42,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:42,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:42,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:25:42,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 329 [2023-08-30 16:25:42,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 93 transitions, 1022 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:42,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:42,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 329 [2023-08-30 16:25:42,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:43,686 INFO L130 PetriNetUnfolder]: 4725/7995 cut-off events. [2023-08-30 16:25:43,687 INFO L131 PetriNetUnfolder]: For 30174/30242 co-relation queries the response was YES. [2023-08-30 16:25:43,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29057 conditions, 7995 events. 4725/7995 cut-off events. For 30174/30242 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 56935 event pairs, 2562 based on Foata normal form. 96/8010 useless extension candidates. Maximal degree in co-relation 29017. Up to 4369 conditions per place. [2023-08-30 16:25:43,728 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 92 selfloop transitions, 24 changer transitions 21/149 dead transitions. [2023-08-30 16:25:43,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 149 transitions, 1663 flow [2023-08-30 16:25:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:25:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:25:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 834 transitions. [2023-08-30 16:25:43,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42249240121580545 [2023-08-30 16:25:43,730 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 834 transitions. [2023-08-30 16:25:43,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 834 transitions. [2023-08-30 16:25:43,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:43,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 834 transitions. [2023-08-30 16:25:43,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:43,733 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-08-30 16:25:43,733 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-08-30 16:25:43,733 INFO L175 Difference]: Start difference. First operand has 103 places, 93 transitions, 1022 flow. Second operand 6 states and 834 transitions. [2023-08-30 16:25:43,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 149 transitions, 1663 flow [2023-08-30 16:25:43,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 149 transitions, 1636 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-30 16:25:43,841 INFO L231 Difference]: Finished difference. Result has 110 places, 89 transitions, 1031 flow [2023-08-30 16:25:43,841 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-08-30 16:25:43,841 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 70 predicate places. [2023-08-30 16:25:43,841 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 89 transitions, 1031 flow [2023-08-30 16:25:43,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:43,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:43,842 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-08-30 16:25:43,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-30 16:25:43,842 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:43,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1657934133, now seen corresponding path program 1 times [2023-08-30 16:25:43,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:43,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630335057] [2023-08-30 16:25:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:43,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-30 16:25:43,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:43,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630335057] [2023-08-30 16:25:43,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630335057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:43,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:43,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:25:43,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417801373] [2023-08-30 16:25:43,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:43,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:43,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:43,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:43,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:25:43,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 329 [2023-08-30 16:25:43,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 89 transitions, 1031 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:43,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:43,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 329 [2023-08-30 16:25:43,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:44,595 INFO L130 PetriNetUnfolder]: 4400/7379 cut-off events. [2023-08-30 16:25:44,595 INFO L131 PetriNetUnfolder]: For 27526/27606 co-relation queries the response was YES. [2023-08-30 16:25:44,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26835 conditions, 7379 events. 4400/7379 cut-off events. For 27526/27606 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 51638 event pairs, 2112 based on Foata normal form. 100/7419 useless extension candidates. Maximal degree in co-relation 26792. Up to 3611 conditions per place. [2023-08-30 16:25:44,647 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 90 selfloop transitions, 24 changer transitions 16/142 dead transitions. [2023-08-30 16:25:44,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 142 transitions, 1609 flow [2023-08-30 16:25:44,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:25:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:25:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 835 transitions. [2023-08-30 16:25:44,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42299898682877407 [2023-08-30 16:25:44,649 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 835 transitions. [2023-08-30 16:25:44,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 835 transitions. [2023-08-30 16:25:44,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:44,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 835 transitions. [2023-08-30 16:25:44,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.16666666666666) internal successors, (835), 6 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-08-30 16:25:44,653 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-08-30 16:25:44,653 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-08-30 16:25:44,654 INFO L175 Difference]: Start difference. First operand has 110 places, 89 transitions, 1031 flow. Second operand 6 states and 835 transitions. [2023-08-30 16:25:44,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 142 transitions, 1609 flow [2023-08-30 16:25:44,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 142 transitions, 1521 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-08-30 16:25:44,793 INFO L231 Difference]: Finished difference. Result has 111 places, 85 transitions, 954 flow [2023-08-30 16:25:44,793 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-08-30 16:25:44,793 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 71 predicate places. [2023-08-30 16:25:44,793 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 85 transitions, 954 flow [2023-08-30 16:25:44,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:44,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:44,794 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-08-30 16:25:44,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-30 16:25:44,794 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:44,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:44,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1537568021, now seen corresponding path program 1 times [2023-08-30 16:25:44,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:44,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734474424] [2023-08-30 16:25:44,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:44,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-30 16:25:44,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:44,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734474424] [2023-08-30 16:25:44,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734474424] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:44,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:44,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:25:44,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174310184] [2023-08-30 16:25:44,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:44,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:25:44,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:44,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:25:44,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:25:44,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 329 [2023-08-30 16:25:44,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 85 transitions, 954 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:44,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:44,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 329 [2023-08-30 16:25:44,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:45,560 INFO L130 PetriNetUnfolder]: 3978/6543 cut-off events. [2023-08-30 16:25:45,560 INFO L131 PetriNetUnfolder]: For 23497/23503 co-relation queries the response was YES. [2023-08-30 16:25:45,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23925 conditions, 6543 events. 3978/6543 cut-off events. For 23497/23503 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 43215 event pairs, 2183 based on Foata normal form. 104/6591 useless extension candidates. Maximal degree in co-relation 23885. Up to 3780 conditions per place. [2023-08-30 16:25:45,588 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 80 selfloop transitions, 16 changer transitions 21/129 dead transitions. [2023-08-30 16:25:45,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 129 transitions, 1416 flow [2023-08-30 16:25:45,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:25:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:25:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 830 transitions. [2023-08-30 16:25:45,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4204660587639311 [2023-08-30 16:25:45,590 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 830 transitions. [2023-08-30 16:25:45,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 830 transitions. [2023-08-30 16:25:45,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:45,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 830 transitions. [2023-08-30 16:25:45,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.33333333333334) internal successors, (830), 6 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:45,594 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-08-30 16:25:45,594 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-08-30 16:25:45,594 INFO L175 Difference]: Start difference. First operand has 111 places, 85 transitions, 954 flow. Second operand 6 states and 830 transitions. [2023-08-30 16:25:45,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 129 transitions, 1416 flow [2023-08-30 16:25:45,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 129 transitions, 1388 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 16:25:45,706 INFO L231 Difference]: Finished difference. Result has 115 places, 75 transitions, 798 flow [2023-08-30 16:25:45,706 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-08-30 16:25:45,706 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 75 predicate places. [2023-08-30 16:25:45,706 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 75 transitions, 798 flow [2023-08-30 16:25:45,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:45,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:45,707 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-08-30 16:25:45,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-30 16:25:45,707 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:45,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:45,707 INFO L85 PathProgramCache]: Analyzing trace with hash -698675073, now seen corresponding path program 1 times [2023-08-30 16:25:45,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:45,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384781841] [2023-08-30 16:25:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:45,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-30 16:25:45,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:45,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384781841] [2023-08-30 16:25:45,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384781841] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:45,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:45,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:25:45,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144801363] [2023-08-30 16:25:45,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:45,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:25:45,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:45,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:25:45,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:25:45,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 329 [2023-08-30 16:25:45,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 75 transitions, 798 flow. Second operand has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:45,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:45,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 329 [2023-08-30 16:25:45,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:46,686 INFO L130 PetriNetUnfolder]: 3814/6098 cut-off events. [2023-08-30 16:25:46,686 INFO L131 PetriNetUnfolder]: For 21716/21716 co-relation queries the response was YES. [2023-08-30 16:25:46,710 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-08-30 16:25:46,723 INFO L137 encePairwiseOnDemand]: 319/329 looper letters, 73 selfloop transitions, 15 changer transitions 26/120 dead transitions. [2023-08-30 16:25:46,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 120 transitions, 1229 flow [2023-08-30 16:25:46,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:25:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:25:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 922 transitions. [2023-08-30 16:25:46,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4003473729917499 [2023-08-30 16:25:46,725 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 922 transitions. [2023-08-30 16:25:46,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 922 transitions. [2023-08-30 16:25:46,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:46,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 922 transitions. [2023-08-30 16:25:46,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:46,730 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-08-30 16:25:46,730 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-08-30 16:25:46,730 INFO L175 Difference]: Start difference. First operand has 115 places, 75 transitions, 798 flow. Second operand 7 states and 922 transitions. [2023-08-30 16:25:46,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 120 transitions, 1229 flow [2023-08-30 16:25:46,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 120 transitions, 1145 flow, removed 8 selfloop flow, removed 11 redundant places. [2023-08-30 16:25:46,862 INFO L231 Difference]: Finished difference. Result has 111 places, 71 transitions, 687 flow [2023-08-30 16:25:46,862 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-08-30 16:25:46,863 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 71 predicate places. [2023-08-30 16:25:46,863 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 71 transitions, 687 flow [2023-08-30 16:25:46,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:46,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:46,863 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-08-30 16:25:46,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-30 16:25:46,863 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:46,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash -207543005, now seen corresponding path program 1 times [2023-08-30 16:25:46,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:46,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73022584] [2023-08-30 16:25:46,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:46,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-30 16:25:46,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:46,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73022584] [2023-08-30 16:25:46,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73022584] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:46,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:46,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:25:46,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926748479] [2023-08-30 16:25:46,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:46,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:25:46,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:46,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:25:46,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:25:47,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 329 [2023-08-30 16:25:47,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 71 transitions, 687 flow. Second operand has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:47,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:47,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 329 [2023-08-30 16:25:47,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:47,722 INFO L130 PetriNetUnfolder]: 3658/5782 cut-off events. [2023-08-30 16:25:47,722 INFO L131 PetriNetUnfolder]: For 16052/16052 co-relation queries the response was YES. [2023-08-30 16:25:47,743 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-08-30 16:25:47,753 INFO L137 encePairwiseOnDemand]: 319/329 looper letters, 69 selfloop transitions, 12 changer transitions 28/114 dead transitions. [2023-08-30 16:25:47,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 114 transitions, 1099 flow [2023-08-30 16:25:47,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:25:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:25:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 919 transitions. [2023-08-30 16:25:47,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3990447242726878 [2023-08-30 16:25:47,755 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 919 transitions. [2023-08-30 16:25:47,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 919 transitions. [2023-08-30 16:25:47,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:47,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 919 transitions. [2023-08-30 16:25:47,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:47,760 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-08-30 16:25:47,760 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-08-30 16:25:47,760 INFO L175 Difference]: Start difference. First operand has 111 places, 71 transitions, 687 flow. Second operand 7 states and 919 transitions. [2023-08-30 16:25:47,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 114 transitions, 1099 flow [2023-08-30 16:25:47,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 114 transitions, 1045 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-08-30 16:25:47,854 INFO L231 Difference]: Finished difference. Result has 108 places, 63 transitions, 567 flow [2023-08-30 16:25:47,855 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-08-30 16:25:47,855 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 68 predicate places. [2023-08-30 16:25:47,855 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 63 transitions, 567 flow [2023-08-30 16:25:47,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:47,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:47,855 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-08-30 16:25:47,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-30 16:25:47,856 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:47,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1486769261, now seen corresponding path program 1 times [2023-08-30 16:25:47,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:47,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510831486] [2023-08-30 16:25:47,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:47,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-30 16:25:47,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:47,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510831486] [2023-08-30 16:25:47,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510831486] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:47,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:47,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:25:47,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776978568] [2023-08-30 16:25:47,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:47,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:25:47,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:47,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:25:47,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:25:48,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 329 [2023-08-30 16:25:48,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 63 transitions, 567 flow. Second operand has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:48,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:48,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 329 [2023-08-30 16:25:48,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:48,521 INFO L130 PetriNetUnfolder]: 2457/3917 cut-off events. [2023-08-30 16:25:48,521 INFO L131 PetriNetUnfolder]: For 10249/10249 co-relation queries the response was YES. [2023-08-30 16:25:48,532 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-08-30 16:25:48,539 INFO L137 encePairwiseOnDemand]: 321/329 looper letters, 62 selfloop transitions, 10 changer transitions 25/102 dead transitions. [2023-08-30 16:25:48,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 102 transitions, 918 flow [2023-08-30 16:25:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:25:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:25:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 913 transitions. [2023-08-30 16:25:48,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3964394268345636 [2023-08-30 16:25:48,540 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 913 transitions. [2023-08-30 16:25:48,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 913 transitions. [2023-08-30 16:25:48,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:48,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 913 transitions. [2023-08-30 16:25:48,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.42857142857142) internal successors, (913), 7 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:48,543 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-08-30 16:25:48,543 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-08-30 16:25:48,543 INFO L175 Difference]: Start difference. First operand has 108 places, 63 transitions, 567 flow. Second operand 7 states and 913 transitions. [2023-08-30 16:25:48,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 102 transitions, 918 flow [2023-08-30 16:25:48,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 102 transitions, 873 flow, removed 3 selfloop flow, removed 8 redundant places. [2023-08-30 16:25:48,573 INFO L231 Difference]: Finished difference. Result has 103 places, 58 transitions, 470 flow [2023-08-30 16:25:48,573 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-08-30 16:25:48,573 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 63 predicate places. [2023-08-30 16:25:48,573 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 58 transitions, 470 flow [2023-08-30 16:25:48,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:48,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:48,574 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-08-30 16:25:48,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-08-30 16:25:48,574 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:48,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:48,575 INFO L85 PathProgramCache]: Analyzing trace with hash -687091357, now seen corresponding path program 1 times [2023-08-30 16:25:48,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:48,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727782093] [2023-08-30 16:25:48,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:48,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-30 16:25:48,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:48,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727782093] [2023-08-30 16:25:48,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727782093] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:48,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:48,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:25:48,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246795804] [2023-08-30 16:25:48,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:48,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:25:48,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:48,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:25:48,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:25:48,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 329 [2023-08-30 16:25:48,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 58 transitions, 470 flow. Second operand has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:48,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:48,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 329 [2023-08-30 16:25:48,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:49,181 INFO L130 PetriNetUnfolder]: 2301/3601 cut-off events. [2023-08-30 16:25:49,182 INFO L131 PetriNetUnfolder]: For 8645/8645 co-relation queries the response was YES. [2023-08-30 16:25:49,193 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-08-30 16:25:49,199 INFO L137 encePairwiseOnDemand]: 320/329 looper letters, 48 selfloop transitions, 7 changer transitions 36/95 dead transitions. [2023-08-30 16:25:49,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 95 transitions, 808 flow [2023-08-30 16:25:49,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:25:49,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:25:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 909 transitions. [2023-08-30 16:25:49,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39470256187581415 [2023-08-30 16:25:49,200 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 909 transitions. [2023-08-30 16:25:49,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 909 transitions. [2023-08-30 16:25:49,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:49,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 909 transitions. [2023-08-30 16:25:49,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:49,203 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-08-30 16:25:49,204 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-08-30 16:25:49,204 INFO L175 Difference]: Start difference. First operand has 103 places, 58 transitions, 470 flow. Second operand 7 states and 909 transitions. [2023-08-30 16:25:49,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 95 transitions, 808 flow [2023-08-30 16:25:49,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 95 transitions, 746 flow, removed 9 selfloop flow, removed 8 redundant places. [2023-08-30 16:25:49,233 INFO L231 Difference]: Finished difference. Result has 96 places, 48 transitions, 334 flow [2023-08-30 16:25:49,233 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-08-30 16:25:49,233 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 56 predicate places. [2023-08-30 16:25:49,233 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 48 transitions, 334 flow [2023-08-30 16:25:49,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:49,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:49,234 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-08-30 16:25:49,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-08-30 16:25:49,234 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:49,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:49,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1657476839, now seen corresponding path program 1 times [2023-08-30 16:25:49,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:49,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889500587] [2023-08-30 16:25:49,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:49,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-30 16:25:49,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:49,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889500587] [2023-08-30 16:25:49,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889500587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:49,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:49,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:25:49,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582061673] [2023-08-30 16:25:49,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:49,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:25:49,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:49,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:25:49,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:25:49,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 329 [2023-08-30 16:25:49,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 48 transitions, 334 flow. Second operand has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:49,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:49,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 329 [2023-08-30 16:25:49,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:49,610 INFO L130 PetriNetUnfolder]: 1133/1767 cut-off events. [2023-08-30 16:25:49,610 INFO L131 PetriNetUnfolder]: For 2966/2966 co-relation queries the response was YES. [2023-08-30 16:25:49,614 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-08-30 16:25:49,617 INFO L137 encePairwiseOnDemand]: 322/329 looper letters, 42 selfloop transitions, 3 changer transitions 26/75 dead transitions. [2023-08-30 16:25:49,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 75 transitions, 578 flow [2023-08-30 16:25:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:25:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:25:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 894 transitions. [2023-08-30 16:25:49,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3881893182805037 [2023-08-30 16:25:49,618 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 894 transitions. [2023-08-30 16:25:49,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 894 transitions. [2023-08-30 16:25:49,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:49,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 894 transitions. [2023-08-30 16:25:49,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.71428571428571) internal successors, (894), 7 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:49,621 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-08-30 16:25:49,621 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-08-30 16:25:49,621 INFO L175 Difference]: Start difference. First operand has 96 places, 48 transitions, 334 flow. Second operand 7 states and 894 transitions. [2023-08-30 16:25:49,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 75 transitions, 578 flow [2023-08-30 16:25:49,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 493 flow, removed 9 selfloop flow, removed 16 redundant places. [2023-08-30 16:25:49,631 INFO L231 Difference]: Finished difference. Result has 77 places, 40 transitions, 194 flow [2023-08-30 16:25:49,631 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-08-30 16:25:49,632 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2023-08-30 16:25:49,632 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 40 transitions, 194 flow [2023-08-30 16:25:49,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:49,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:49,632 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-08-30 16:25:49,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-08-30 16:25:49,633 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:49,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:49,633 INFO L85 PathProgramCache]: Analyzing trace with hash -931249861, now seen corresponding path program 1 times [2023-08-30 16:25:49,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:49,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458110839] [2023-08-30 16:25:49,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:49,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-30 16:25:49,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:49,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458110839] [2023-08-30 16:25:49,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458110839] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:49,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:49,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:25:49,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144557693] [2023-08-30 16:25:49,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:49,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:25:49,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:49,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:25:49,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:25:49,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 329 [2023-08-30 16:25:49,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 40 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:49,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:49,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 329 [2023-08-30 16:25:49,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:50,026 INFO L130 PetriNetUnfolder]: 1034/1566 cut-off events. [2023-08-30 16:25:50,026 INFO L131 PetriNetUnfolder]: For 1710/1710 co-relation queries the response was YES. [2023-08-30 16:25:50,029 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-08-30 16:25:50,030 INFO L137 encePairwiseOnDemand]: 322/329 looper letters, 0 selfloop transitions, 0 changer transitions 62/62 dead transitions. [2023-08-30 16:25:50,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 62 transitions, 399 flow [2023-08-30 16:25:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:25:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:25:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 885 transitions. [2023-08-30 16:25:50,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3842813721233174 [2023-08-30 16:25:50,031 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 885 transitions. [2023-08-30 16:25:50,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 885 transitions. [2023-08-30 16:25:50,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:50,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 885 transitions. [2023-08-30 16:25:50,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.42857142857143) internal successors, (885), 7 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:50,034 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-08-30 16:25:50,034 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-08-30 16:25:50,034 INFO L175 Difference]: Start difference. First operand has 77 places, 40 transitions, 194 flow. Second operand 7 states and 885 transitions. [2023-08-30 16:25:50,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 62 transitions, 399 flow [2023-08-30 16:25:50,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 371 flow, removed 3 selfloop flow, removed 8 redundant places. [2023-08-30 16:25:50,037 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2023-08-30 16:25:50,038 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-08-30 16:25:50,038 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-08-30 16:25:50,038 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2023-08-30 16:25:50,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:50,039 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-30 16:25:50,039 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-30 16:25:50,039 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-30 16:25:50,039 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-30 16:25:50,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-08-30 16:25:50,039 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-08-30 16:25:50,040 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-30 16:25:50,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 168 transitions, 357 flow [2023-08-30 16:25:50,050 INFO L130 PetriNetUnfolder]: 25/202 cut-off events. [2023-08-30 16:25:50,050 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-30 16:25:50,051 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-08-30 16:25:50,051 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 168 transitions, 357 flow [2023-08-30 16:25:50,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 168 transitions, 357 flow [2023-08-30 16:25:50,052 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:25:50,052 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 168 transitions, 357 flow [2023-08-30 16:25:50,052 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 168 transitions, 357 flow [2023-08-30 16:25:50,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 168 transitions, 357 flow [2023-08-30 16:25:50,061 INFO L130 PetriNetUnfolder]: 25/202 cut-off events. [2023-08-30 16:25:50,062 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-30 16:25:50,062 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-08-30 16:25:50,067 INFO L119 LiptonReduction]: Number of co-enabled transitions 15312 [2023-08-30 16:25:52,558 INFO L134 LiptonReduction]: Checked pairs total: 23205 [2023-08-30 16:25:52,559 INFO L136 LiptonReduction]: Total number of compositions: 158 [2023-08-30 16:25:52,560 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-30 16:25:52,560 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=true, 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;@51b45307, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:25:52,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-30 16:25:52,564 INFO L130 PetriNetUnfolder]: 10/51 cut-off events. [2023-08-30 16:25:52,564 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-30 16:25:52,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:52,565 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-08-30 16:25:52,565 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 16:25:52,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:52,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1065229616, now seen corresponding path program 1 times [2023-08-30 16:25:52,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:52,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648723146] [2023-08-30 16:25:52,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:52,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:25:52,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:25:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:25:52,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:25:52,582 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:25:52,582 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-30 16:25:52,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-08-30 16:25:52,582 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-30 16:25:52,583 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-30 16:25:52,583 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 16:25:52,583 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-08-30 16:25:52,613 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:25:52,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 213 transitions, 458 flow [2023-08-30 16:25:52,637 INFO L130 PetriNetUnfolder]: 33/259 cut-off events. [2023-08-30 16:25:52,637 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 16:25:52,640 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-08-30 16:25:52,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 213 transitions, 458 flow [2023-08-30 16:25:52,642 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 213 transitions, 458 flow [2023-08-30 16:25:52,643 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:25:52,643 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 213 transitions, 458 flow [2023-08-30 16:25:52,643 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 213 transitions, 458 flow [2023-08-30 16:25:52,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 213 transitions, 458 flow [2023-08-30 16:25:52,664 INFO L130 PetriNetUnfolder]: 33/259 cut-off events. [2023-08-30 16:25:52,664 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 16:25:52,666 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-08-30 16:25:52,676 INFO L119 LiptonReduction]: Number of co-enabled transitions 28336 [2023-08-30 16:25:55,781 INFO L134 LiptonReduction]: Checked pairs total: 42708 [2023-08-30 16:25:55,781 INFO L136 LiptonReduction]: Total number of compositions: 199 [2023-08-30 16:25:55,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:25:55,782 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=true, 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;@51b45307, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:25:55,783 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 16:25:55,790 INFO L130 PetriNetUnfolder]: 2/15 cut-off events. [2023-08-30 16:25:55,790 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 16:25:55,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:55,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 16:25:55,791 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-08-30 16:25:55,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:55,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1374319252, now seen corresponding path program 1 times [2023-08-30 16:25:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:55,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240002592] [2023-08-30 16:25:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:25:55,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:55,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240002592] [2023-08-30 16:25:55,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240002592] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:55,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:55,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:25:55,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243933284] [2023-08-30 16:25:55,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:55,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 16:25:55,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:55,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 16:25:55,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 16:25:55,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 412 [2023-08-30 16:25:55,803 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-08-30 16:25:55,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:55,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 412 [2023-08-30 16:25:55,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:56,341 INFO L130 PetriNetUnfolder]: 5548/8708 cut-off events. [2023-08-30 16:25:56,341 INFO L131 PetriNetUnfolder]: For 1921/1921 co-relation queries the response was YES. [2023-08-30 16:25:56,362 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-08-30 16:25:56,387 INFO L137 encePairwiseOnDemand]: 403/412 looper letters, 26 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-30 16:25:56,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 182 flow [2023-08-30 16:25:56,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 16:25:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 16:25:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 401 transitions. [2023-08-30 16:25:56,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4866504854368932 [2023-08-30 16:25:56,388 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 401 transitions. [2023-08-30 16:25:56,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 401 transitions. [2023-08-30 16:25:56,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:56,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 401 transitions. [2023-08-30 16:25:56,389 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-08-30 16:25:56,389 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-08-30 16:25:56,390 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-08-30 16:25:56,390 INFO L175 Difference]: Start difference. First operand has 51 places, 58 transitions, 148 flow. Second operand 2 states and 401 transitions. [2023-08-30 16:25:56,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 182 flow [2023-08-30 16:25:56,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 170 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-30 16:25:56,391 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 118 flow [2023-08-30 16:25:56,391 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-08-30 16:25:56,392 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-08-30 16:25:56,392 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 118 flow [2023-08-30 16:25:56,392 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-08-30 16:25:56,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:56,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:56,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-08-30 16:25:56,392 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-08-30 16:25:56,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1480801169, now seen corresponding path program 1 times [2023-08-30 16:25:56,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:56,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141609476] [2023-08-30 16:25:56,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:56,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:25:56,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:56,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141609476] [2023-08-30 16:25:56,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141609476] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:56,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:56,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:25:56,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387527945] [2023-08-30 16:25:56,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:56,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:25:56,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:56,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:25:56,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:25:56,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 412 [2023-08-30 16:25:56,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:56,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:56,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 412 [2023-08-30 16:25:56,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:57,043 INFO L130 PetriNetUnfolder]: 6635/10007 cut-off events. [2023-08-30 16:25:57,043 INFO L131 PetriNetUnfolder]: For 508/508 co-relation queries the response was YES. [2023-08-30 16:25:57,071 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-08-30 16:25:57,102 INFO L137 encePairwiseOnDemand]: 409/412 looper letters, 44 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-08-30 16:25:57,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 69 transitions, 265 flow [2023-08-30 16:25:57,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:25:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:25:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 578 transitions. [2023-08-30 16:25:57,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46763754045307443 [2023-08-30 16:25:57,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 578 transitions. [2023-08-30 16:25:57,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 578 transitions. [2023-08-30 16:25:57,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:57,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 578 transitions. [2023-08-30 16:25:57,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:57,106 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-08-30 16:25:57,106 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-08-30 16:25:57,106 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 118 flow. Second operand 3 states and 578 transitions. [2023-08-30 16:25:57,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 69 transitions, 265 flow [2023-08-30 16:25:57,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:25:57,107 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 130 flow [2023-08-30 16:25:57,107 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-08-30 16:25:57,107 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-30 16:25:57,107 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 130 flow [2023-08-30 16:25:57,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:57,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:57,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:57,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-08-30 16:25:57,108 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-08-30 16:25:57,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:57,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1836093859, now seen corresponding path program 1 times [2023-08-30 16:25:57,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:57,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669346482] [2023-08-30 16:25:57,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:57,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:57,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:25:57,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:57,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669346482] [2023-08-30 16:25:57,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669346482] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:57,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:57,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:25:57,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99204092] [2023-08-30 16:25:57,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:57,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:25:57,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:57,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:25:57,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:25:57,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 412 [2023-08-30 16:25:57,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:57,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:57,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 412 [2023-08-30 16:25:57,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:58,552 INFO L130 PetriNetUnfolder]: 19505/28188 cut-off events. [2023-08-30 16:25:58,552 INFO L131 PetriNetUnfolder]: For 3313/3313 co-relation queries the response was YES. [2023-08-30 16:25:58,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56336 conditions, 28188 events. 19505/28188 cut-off events. For 3313/3313 co-relation queries the response was YES. Maximal size of possible extension queue 1274. Compared 188888 event pairs, 9232 based on Foata normal form. 0/23540 useless extension candidates. Maximal degree in co-relation 56327. Up to 17885 conditions per place. [2023-08-30 16:25:58,750 INFO L137 encePairwiseOnDemand]: 405/412 looper letters, 52 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2023-08-30 16:25:58,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 309 flow [2023-08-30 16:25:58,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:25:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:25:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2023-08-30 16:25:58,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46197411003236244 [2023-08-30 16:25:58,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 571 transitions. [2023-08-30 16:25:58,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 571 transitions. [2023-08-30 16:25:58,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:58,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 571 transitions. [2023-08-30 16:25:58,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:58,754 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-08-30 16:25:58,754 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-08-30 16:25:58,754 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 130 flow. Second operand 3 states and 571 transitions. [2023-08-30 16:25:58,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 309 flow [2023-08-30 16:25:58,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 305 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 16:25:58,756 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 168 flow [2023-08-30 16:25:58,756 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-08-30 16:25:58,757 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2023-08-30 16:25:58,757 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 168 flow [2023-08-30 16:25:58,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:58,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:58,757 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:58,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-08-30 16:25:58,757 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-08-30 16:25:58,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:58,757 INFO L85 PathProgramCache]: Analyzing trace with hash 624867628, now seen corresponding path program 1 times [2023-08-30 16:25:58,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:58,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242347094] [2023-08-30 16:25:58,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:58,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:25:58,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:58,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242347094] [2023-08-30 16:25:58,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242347094] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:58,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:25:58,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:25:58,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212706422] [2023-08-30 16:25:58,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:58,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:25:58,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:58,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:25:58,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:25:58,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 412 [2023-08-30 16:25:58,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:58,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:58,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 412 [2023-08-30 16:25:58,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:59,675 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-08-30 16:25:59,675 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 16:25:59,675 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:25:59,675 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 16:25:59,675 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 16:25:59,732 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-08-30 16:25:59,732 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 16:25:59,732 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:25:59,732 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:25:59,732 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:25:59,732 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-08-30 16:25:59,732 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 16:25:59,732 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:25:59,732 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:25:59,733 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:25:59,738 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-08-30 16:25:59,738 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 16:25:59,739 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:25:59,739 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:25:59,739 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:25:59,770 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-08-30 16:25:59,770 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,770 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,770 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:25:59,770 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:25:59,771 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-08-30 16:25:59,771 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,771 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:25:59,771 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,771 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:25:59,775 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-08-30 16:25:59,775 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,775 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:25:59,775 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:25:59,775 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,775 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-08-30 16:25:59,775 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,775 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:25:59,775 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,775 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:25:59,784 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-08-30 16:25:59,784 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,784 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,784 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,785 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,797 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-08-30 16:25:59,798 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,798 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,798 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,798 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,802 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-08-30 16:25:59,802 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,802 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,802 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,802 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,803 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-08-30 16:25:59,803 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,803 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,803 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,803 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,806 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-08-30 16:25:59,806 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,806 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,806 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,806 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:25:59,813 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-08-30 16:25:59,814 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,814 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,814 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,814 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,814 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-08-30 16:25:59,814 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,814 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,814 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,814 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,821 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-08-30 16:25:59,822 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,822 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,822 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,822 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,824 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-08-30 16:25:59,824 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,824 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,824 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,824 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,825 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-08-30 16:25:59,825 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,825 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,825 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,825 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,827 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-08-30 16:25:59,827 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,827 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,827 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,827 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:25:59,835 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-08-30 16:25:59,836 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,836 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,836 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,836 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,836 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-08-30 16:25:59,836 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,837 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,837 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,837 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,840 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-08-30 16:25:59,840 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,841 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,841 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,841 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,841 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-08-30 16:25:59,841 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,841 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,841 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,841 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,842 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-08-30 16:25:59,842 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,843 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,843 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,843 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:25:59,845 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-08-30 16:25:59,845 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 16:25:59,845 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,845 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:25:59,846 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,849 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-08-30 16:25:59,849 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 16:25:59,849 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,849 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:25:59,849 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,850 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-08-30 16:25:59,850 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 16:25:59,850 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,850 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:25:59,850 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,852 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-08-30 16:25:59,852 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 16:25:59,853 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,853 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:25:59,853 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:25:59,854 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-08-30 16:25:59,854 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 16:25:59,855 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 16:25:59,855 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:25:59,855 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:25:59,855 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-08-30 16:25:59,855 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 16:25:59,855 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 16:25:59,855 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:25:59,855 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:25:59,857 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-08-30 16:25:59,857 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 16:25:59,857 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:25:59,858 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:25:59,858 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 16:25:59,859 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-08-30 16:25:59,859 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 16:25:59,859 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 16:25:59,859 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 16:25:59,859 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 16:25:59,861 INFO L130 PetriNetUnfolder]: 12187/18671 cut-off events. [2023-08-30 16:25:59,862 INFO L131 PetriNetUnfolder]: For 3987/4454 co-relation queries the response was YES. [2023-08-30 16:25:59,911 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-08-30 16:25:59,969 INFO L137 encePairwiseOnDemand]: 409/412 looper letters, 47 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-08-30 16:25:59,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 330 flow [2023-08-30 16:25:59,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:25:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:25:59,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 577 transitions. [2023-08-30 16:25:59,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46682847896440127 [2023-08-30 16:25:59,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 577 transitions. [2023-08-30 16:25:59,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 577 transitions. [2023-08-30 16:25:59,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:59,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 577 transitions. [2023-08-30 16:25:59,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:59,973 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-08-30 16:25:59,973 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-08-30 16:25:59,973 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 168 flow. Second operand 3 states and 577 transitions. [2023-08-30 16:25:59,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 330 flow [2023-08-30 16:25:59,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:25:59,977 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 168 flow [2023-08-30 16:25:59,977 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-08-30 16:25:59,978 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-30 16:25:59,978 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 168 flow [2023-08-30 16:25:59,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:59,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:59,978 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:59,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-08-30 16:25:59,978 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-08-30 16:25:59,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:59,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1200327327, now seen corresponding path program 1 times [2023-08-30 16:25:59,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:59,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970006106] [2023-08-30 16:25:59,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:59,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:26:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 16:26:00,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:26:00,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970006106] [2023-08-30 16:26:00,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970006106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:26:00,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:26:00,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:26:00,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795820953] [2023-08-30 16:26:00,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:26:00,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:26:00,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:26:00,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:26:00,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:26:00,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 412 [2023-08-30 16:26:00,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:00,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:26:00,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 412 [2023-08-30 16:26:00,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:26:02,459 INFO L130 PetriNetUnfolder]: 30765/45191 cut-off events. [2023-08-30 16:26:02,459 INFO L131 PetriNetUnfolder]: For 12573/13135 co-relation queries the response was YES. [2023-08-30 16:26:02,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98745 conditions, 45191 events. 30765/45191 cut-off events. For 12573/13135 co-relation queries the response was YES. Maximal size of possible extension queue 2028. Compared 330809 event pairs, 13961 based on Foata normal form. 40/38549 useless extension candidates. Maximal degree in co-relation 98734. Up to 27454 conditions per place. [2023-08-30 16:26:02,751 INFO L137 encePairwiseOnDemand]: 405/412 looper letters, 57 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2023-08-30 16:26:02,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 82 transitions, 384 flow [2023-08-30 16:26:02,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:26:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:26:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions. [2023-08-30 16:26:02,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46116504854368934 [2023-08-30 16:26:02,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 570 transitions. [2023-08-30 16:26:02,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 570 transitions. [2023-08-30 16:26:02,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:26:02,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 570 transitions. [2023-08-30 16:26:02,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:02,754 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-08-30 16:26:02,754 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-08-30 16:26:02,754 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 168 flow. Second operand 3 states and 570 transitions. [2023-08-30 16:26:02,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 82 transitions, 384 flow [2023-08-30 16:26:02,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 380 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 16:26:02,762 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 236 flow [2023-08-30 16:26:02,762 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-08-30 16:26:02,762 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-08-30 16:26:02,762 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 236 flow [2023-08-30 16:26:02,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:02,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:26:02,763 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:26:02,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-08-30 16:26:02,763 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-08-30 16:26:02,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:26:02,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1313240605, now seen corresponding path program 1 times [2023-08-30 16:26:02,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:26:02,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72557228] [2023-08-30 16:26:02,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:26:02,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:26:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:26:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 16:26:02,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:26:02,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72557228] [2023-08-30 16:26:02,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72557228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:26:02,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:26:02,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:26:02,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754325710] [2023-08-30 16:26:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:26:02,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:26:02,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:26:02,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:26:02,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:26:02,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 412 [2023-08-30 16:26:02,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 236 flow. Second operand has 3 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-08-30 16:26:02,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:26:02,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 412 [2023-08-30 16:26:02,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:26:04,784 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-08-30 16:26:04,785 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 16:26:04,785 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:26:04,785 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:26:04,785 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:26:04,785 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-08-30 16:26:04,785 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 16:26:04,785 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:26:04,785 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:26:04,785 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:26:04,793 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-08-30 16:26:04,793 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 16:26:04,793 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:26:04,793 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:26:04,793 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:26:04,793 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-08-30 16:26:04,793 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 16:26:04,793 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:26:04,793 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:26:04,794 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:26:04,940 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-08-30 16:26:04,940 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 16:26:04,941 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 16:26:04,941 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:26:04,941 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:26:04,941 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-08-30 16:26:04,941 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 16:26:04,941 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:26:04,941 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:26:04,941 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:26:04,948 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-08-30 16:26:04,949 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 16:26:04,949 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:26:04,949 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 16:26:04,949 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:26:04,949 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-08-30 16:26:04,949 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 16:26:04,949 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:26:04,949 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:26:04,949 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:26:05,072 INFO L130 PetriNetUnfolder]: 20002/30478 cut-off events. [2023-08-30 16:26:05,072 INFO L131 PetriNetUnfolder]: For 10630/12773 co-relation queries the response was YES. [2023-08-30 16:26:05,145 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-08-30 16:26:05,231 INFO L137 encePairwiseOnDemand]: 409/412 looper letters, 50 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-30 16:26:05,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 411 flow [2023-08-30 16:26:05,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:26:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:26:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2023-08-30 16:26:05,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46601941747572817 [2023-08-30 16:26:05,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 576 transitions. [2023-08-30 16:26:05,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 576 transitions. [2023-08-30 16:26:05,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:26:05,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 576 transitions. [2023-08-30 16:26:05,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:05,235 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-08-30 16:26:05,235 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-08-30 16:26:05,235 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 236 flow. Second operand 3 states and 576 transitions. [2023-08-30 16:26:05,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 411 flow [2023-08-30 16:26:05,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 391 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:26:05,246 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 230 flow [2023-08-30 16:26:05,246 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-08-30 16:26:05,246 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-30 16:26:05,247 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 230 flow [2023-08-30 16:26:05,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-08-30 16:26:05,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:26:05,247 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:26:05,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-08-30 16:26:05,247 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-08-30 16:26:05,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:26:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1025945555, now seen corresponding path program 1 times [2023-08-30 16:26:05,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:26:05,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649993161] [2023-08-30 16:26:05,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:26:05,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:26:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:26:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-30 16:26:05,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:26:05,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649993161] [2023-08-30 16:26:05,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649993161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:26:05,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:26:05,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:26:05,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243554107] [2023-08-30 16:26:05,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:26:05,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:26:05,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:26:05,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:26:05,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:26:05,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 412 [2023-08-30 16:26:05,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:05,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:26:05,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 412 [2023-08-30 16:26:05,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:26:09,821 INFO L130 PetriNetUnfolder]: 46568/67832 cut-off events. [2023-08-30 16:26:09,821 INFO L131 PetriNetUnfolder]: For 34587/36126 co-relation queries the response was YES. [2023-08-30 16:26:10,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162866 conditions, 67832 events. 46568/67832 cut-off events. For 34587/36126 co-relation queries the response was YES. Maximal size of possible extension queue 3036. Compared 510789 event pairs, 20897 based on Foata normal form. 0/58721 useless extension candidates. Maximal degree in co-relation 162853. Up to 40680 conditions per place. [2023-08-30 16:26:10,281 INFO L137 encePairwiseOnDemand]: 405/412 looper letters, 63 selfloop transitions, 14 changer transitions 0/93 dead transitions. [2023-08-30 16:26:10,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 93 transitions, 503 flow [2023-08-30 16:26:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:26:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:26:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2023-08-30 16:26:10,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603559870550162 [2023-08-30 16:26:10,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 569 transitions. [2023-08-30 16:26:10,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 569 transitions. [2023-08-30 16:26:10,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:26:10,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 569 transitions. [2023-08-30 16:26:10,284 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-08-30 16:26:10,285 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-08-30 16:26:10,285 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-08-30 16:26:10,285 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 230 flow. Second operand 3 states and 569 transitions. [2023-08-30 16:26:10,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 93 transitions, 503 flow [2023-08-30 16:26:10,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 499 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 16:26:10,309 INFO L231 Difference]: Finished difference. Result has 65 places, 71 transitions, 352 flow [2023-08-30 16:26:10,309 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-08-30 16:26:10,309 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2023-08-30 16:26:10,310 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 71 transitions, 352 flow [2023-08-30 16:26:10,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:10,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:26:10,310 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:26:10,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-08-30 16:26:10,310 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-08-30 16:26:10,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:26:10,310 INFO L85 PathProgramCache]: Analyzing trace with hash -250847166, now seen corresponding path program 1 times [2023-08-30 16:26:10,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:26:10,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426066392] [2023-08-30 16:26:10,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:26:10,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:26:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:26:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:26:10,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:26:10,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426066392] [2023-08-30 16:26:10,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426066392] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:26:10,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040249594] [2023-08-30 16:26:10,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:26:10,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:26:10,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:26:10,351 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-08-30 16:26:10,384 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-08-30 16:26:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:26:10,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 16:26:10,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:26:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:26:10,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:26:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:26:10,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040249594] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:26:10,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:26:10,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-30 16:26:10,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131461843] [2023-08-30 16:26:10,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:26:10,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:26:10,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:26:10,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:26:10,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:26:10,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 412 [2023-08-30 16:26:10,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 71 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 178.6) internal successors, (893), 5 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:10,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:26:10,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 412 [2023-08-30 16:26:10,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:26:14,041 INFO L130 PetriNetUnfolder]: 30977/46901 cut-off events. [2023-08-30 16:26:14,042 INFO L131 PetriNetUnfolder]: For 27668/33621 co-relation queries the response was YES. [2023-08-30 16:26:14,238 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 368485 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-08-30 16:26:14,393 INFO L137 encePairwiseOnDemand]: 409/412 looper letters, 76 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2023-08-30 16:26:14,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 118 transitions, 680 flow [2023-08-30 16:26:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:26:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:26:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 771 transitions. [2023-08-30 16:26:14,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4678398058252427 [2023-08-30 16:26:14,394 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 771 transitions. [2023-08-30 16:26:14,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 771 transitions. [2023-08-30 16:26:14,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:26:14,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 771 transitions. [2023-08-30 16:26:14,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 192.75) internal successors, (771), 4 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-08-30 16:26:14,396 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-08-30 16:26:14,396 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-08-30 16:26:14,396 INFO L175 Difference]: Start difference. First operand has 65 places, 71 transitions, 352 flow. Second operand 4 states and 771 transitions. [2023-08-30 16:26:14,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 118 transitions, 680 flow [2023-08-30 16:26:14,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 118 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:26:14,446 INFO L231 Difference]: Finished difference. Result has 67 places, 72 transitions, 340 flow [2023-08-30 16:26:14,446 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-08-30 16:26:14,447 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2023-08-30 16:26:14,447 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 72 transitions, 340 flow [2023-08-30 16:26:14,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 178.6) internal successors, (893), 5 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:14,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:26:14,447 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:26:14,452 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-08-30 16:26:14,647 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-08-30 16:26:14,648 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-08-30 16:26:14,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:26:14,648 INFO L85 PathProgramCache]: Analyzing trace with hash 602199332, now seen corresponding path program 2 times [2023-08-30 16:26:14,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:26:14,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618765480] [2023-08-30 16:26:14,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:26:14,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:26:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:26:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 16:26:14,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:26:14,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618765480] [2023-08-30 16:26:14,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618765480] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:26:14,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389872182] [2023-08-30 16:26:14,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 16:26:14,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:26:14,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:26:14,693 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-08-30 16:26:14,695 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-08-30 16:26:14,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 16:26:14,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 16:26:14,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 16:26:14,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:26:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-30 16:26:14,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 16:26:14,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389872182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:26:14,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 16:26:14,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-30 16:26:14,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179642118] [2023-08-30 16:26:14,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:26:14,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:26:14,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:26:14,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:26:14,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:26:14,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 412 [2023-08-30 16:26:14,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 72 transitions, 340 flow. Second operand has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 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-08-30 16:26:14,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:26:14,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 412 [2023-08-30 16:26:14,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:26:22,633 INFO L130 PetriNetUnfolder]: 70761/103370 cut-off events. [2023-08-30 16:26:22,634 INFO L131 PetriNetUnfolder]: For 77642/79872 co-relation queries the response was YES. [2023-08-30 16:26:23,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268064 conditions, 103370 events. 70761/103370 cut-off events. For 77642/79872 co-relation queries the response was YES. Maximal size of possible extension queue 4546. Compared 823704 event pairs, 29434 based on Foata normal form. 498/91088 useless extension candidates. Maximal degree in co-relation 268049. Up to 52521 conditions per place. [2023-08-30 16:26:23,363 INFO L137 encePairwiseOnDemand]: 402/412 looper letters, 128 selfloop transitions, 32 changer transitions 0/173 dead transitions. [2023-08-30 16:26:23,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 173 transitions, 1064 flow [2023-08-30 16:26:23,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:26:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:26:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1109 transitions. [2023-08-30 16:26:23,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44862459546925565 [2023-08-30 16:26:23,364 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1109 transitions. [2023-08-30 16:26:23,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1109 transitions. [2023-08-30 16:26:23,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:26:23,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1109 transitions. [2023-08-30 16:26:23,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 184.83333333333334) internal successors, (1109), 6 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:23,367 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-08-30 16:26:23,367 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-08-30 16:26:23,367 INFO L175 Difference]: Start difference. First operand has 67 places, 72 transitions, 340 flow. Second operand 6 states and 1109 transitions. [2023-08-30 16:26:23,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 173 transitions, 1064 flow [2023-08-30 16:26:23,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 173 transitions, 1056 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 16:26:23,394 INFO L231 Difference]: Finished difference. Result has 74 places, 91 transitions, 594 flow [2023-08-30 16:26:23,394 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-08-30 16:26:23,394 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2023-08-30 16:26:23,394 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 91 transitions, 594 flow [2023-08-30 16:26:23,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 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-08-30 16:26:23,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:26:23,395 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:26:23,399 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-08-30 16:26:23,595 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-08-30 16:26:23,595 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-08-30 16:26:23,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:26:23,596 INFO L85 PathProgramCache]: Analyzing trace with hash -628959772, now seen corresponding path program 3 times [2023-08-30 16:26:23,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:26:23,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254984401] [2023-08-30 16:26:23,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:26:23,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:26:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:26:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 16:26:23,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:26:23,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254984401] [2023-08-30 16:26:23,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254984401] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:26:23,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295006624] [2023-08-30 16:26:23,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 16:26:23,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:26:23,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:26:23,628 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-08-30 16:26:23,641 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-08-30 16:26:23,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 16:26:23,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 16:26:23,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 16:26:23,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:26:23,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-30 16:26:23,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 16:26:23,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295006624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:26:23,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 16:26:23,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-30 16:26:23,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426775643] [2023-08-30 16:26:23,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:26:23,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:26:23,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:26:23,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:26:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:26:23,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 412 [2023-08-30 16:26:23,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 91 transitions, 594 flow. Second operand has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 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-08-30 16:26:23,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:26:23,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 412 [2023-08-30 16:26:23,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:26:34,366 INFO L130 PetriNetUnfolder]: 88621/133302 cut-off events. [2023-08-30 16:26:34,366 INFO L131 PetriNetUnfolder]: For 171931/174661 co-relation queries the response was YES. [2023-08-30 16:26:34,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367597 conditions, 133302 events. 88621/133302 cut-off events. For 171931/174661 co-relation queries the response was YES. Maximal size of possible extension queue 6235. Compared 1149530 event pairs, 46504 based on Foata normal form. 718/122232 useless extension candidates. Maximal degree in co-relation 367578. Up to 84835 conditions per place. [2023-08-30 16:26:35,397 INFO L137 encePairwiseOnDemand]: 402/412 looper letters, 157 selfloop transitions, 54 changer transitions 0/224 dead transitions. [2023-08-30 16:26:35,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 224 transitions, 1824 flow [2023-08-30 16:26:35,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:26:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:26:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1108 transitions. [2023-08-30 16:26:35,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482200647249191 [2023-08-30 16:26:35,399 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1108 transitions. [2023-08-30 16:26:35,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1108 transitions. [2023-08-30 16:26:35,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:26:35,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1108 transitions. [2023-08-30 16:26:35,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 184.66666666666666) internal successors, (1108), 6 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:35,402 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-08-30 16:26:35,403 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-08-30 16:26:35,403 INFO L175 Difference]: Start difference. First operand has 74 places, 91 transitions, 594 flow. Second operand 6 states and 1108 transitions. [2023-08-30 16:26:35,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 224 transitions, 1824 flow [2023-08-30 16:26:37,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 224 transitions, 1824 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:26:37,200 INFO L231 Difference]: Finished difference. Result has 83 places, 141 transitions, 1370 flow [2023-08-30 16:26:37,200 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-08-30 16:26:37,201 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-08-30 16:26:37,201 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 141 transitions, 1370 flow [2023-08-30 16:26:37,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 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-08-30 16:26:37,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:26:37,201 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:26:37,206 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-08-30 16:26:37,405 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-08-30 16:26:37,405 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-08-30 16:26:37,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:26:37,406 INFO L85 PathProgramCache]: Analyzing trace with hash -156028, now seen corresponding path program 1 times [2023-08-30 16:26:37,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:26:37,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019285748] [2023-08-30 16:26:37,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:26:37,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:26:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:26:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 16:26:37,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:26:37,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019285748] [2023-08-30 16:26:37,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019285748] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:26:37,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801549552] [2023-08-30 16:26:37,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:26:37,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:26:37,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:26:37,444 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-08-30 16:26:37,447 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-08-30 16:26:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:26:37,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 16:26:37,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:26:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 16:26:37,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:26:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 16:26:37,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801549552] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:26:37,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:26:37,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-30 16:26:37,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261923427] [2023-08-30 16:26:37,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:26:37,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:26:37,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:26:37,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:26:37,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:26:37,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 412 [2023-08-30 16:26:37,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 141 transitions, 1370 flow. Second operand has 5 states, 5 states have (on average 178.6) internal successors, (893), 5 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:37,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:26:37,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 412 [2023-08-30 16:26:37,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:26:43,163 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-08-30 16:26:43,164 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 16:26:43,164 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:26:43,164 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:26:43,164 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:26:43,252 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-08-30 16:26:43,253 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 16:26:43,253 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:26:43,253 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:26:43,253 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:26:43,253 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-08-30 16:26:43,253 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 16:26:43,253 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:26:43,253 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:26:43,253 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 16:26:43,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][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-08-30 16:26:43,624 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 16:26:43,624 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:26:43,624 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 16:26:43,624 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 16:26:44,680 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-08-30 16:26:44,680 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 16:26:44,680 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 16:26:44,680 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 16:26:44,681 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 16:26:45,012 INFO L130 PetriNetUnfolder]: 54953/87625 cut-off events. [2023-08-30 16:26:45,012 INFO L131 PetriNetUnfolder]: For 162523/192271 co-relation queries the response was YES. [2023-08-30 16:26:45,528 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 809282 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-08-30 16:26:46,115 INFO L137 encePairwiseOnDemand]: 409/412 looper letters, 86 selfloop transitions, 3 changer transitions 0/188 dead transitions. [2023-08-30 16:26:46,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 188 transitions, 1730 flow [2023-08-30 16:26:46,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:26:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:26:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 769 transitions. [2023-08-30 16:26:46,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466626213592233 [2023-08-30 16:26:46,116 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 769 transitions. [2023-08-30 16:26:46,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 769 transitions. [2023-08-30 16:26:46,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:26:46,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 769 transitions. [2023-08-30 16:26:46,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 192.25) internal successors, (769), 4 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:46,118 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-08-30 16:26:46,118 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-08-30 16:26:46,118 INFO L175 Difference]: Start difference. First operand has 83 places, 141 transitions, 1370 flow. Second operand 4 states and 769 transitions. [2023-08-30 16:26:46,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 188 transitions, 1730 flow [2023-08-30 16:26:46,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 188 transitions, 1692 flow, removed 19 selfloop flow, removed 0 redundant places. [2023-08-30 16:26:46,981 INFO L231 Difference]: Finished difference. Result has 87 places, 142 transitions, 1348 flow [2023-08-30 16:26:46,981 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-08-30 16:26:46,982 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2023-08-30 16:26:46,982 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 142 transitions, 1348 flow [2023-08-30 16:26:46,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 178.6) internal successors, (893), 5 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:46,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:26:46,982 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:26:46,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-30 16:26:47,182 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-08-30 16:26:47,183 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-08-30 16:26:47,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:26:47,183 INFO L85 PathProgramCache]: Analyzing trace with hash -753939769, now seen corresponding path program 1 times [2023-08-30 16:26:47,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:26:47,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534641409] [2023-08-30 16:26:47,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:26:47,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:26:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:26:47,222 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-30 16:26:47,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:26:47,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534641409] [2023-08-30 16:26:47,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534641409] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:26:47,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:26:47,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:26:47,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797469471] [2023-08-30 16:26:47,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:26:47,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:26:47,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:26:47,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:26:47,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:26:47,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 412 [2023-08-30 16:26:47,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 142 transitions, 1348 flow. Second operand has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:47,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:26:47,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 412 [2023-08-30 16:26:47,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:27:02,819 INFO L130 PetriNetUnfolder]: 130983/182029 cut-off events. [2023-08-30 16:27:02,820 INFO L131 PetriNetUnfolder]: For 477935/496423 co-relation queries the response was YES. [2023-08-30 16:27:03,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589017 conditions, 182029 events. 130983/182029 cut-off events. For 477935/496423 co-relation queries the response was YES. Maximal size of possible extension queue 7441. Compared 1400060 event pairs, 19637 based on Foata normal form. 4351/165741 useless extension candidates. Maximal degree in co-relation 588991. Up to 91997 conditions per place. [2023-08-30 16:27:04,417 INFO L137 encePairwiseOnDemand]: 401/412 looper letters, 161 selfloop transitions, 136 changer transitions 0/320 dead transitions. [2023-08-30 16:27:04,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 320 transitions, 3519 flow [2023-08-30 16:27:04,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:27:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:27:04,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 964 transitions. [2023-08-30 16:27:04,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4679611650485437 [2023-08-30 16:27:04,418 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 964 transitions. [2023-08-30 16:27:04,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 964 transitions. [2023-08-30 16:27:04,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:27:04,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 964 transitions. [2023-08-30 16:27:04,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 192.8) internal successors, (964), 5 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:27:04,422 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-08-30 16:27:04,422 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-08-30 16:27:04,422 INFO L175 Difference]: Start difference. First operand has 87 places, 142 transitions, 1348 flow. Second operand 5 states and 964 transitions. [2023-08-30 16:27:04,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 320 transitions, 3519 flow [2023-08-30 16:27:10,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 320 transitions, 3487 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-30 16:27:10,322 INFO L231 Difference]: Finished difference. Result has 93 places, 233 transitions, 3106 flow [2023-08-30 16:27:10,322 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-08-30 16:27:10,322 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 42 predicate places. [2023-08-30 16:27:10,323 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 233 transitions, 3106 flow [2023-08-30 16:27:10,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:27:10,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:27:10,323 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:27:10,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-08-30 16:27:10,323 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-08-30 16:27:10,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:27:10,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1375875175, now seen corresponding path program 2 times [2023-08-30 16:27:10,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:27:10,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246338508] [2023-08-30 16:27:10,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:27:10,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:27:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:27:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 16:27:10,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:27:10,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246338508] [2023-08-30 16:27:10,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246338508] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:27:10,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:27:10,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:27:10,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724379616] [2023-08-30 16:27:10,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:27:10,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:27:10,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:27:10,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:27:10,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:27:10,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 412 [2023-08-30 16:27:10,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 233 transitions, 3106 flow. Second operand has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 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-08-30 16:27:10,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:27:10,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 412 [2023-08-30 16:27:10,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:27:32,989 INFO L130 PetriNetUnfolder]: 160829/227060 cut-off events. [2023-08-30 16:27:32,989 INFO L131 PetriNetUnfolder]: For 756426/763402 co-relation queries the response was YES. [2023-08-30 16:27:34,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788676 conditions, 227060 events. 160829/227060 cut-off events. For 756426/763402 co-relation queries the response was YES. Maximal size of possible extension queue 9471. Compared 1848628 event pairs, 68457 based on Foata normal form. 1470/215422 useless extension candidates. Maximal degree in co-relation 788647. Up to 121898 conditions per place. [2023-08-30 16:27:35,580 INFO L137 encePairwiseOnDemand]: 402/412 looper letters, 206 selfloop transitions, 143 changer transitions 0/364 dead transitions. [2023-08-30 16:27:35,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 364 transitions, 4796 flow [2023-08-30 16:27:35,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:27:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:27:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1108 transitions. [2023-08-30 16:27:35,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482200647249191 [2023-08-30 16:27:35,582 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1108 transitions. [2023-08-30 16:27:35,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1108 transitions. [2023-08-30 16:27:35,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:27:35,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1108 transitions. [2023-08-30 16:27:35,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 184.66666666666666) internal successors, (1108), 6 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:27:35,585 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-08-30 16:27:35,586 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-08-30 16:27:35,586 INFO L175 Difference]: Start difference. First operand has 93 places, 233 transitions, 3106 flow. Second operand 6 states and 1108 transitions. [2023-08-30 16:27:35,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 364 transitions, 4796 flow [2023-08-30 16:28:06,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 364 transitions, 4748 flow, removed 24 selfloop flow, removed 0 redundant places. [2023-08-30 16:28:06,916 INFO L231 Difference]: Finished difference. Result has 102 places, 272 transitions, 4131 flow [2023-08-30 16:28:06,916 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=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4131, PETRI_PLACES=102, PETRI_TRANSITIONS=272} [2023-08-30 16:28:06,916 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 51 predicate places. [2023-08-30 16:28:06,916 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 272 transitions, 4131 flow [2023-08-30 16:28:06,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 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-08-30 16:28:06,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:28:06,917 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:28:06,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-08-30 16:28:06,917 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-08-30 16:28:06,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:28:06,917 INFO L85 PathProgramCache]: Analyzing trace with hash -650424333, now seen corresponding path program 3 times [2023-08-30 16:28:06,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:28:06,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296798862] [2023-08-30 16:28:06,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:28:06,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:28:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:28:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 16:28:06,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:28:06,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296798862] [2023-08-30 16:28:06,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296798862] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:28:06,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:28:06,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:28:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115224792] [2023-08-30 16:28:06,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:28:06,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:28:06,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:28:06,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:28:06,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:28:07,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 412 [2023-08-30 16:28:07,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 272 transitions, 4131 flow. Second operand has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 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-08-30 16:28:07,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:28:07,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 412 [2023-08-30 16:28:07,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:28:37,477 INFO L130 PetriNetUnfolder]: 184128/263236 cut-off events. [2023-08-30 16:28:37,477 INFO L131 PetriNetUnfolder]: For 1215300/1223849 co-relation queries the response was YES. [2023-08-30 16:28:39,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968109 conditions, 263236 events. 184128/263236 cut-off events. For 1215300/1223849 co-relation queries the response was YES. Maximal size of possible extension queue 11547. Compared 2232618 event pairs, 103562 based on Foata normal form. 1440/250142 useless extension candidates. Maximal degree in co-relation 968075. Up to 197023 conditions per place. [2023-08-30 16:28:40,703 INFO L137 encePairwiseOnDemand]: 402/412 looper letters, 319 selfloop transitions, 134 changer transitions 0/468 dead transitions. [2023-08-30 16:28:40,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 468 transitions, 7265 flow [2023-08-30 16:28:40,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:28:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:28:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1109 transitions. [2023-08-30 16:28:40,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44862459546925565 [2023-08-30 16:28:40,706 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1109 transitions. [2023-08-30 16:28:40,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1109 transitions. [2023-08-30 16:28:40,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:28:40,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1109 transitions. [2023-08-30 16:28:40,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 184.83333333333334) internal successors, (1109), 6 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:28:40,710 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-08-30 16:28:40,711 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-08-30 16:28:40,711 INFO L175 Difference]: Start difference. First operand has 102 places, 272 transitions, 4131 flow. Second operand 6 states and 1109 transitions. [2023-08-30 16:28:40,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 468 transitions, 7265 flow [2023-08-30 16:31:08,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 468 transitions, 7237 flow, removed 14 selfloop flow, removed 0 redundant places. [2023-08-30 16:31:08,916 INFO L231 Difference]: Finished difference. Result has 111 places, 376 transitions, 6498 flow [2023-08-30 16:31:08,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=4109, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6498, PETRI_PLACES=111, PETRI_TRANSITIONS=376} [2023-08-30 16:31:08,917 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 60 predicate places. [2023-08-30 16:31:08,917 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 376 transitions, 6498 flow [2023-08-30 16:31:08,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 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-08-30 16:31:08,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:31:08,917 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-08-30 16:31:08,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2023-08-30 16:31:08,917 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-08-30 16:31:08,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:31:08,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1738518391, now seen corresponding path program 1 times [2023-08-30 16:31:08,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:31:08,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320603825] [2023-08-30 16:31:08,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:31:08,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:31:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:31:08,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 16:31:08,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:31:08,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320603825] [2023-08-30 16:31:08,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320603825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:31:08,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:31:08,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:31:08,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933784724] [2023-08-30 16:31:08,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:31:08,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:31:08,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:31:08,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:31:08,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:31:09,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 412 [2023-08-30 16:31:09,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 376 transitions, 6498 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-08-30 16:31:09,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:31:09,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 412 [2023-08-30 16:31:09,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:31:18,274 INFO L130 PetriNetUnfolder]: 48295/79703 cut-off events. [2023-08-30 16:31:18,274 INFO L131 PetriNetUnfolder]: For 345398/352552 co-relation queries the response was YES. [2023-08-30 16:31:18,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283650 conditions, 79703 events. 48295/79703 cut-off events. For 345398/352552 co-relation queries the response was YES. Maximal size of possible extension queue 2886. Compared 732096 event pairs, 17868 based on Foata normal form. 1262/77196 useless extension candidates. Maximal degree in co-relation 283611. Up to 39973 conditions per place. [2023-08-30 16:31:19,125 INFO L137 encePairwiseOnDemand]: 404/412 looper letters, 96 selfloop transitions, 8 changer transitions 0/293 dead transitions. [2023-08-30 16:31:19,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 293 transitions, 4537 flow [2023-08-30 16:31:19,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:31:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:31:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2023-08-30 16:31:19,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47896440129449835 [2023-08-30 16:31:19,126 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 592 transitions. [2023-08-30 16:31:19,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 592 transitions. [2023-08-30 16:31:19,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:31:19,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 592 transitions. [2023-08-30 16:31:19,127 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-08-30 16:31:19,128 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-08-30 16:31:19,128 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-08-30 16:31:19,129 INFO L175 Difference]: Start difference. First operand has 111 places, 376 transitions, 6498 flow. Second operand 3 states and 592 transitions. [2023-08-30 16:31:19,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 293 transitions, 4537 flow [2023-08-30 16:31:29,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 293 transitions, 4345 flow, removed 96 selfloop flow, removed 0 redundant places. [2023-08-30 16:31:29,533 INFO L231 Difference]: Finished difference. Result has 113 places, 246 transitions, 3754 flow [2023-08-30 16:31:29,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=3738, 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=3754, PETRI_PLACES=113, PETRI_TRANSITIONS=246} [2023-08-30 16:31:29,534 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 62 predicate places. [2023-08-30 16:31:29,534 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 246 transitions, 3754 flow [2023-08-30 16:31:29,534 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-08-30 16:31:29,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:31:29,535 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-08-30 16:31:29,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2023-08-30 16:31:29,535 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-08-30 16:31:29,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:31:29,535 INFO L85 PathProgramCache]: Analyzing trace with hash -251650996, now seen corresponding path program 1 times [2023-08-30 16:31:29,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:31:29,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58452102] [2023-08-30 16:31:29,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:31:29,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:31:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:31:29,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-08-30 16:31:29,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:31:29,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58452102] [2023-08-30 16:31:29,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58452102] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:31:29,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485038515] [2023-08-30 16:31:29,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:31:29,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:31:29,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:31:29,577 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-08-30 16:31:29,590 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-08-30 16:31:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:31:29,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 16:31:29,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:31:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-30 16:31:29,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:31:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-30 16:31:29,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485038515] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:31:29,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:31:29,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-30 16:31:29,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256239999] [2023-08-30 16:31:29,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:31:29,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:31:29,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:31:29,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:31:29,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:31:29,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 412 [2023-08-30 16:31:29,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 246 transitions, 3754 flow. Second operand has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:31:29,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:31:29,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 412 [2023-08-30 16:31:29,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:31:38,893 INFO L130 PetriNetUnfolder]: 54615/83725 cut-off events. [2023-08-30 16:31:38,893 INFO L131 PetriNetUnfolder]: For 349765/357714 co-relation queries the response was YES. [2023-08-30 16:31:39,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305441 conditions, 83725 events. 54615/83725 cut-off events. For 349765/357714 co-relation queries the response was YES. Maximal size of possible extension queue 2966. Compared 702052 event pairs, 25129 based on Foata normal form. 1652/83754 useless extension candidates. Maximal degree in co-relation 305401. Up to 55352 conditions per place. [2023-08-30 16:31:40,097 INFO L137 encePairwiseOnDemand]: 409/412 looper letters, 143 selfloop transitions, 3 changer transitions 0/335 dead transitions. [2023-08-30 16:31:40,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 335 transitions, 4792 flow [2023-08-30 16:31:40,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:31:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:31:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 767 transitions. [2023-08-30 16:31:40,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4654126213592233 [2023-08-30 16:31:40,099 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 767 transitions. [2023-08-30 16:31:40,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 767 transitions. [2023-08-30 16:31:40,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:31:40,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 767 transitions. [2023-08-30 16:31:40,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 191.75) internal successors, (767), 4 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:31:40,101 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-08-30 16:31:40,102 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-08-30 16:31:40,102 INFO L175 Difference]: Start difference. First operand has 113 places, 246 transitions, 3754 flow. Second operand 4 states and 767 transitions. [2023-08-30 16:31:40,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 335 transitions, 4792 flow [2023-08-30 16:31:45,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 335 transitions, 4772 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:31:45,124 INFO L231 Difference]: Finished difference. Result has 116 places, 247 transitions, 3762 flow [2023-08-30 16:31:45,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=3746, 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=3762, PETRI_PLACES=116, PETRI_TRANSITIONS=247} [2023-08-30 16:31:45,125 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 65 predicate places. [2023-08-30 16:31:45,125 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 247 transitions, 3762 flow [2023-08-30 16:31:45,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:31:45,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:31:45,125 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-08-30 16:31:45,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-30 16:31:45,328 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-08-30 16:31:45,328 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-08-30 16:31:45,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:31:45,329 INFO L85 PathProgramCache]: Analyzing trace with hash -423676854, now seen corresponding path program 2 times [2023-08-30 16:31:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:31:45,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801780752] [2023-08-30 16:31:45,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:31:45,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:31:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:31:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-30 16:31:45,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:31:45,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801780752] [2023-08-30 16:31:45,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801780752] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:31:45,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:31:45,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:31:45,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817479542] [2023-08-30 16:31:45,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:31:45,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:31:45,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:31:45,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:31:45,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:31:45,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 412 [2023-08-30 16:31:45,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 247 transitions, 3762 flow. Second operand has 5 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:31:45,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:31:45,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 412 [2023-08-30 16:31:45,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:31:59,883 INFO L130 PetriNetUnfolder]: 83441/126657 cut-off events. [2023-08-30 16:31:59,883 INFO L131 PetriNetUnfolder]: For 560875/566969 co-relation queries the response was YES. [2023-08-30 16:32:01,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473142 conditions, 126657 events. 83441/126657 cut-off events. For 560875/566969 co-relation queries the response was YES. Maximal size of possible extension queue 4624. Compared 1089540 event pairs, 37346 based on Foata normal form. 860/124222 useless extension candidates. Maximal degree in co-relation 473100. Up to 63167 conditions per place. [2023-08-30 16:32:01,609 INFO L137 encePairwiseOnDemand]: 402/412 looper letters, 229 selfloop transitions, 172 changer transitions 2/423 dead transitions. [2023-08-30 16:32:01,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 423 transitions, 6480 flow [2023-08-30 16:32:01,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:32:01,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:32:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1101 transitions. [2023-08-30 16:32:01,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44538834951456313 [2023-08-30 16:32:01,610 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1101 transitions. [2023-08-30 16:32:01,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1101 transitions. [2023-08-30 16:32:01,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:32:01,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1101 transitions. [2023-08-30 16:32:01,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 183.5) internal successors, (1101), 6 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:32:01,613 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-08-30 16:32:01,613 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-08-30 16:32:01,613 INFO L175 Difference]: Start difference. First operand has 116 places, 247 transitions, 3762 flow. Second operand 6 states and 1101 transitions. [2023-08-30 16:32:01,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 423 transitions, 6480 flow [2023-08-30 16:32:17,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 423 transitions, 6464 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 16:32:17,050 INFO L231 Difference]: Finished difference. Result has 123 places, 311 transitions, 5483 flow [2023-08-30 16:32:17,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=3719, 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=5483, PETRI_PLACES=123, PETRI_TRANSITIONS=311} [2023-08-30 16:32:17,050 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 72 predicate places. [2023-08-30 16:32:17,050 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 311 transitions, 5483 flow [2023-08-30 16:32:17,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:32:17,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:32:17,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-08-30 16:32:17,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2023-08-30 16:32:17,051 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-08-30 16:32:17,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:32:17,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1676756770, now seen corresponding path program 1 times [2023-08-30 16:32:17,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:32:17,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284846912] [2023-08-30 16:32:17,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:32:17,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:32:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:32:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-30 16:32:17,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:32:17,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284846912] [2023-08-30 16:32:17,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284846912] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:32:17,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:32:17,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:32:17,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227586403] [2023-08-30 16:32:17,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:32:17,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:32:17,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:32:17,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:32:17,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:32:17,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 412 [2023-08-30 16:32:17,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 311 transitions, 5483 flow. Second operand has 5 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:32:17,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:32:17,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 412 [2023-08-30 16:32:17,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:32:34,433 INFO L130 PetriNetUnfolder]: 89766/138622 cut-off events. [2023-08-30 16:32:34,434 INFO L131 PetriNetUnfolder]: For 737568/744100 co-relation queries the response was YES. [2023-08-30 16:32:35,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533647 conditions, 138622 events. 89766/138622 cut-off events. For 737568/744100 co-relation queries the response was YES. Maximal size of possible extension queue 5935. Compared 1239708 event pairs, 42874 based on Foata normal form. 970/138757 useless extension candidates. Maximal degree in co-relation 533601. Up to 72013 conditions per place. [2023-08-30 16:32:36,610 INFO L137 encePairwiseOnDemand]: 402/412 looper letters, 264 selfloop transitions, 207 changer transitions 4/495 dead transitions. [2023-08-30 16:32:36,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 495 transitions, 8619 flow [2023-08-30 16:32:36,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:32:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:32:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1099 transitions. [2023-08-30 16:32:36,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44457928802589 [2023-08-30 16:32:36,613 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1099 transitions. [2023-08-30 16:32:36,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1099 transitions. [2023-08-30 16:32:36,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:32:36,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1099 transitions. [2023-08-30 16:32:36,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 183.16666666666666) internal successors, (1099), 6 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:32:36,641 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-08-30 16:32:36,642 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-08-30 16:32:36,642 INFO L175 Difference]: Start difference. First operand has 123 places, 311 transitions, 5483 flow. Second operand 6 states and 1099 transitions. [2023-08-30 16:32:36,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 495 transitions, 8619 flow [2023-08-30 16:33:03,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 495 transitions, 8619 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:33:03,931 INFO L231 Difference]: Finished difference. Result has 132 places, 363 transitions, 7281 flow [2023-08-30 16:33:03,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=5343, 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=7281, PETRI_PLACES=132, PETRI_TRANSITIONS=363} [2023-08-30 16:33:03,931 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 81 predicate places. [2023-08-30 16:33:03,932 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 363 transitions, 7281 flow [2023-08-30 16:33:03,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:33:03,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:33:03,932 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-08-30 16:33:03,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2023-08-30 16:33:03,932 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-08-30 16:33:03,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:33:03,932 INFO L85 PathProgramCache]: Analyzing trace with hash -655003718, now seen corresponding path program 1 times [2023-08-30 16:33:03,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:33:03,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786112689] [2023-08-30 16:33:03,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:33:03,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:33:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:33:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-30 16:33:03,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:33:03,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786112689] [2023-08-30 16:33:03,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786112689] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:33:03,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:33:03,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:33:03,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098988945] [2023-08-30 16:33:03,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:33:03,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:33:03,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:33:03,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:33:03,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:33:04,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 412 [2023-08-30 16:33:04,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 363 transitions, 7281 flow. Second operand has 5 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:33:04,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:33:04,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 412 [2023-08-30 16:33:04,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:33:25,500 INFO L130 PetriNetUnfolder]: 97697/152753 cut-off events. [2023-08-30 16:33:25,500 INFO L131 PetriNetUnfolder]: For 983132/991996 co-relation queries the response was YES. [2023-08-30 16:33:26,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611302 conditions, 152753 events. 97697/152753 cut-off events. For 983132/991996 co-relation queries the response was YES. Maximal size of possible extension queue 7874. Compared 1424470 event pairs, 44331 based on Foata normal form. 1492/153142 useless extension candidates. Maximal degree in co-relation 611251. Up to 74368 conditions per place. [2023-08-30 16:33:27,717 INFO L137 encePairwiseOnDemand]: 402/412 looper letters, 309 selfloop transitions, 246 changer transitions 5/584 dead transitions. [2023-08-30 16:33:27,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 584 transitions, 11533 flow [2023-08-30 16:33:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:33:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:33:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1100 transitions. [2023-08-30 16:33:27,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4449838187702265 [2023-08-30 16:33:27,718 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1100 transitions. [2023-08-30 16:33:27,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1100 transitions. [2023-08-30 16:33:27,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:33:27,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1100 transitions. [2023-08-30 16:33:27,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:33:27,722 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-08-30 16:33:27,722 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-08-30 16:33:27,722 INFO L175 Difference]: Start difference. First operand has 132 places, 363 transitions, 7281 flow. Second operand 6 states and 1100 transitions. [2023-08-30 16:33:27,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 584 transitions, 11533 flow [2023-08-30 16:34:02,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 584 transitions, 11461 flow, removed 36 selfloop flow, removed 0 redundant places. [2023-08-30 16:34:02,295 INFO L231 Difference]: Finished difference. Result has 141 places, 442 transitions, 9776 flow [2023-08-30 16:34:02,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=7029, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9776, PETRI_PLACES=141, PETRI_TRANSITIONS=442} [2023-08-30 16:34:02,296 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 90 predicate places. [2023-08-30 16:34:02,296 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 442 transitions, 9776 flow [2023-08-30 16:34:02,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:34:02,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:34:02,296 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-08-30 16:34:02,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2023-08-30 16:34:02,296 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 16:34:02,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:34:02,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1765707426, now seen corresponding path program 1 times [2023-08-30 16:34:02,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:34:02,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710965525] [2023-08-30 16:34:02,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:34:02,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:34:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:34:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-30 16:34:02,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:34:02,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710965525] [2023-08-30 16:34:02,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710965525] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:34:02,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:34:02,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:34:02,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878805882] [2023-08-30 16:34:02,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:34:02,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:34:02,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:34:02,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:34:02,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:34:02,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 412 [2023-08-30 16:34:02,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 442 transitions, 9776 flow. Second operand has 5 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:34:02,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:34:02,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 412 [2023-08-30 16:34:02,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:34:28,968 INFO L130 PetriNetUnfolder]: 104369/166383 cut-off events. [2023-08-30 16:34:28,968 INFO L131 PetriNetUnfolder]: For 1315536/1324910 co-relation queries the response was YES. [2023-08-30 16:34:30,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701453 conditions, 166383 events. 104369/166383 cut-off events. For 1315536/1324910 co-relation queries the response was YES. Maximal size of possible extension queue 10053. Compared 1617980 event pairs, 48605 based on Foata normal form. 1532/166698 useless extension candidates. Maximal degree in co-relation 701397. Up to 81670 conditions per place. [2023-08-30 16:34:31,681 INFO L137 encePairwiseOnDemand]: 402/412 looper letters, 339 selfloop transitions, 300 changer transitions 7/670 dead transitions. [2023-08-30 16:34:31,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 670 transitions, 14601 flow [2023-08-30 16:34:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:34:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:34:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1099 transitions. [2023-08-30 16:34:31,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44457928802589 [2023-08-30 16:34:31,683 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1099 transitions. [2023-08-30 16:34:31,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1099 transitions. [2023-08-30 16:34:31,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:34:31,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1099 transitions. [2023-08-30 16:34:31,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 183.16666666666666) internal successors, (1099), 6 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:34:31,686 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-08-30 16:34:31,686 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-08-30 16:34:31,686 INFO L175 Difference]: Start difference. First operand has 141 places, 442 transitions, 9776 flow. Second operand 6 states and 1099 transitions. [2023-08-30 16:34:31,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 670 transitions, 14601 flow [2023-08-30 16:35:22,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 670 transitions, 14601 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:35:22,491 INFO L231 Difference]: Finished difference. Result has 151 places, 513 transitions, 12787 flow [2023-08-30 16:35:22,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=9471, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12787, PETRI_PLACES=151, PETRI_TRANSITIONS=513} [2023-08-30 16:35:22,492 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 100 predicate places. [2023-08-30 16:35:22,492 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 513 transitions, 12787 flow [2023-08-30 16:35:22,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:35:22,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:35:22,492 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:35:22,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2023-08-30 16:35:22,492 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 16:35:22,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:35:22,492 INFO L85 PathProgramCache]: Analyzing trace with hash -775689666, now seen corresponding path program 1 times [2023-08-30 16:35:22,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:35:22,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915412268] [2023-08-30 16:35:22,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:35:22,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:35:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:35:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-30 16:35:22,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:35:22,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915412268] [2023-08-30 16:35:22,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915412268] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:35:22,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:35:22,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:35:22,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933263966] [2023-08-30 16:35:22,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:35:22,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:35:22,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:35:22,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:35:22,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:35:22,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 412 [2023-08-30 16:35:22,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 513 transitions, 12787 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:35:22,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:35:22,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 412 [2023-08-30 16:35:22,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:35:48,495 INFO L130 PetriNetUnfolder]: 79680/132852 cut-off events. [2023-08-30 16:35:48,496 INFO L131 PetriNetUnfolder]: For 1436637/1453087 co-relation queries the response was YES. [2023-08-30 16:35:50,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605583 conditions, 132852 events. 79680/132852 cut-off events. For 1436637/1453087 co-relation queries the response was YES. Maximal size of possible extension queue 7689. Compared 1348881 event pairs, 50327 based on Foata normal form. 3572/132686 useless extension candidates. Maximal degree in co-relation 605522. Up to 102200 conditions per place. [2023-08-30 16:35:51,096 INFO L137 encePairwiseOnDemand]: 409/412 looper letters, 190 selfloop transitions, 4 changer transitions 1/567 dead transitions. [2023-08-30 16:35:51,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 567 transitions, 13775 flow [2023-08-30 16:35:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:35:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:35:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 575 transitions. [2023-08-30 16:35:51,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465210355987055 [2023-08-30 16:35:51,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 575 transitions. [2023-08-30 16:35:51,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 575 transitions. [2023-08-30 16:35:51,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:35:51,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 575 transitions. [2023-08-30 16:35:51,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:35:51,117 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-08-30 16:35:51,117 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-08-30 16:35:51,117 INFO L175 Difference]: Start difference. First operand has 151 places, 513 transitions, 12787 flow. Second operand 3 states and 575 transitions. [2023-08-30 16:35:51,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 567 transitions, 13775 flow [2023-08-30 16:36:32,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 567 transitions, 13753 flow, removed 11 selfloop flow, removed 0 redundant places. [2023-08-30 16:36:32,228 INFO L231 Difference]: Finished difference. Result has 154 places, 512 transitions, 12763 flow [2023-08-30 16:36:32,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=12765, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=12763, PETRI_PLACES=154, PETRI_TRANSITIONS=512} [2023-08-30 16:36:32,229 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 103 predicate places. [2023-08-30 16:36:32,229 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 512 transitions, 12763 flow [2023-08-30 16:36:32,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:36:32,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:36:32,229 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:36:32,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2023-08-30 16:36:32,229 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 16:36:32,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:36:32,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2099943815, now seen corresponding path program 1 times [2023-08-30 16:36:32,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:36:32,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21719269] [2023-08-30 16:36:32,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:36:32,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:36:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:36:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-30 16:36:32,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:36:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21719269] [2023-08-30 16:36:32,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21719269] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:36:32,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031120679] [2023-08-30 16:36:32,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:36:32,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:36:32,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:36:32,285 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:36:32,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-30 16:36:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:36:32,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 16:36:32,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:36:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-30 16:36:32,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:36:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-30 16:36:32,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031120679] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:36:32,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:36:32,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-08-30 16:36:32,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244057172] [2023-08-30 16:36:32,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:36:32,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:36:32,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:36:32,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:36:32,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:36:32,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 412 [2023-08-30 16:36:32,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 512 transitions, 12763 flow. Second operand has 4 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:36:32,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:36:32,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 412 [2023-08-30 16:36:32,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:36:59,025 INFO L130 PetriNetUnfolder]: 86237/142435 cut-off events. [2023-08-30 16:36:59,025 INFO L131 PetriNetUnfolder]: For 1495406/1511880 co-relation queries the response was YES. [2023-08-30 16:37:00,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650517 conditions, 142435 events. 86237/142435 cut-off events. For 1495406/1511880 co-relation queries the response was YES. Maximal size of possible extension queue 7681. Compared 1433014 event pairs, 50127 based on Foata normal form. 3578/142703 useless extension candidates. Maximal degree in co-relation 650454. Up to 101808 conditions per place. [2023-08-30 16:37:01,385 INFO L137 encePairwiseOnDemand]: 409/412 looper letters, 244 selfloop transitions, 5 changer transitions 0/621 dead transitions. [2023-08-30 16:37:01,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 621 transitions, 14455 flow [2023-08-30 16:37:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:37:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:37:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 765 transitions. [2023-08-30 16:37:01,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4641990291262136 [2023-08-30 16:37:01,386 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 765 transitions. [2023-08-30 16:37:01,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 765 transitions. [2023-08-30 16:37:01,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:01,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 765 transitions. [2023-08-30 16:37:01,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 191.25) internal successors, (765), 4 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:37:01,388 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-08-30 16:37:01,388 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-08-30 16:37:01,388 INFO L175 Difference]: Start difference. First operand has 154 places, 512 transitions, 12763 flow. Second operand 4 states and 765 transitions. [2023-08-30 16:37:01,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 621 transitions, 14455 flow [2023-08-30 16:37:42,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 621 transitions, 14447 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 16:37:42,430 INFO L231 Difference]: Finished difference. Result has 157 places, 513 transitions, 12778 flow [2023-08-30 16:37:42,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=12755, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=12778, PETRI_PLACES=157, PETRI_TRANSITIONS=513} [2023-08-30 16:37:42,431 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 106 predicate places. [2023-08-30 16:37:42,431 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 513 transitions, 12778 flow [2023-08-30 16:37:42,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:37:42,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:42,432 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:42,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-08-30 16:37:42,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:37:42,633 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 16:37:42,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash -202149474, now seen corresponding path program 2 times [2023-08-30 16:37:42,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:42,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506247489] [2023-08-30 16:37:42,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:42,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-30 16:37:42,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:42,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506247489] [2023-08-30 16:37:42,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506247489] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:42,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:37:42,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:37:42,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810689786] [2023-08-30 16:37:42,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:42,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:37:42,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:42,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:37:42,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:37:42,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 412 [2023-08-30 16:37:42,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 513 transitions, 12778 flow. Second operand has 5 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:37:42,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:42,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 412 [2023-08-30 16:37:42,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15