./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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 ../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c -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 d8915194b3978f524e3b82313f6c905aed9b5c215c3d66b411e7857ee0b93981 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:39:13,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:39:13,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:39:13,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:39:13,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:39:13,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:39:13,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:39:13,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:39:13,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:39:13,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:39:13,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:39:13,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:39:13,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:39:13,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:39:13,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:39:13,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:39:13,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:39:13,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:39:13,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:39:13,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:39:13,114 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:39:13,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:39:13,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:39:13,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:39:13,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:39:13,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:39:13,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:39:13,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:39:13,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:39:13,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:39:13,121 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:39:13,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:39:13,122 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:39:13,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:39:13,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:39:13,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:39:13,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:39:13,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:39:13,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:39:13,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:39:13,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:39:13,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:39:13,127 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:39:13,155 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:39:13,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:39:13,155 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:39:13,156 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:39:13,156 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:39:13,156 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:39:13,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:39:13,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:39:13,157 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:39:13,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:39:13,158 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:39:13,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:39:13,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:39:13,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:39:13,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:39:13,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:39:13,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:39:13,159 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:39:13,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:39:13,159 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:39:13,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:39:13,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:39:13,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:39:13,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:39:13,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:39:13,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:39:13,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:39:13,161 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:39:13,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:39:13,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:39:13,161 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:39:13,161 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:39:13,162 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:39:13,162 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.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 -> d8915194b3978f524e3b82313f6c905aed9b5c215c3d66b411e7857ee0b93981 [2022-07-12 10:39:13,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:39:13,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:39:13,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:39:13,386 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:39:13,387 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:39:13,388 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2022-07-12 10:39:13,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb06eaa2/0750712f0a49436692799eccd226631d/FLAG10ce67a3f [2022-07-12 10:39:13,765 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:39:13,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2022-07-12 10:39:13,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb06eaa2/0750712f0a49436692799eccd226631d/FLAG10ce67a3f [2022-07-12 10:39:14,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb06eaa2/0750712f0a49436692799eccd226631d [2022-07-12 10:39:14,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:39:14,191 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:39:14,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:39:14,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:39:14,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:39:14,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:39:14" (1/1) ... [2022-07-12 10:39:14,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e0b686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:14, skipping insertion in model container [2022-07-12 10:39:14,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:39:14" (1/1) ... [2022-07-12 10:39:14,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:39:14,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:39:14,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c[2650,2663] [2022-07-12 10:39:14,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:39:14,431 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:39:14,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c[2650,2663] [2022-07-12 10:39:14,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:39:14,462 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:39:14,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:14 WrapperNode [2022-07-12 10:39:14,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:39:14,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:39:14,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:39:14,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:39:14,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:14" (1/1) ... [2022-07-12 10:39:14,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:14" (1/1) ... [2022-07-12 10:39:14,491 INFO L137 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 142 [2022-07-12 10:39:14,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:39:14,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:39:14,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:39:14,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:39:14,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:14" (1/1) ... [2022-07-12 10:39:14,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:14" (1/1) ... [2022-07-12 10:39:14,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:14" (1/1) ... [2022-07-12 10:39:14,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:14" (1/1) ... [2022-07-12 10:39:14,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:14" (1/1) ... [2022-07-12 10:39:14,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:14" (1/1) ... [2022-07-12 10:39:14,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:14" (1/1) ... [2022-07-12 10:39:14,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:39:14,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:39:14,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:39:14,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:39:14,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:14" (1/1) ... [2022-07-12 10:39:14,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:39:14,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:14,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 10:39:14,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 10:39:14,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:39:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-12 10:39:14,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-12 10:39:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-12 10:39:14,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-12 10:39:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:39:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:39:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:39:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:39:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:39:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:39:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:39:14,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:39:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:39:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:39:14,568 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:39:14,648 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:39:14,649 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:39:14,826 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:39:14,900 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:39:14,900 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 10:39:14,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:39:14 BoogieIcfgContainer [2022-07-12 10:39:14,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:39:14,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:39:14,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:39:14,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:39:14,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:39:14" (1/3) ... [2022-07-12 10:39:14,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f70391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:39:14, skipping insertion in model container [2022-07-12 10:39:14,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:14" (2/3) ... [2022-07-12 10:39:14,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f70391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:39:14, skipping insertion in model container [2022-07-12 10:39:14,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:39:14" (3/3) ... [2022-07-12 10:39:14,913 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2022-07-12 10:39:14,918 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:39:14,923 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:39:14,924 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:39:14,924 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:39:14,967 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-12 10:39:15,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 133 transitions, 282 flow [2022-07-12 10:39:15,057 INFO L129 PetriNetUnfolder]: 11/131 cut-off events. [2022-07-12 10:39:15,057 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-12 10:39:15,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 131 events. 11/131 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-07-12 10:39:15,060 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 133 transitions, 282 flow [2022-07-12 10:39:15,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 122 transitions, 256 flow [2022-07-12 10:39:15,077 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:39:15,082 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d6bfb0d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70910561 [2022-07-12 10:39:15,082 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-12 10:39:15,110 INFO L129 PetriNetUnfolder]: 11/121 cut-off events. [2022-07-12 10:39:15,111 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-12 10:39:15,111 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:15,111 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:15,112 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:15,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:15,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2032369785, now seen corresponding path program 1 times [2022-07-12 10:39:15,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:15,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937876984] [2022-07-12 10:39:15,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:15,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:15,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:15,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937876984] [2022-07-12 10:39:15,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937876984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:15,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:15,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:39:15,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180526443] [2022-07-12 10:39:15,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:15,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 10:39:15,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:15,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 10:39:15,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 10:39:15,322 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 133 [2022-07-12 10:39:15,327 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 122 transitions, 256 flow. Second operand has 2 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,327 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:15,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 133 [2022-07-12 10:39:15,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:15,380 INFO L129 PetriNetUnfolder]: 8/122 cut-off events. [2022-07-12 10:39:15,381 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-07-12 10:39:15,381 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 122 events. 8/122 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 1 based on Foata normal form. 10/122 useless extension candidates. Maximal degree in co-relation 83. Up to 13 conditions per place. [2022-07-12 10:39:15,382 INFO L132 encePairwiseOnDemand]: 126/133 looper letters, 7 selfloop transitions, 0 changer transitions 3/115 dead transitions. [2022-07-12 10:39:15,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 256 flow [2022-07-12 10:39:15,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 10:39:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-12 10:39:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 250 transitions. [2022-07-12 10:39:15,392 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9398496240601504 [2022-07-12 10:39:15,392 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 250 transitions. [2022-07-12 10:39:15,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 250 transitions. [2022-07-12 10:39:15,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:15,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 250 transitions. [2022-07-12 10:39:15,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,407 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,409 INFO L186 Difference]: Start difference. First operand has 118 places, 122 transitions, 256 flow. Second operand 2 states and 250 transitions. [2022-07-12 10:39:15,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 256 flow [2022-07-12 10:39:15,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 115 transitions, 248 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:39:15,414 INFO L242 Difference]: Finished difference. Result has 115 places, 112 transitions, 228 flow [2022-07-12 10:39:15,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=228, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2022-07-12 10:39:15,417 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-07-12 10:39:15,417 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 228 flow [2022-07-12 10:39:15,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,418 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:15,418 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:15,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:39:15,419 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:15,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash 882365775, now seen corresponding path program 1 times [2022-07-12 10:39:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:15,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857625403] [2022-07-12 10:39:15,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:15,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:15,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:15,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857625403] [2022-07-12 10:39:15,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857625403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:15,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:15,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:39:15,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494423256] [2022-07-12 10:39:15,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:15,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:39:15,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:15,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:39:15,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:39:15,572 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 133 [2022-07-12 10:39:15,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:15,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 133 [2022-07-12 10:39:15,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:15,634 INFO L129 PetriNetUnfolder]: 13/157 cut-off events. [2022-07-12 10:39:15,634 INFO L130 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-07-12 10:39:15,635 INFO L84 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 157 events. 13/157 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 254 event pairs, 1 based on Foata normal form. 2/149 useless extension candidates. Maximal degree in co-relation 199. Up to 19 conditions per place. [2022-07-12 10:39:15,635 INFO L132 encePairwiseOnDemand]: 128/133 looper letters, 23 selfloop transitions, 2 changer transitions 4/121 dead transitions. [2022-07-12 10:39:15,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 121 transitions, 307 flow [2022-07-12 10:39:15,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:39:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-12 10:39:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-07-12 10:39:15,639 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8120300751879699 [2022-07-12 10:39:15,639 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2022-07-12 10:39:15,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2022-07-12 10:39:15,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:15,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2022-07-12 10:39:15,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,651 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,651 INFO L186 Difference]: Start difference. First operand has 115 places, 112 transitions, 228 flow. Second operand 5 states and 540 transitions. [2022-07-12 10:39:15,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 121 transitions, 307 flow [2022-07-12 10:39:15,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 121 transitions, 307 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:39:15,654 INFO L242 Difference]: Finished difference. Result has 119 places, 113 transitions, 244 flow [2022-07-12 10:39:15,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=119, PETRI_TRANSITIONS=113} [2022-07-12 10:39:15,655 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2022-07-12 10:39:15,655 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 113 transitions, 244 flow [2022-07-12 10:39:15,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,657 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:15,657 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:15,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:39:15,658 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:15,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1024793816, now seen corresponding path program 1 times [2022-07-12 10:39:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:15,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240377937] [2022-07-12 10:39:15,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:15,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:15,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:15,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240377937] [2022-07-12 10:39:15,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240377937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:15,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:15,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:39:15,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240993081] [2022-07-12 10:39:15,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:15,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:39:15,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:15,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:39:15,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:39:15,811 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 133 [2022-07-12 10:39:15,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 113 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:15,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 133 [2022-07-12 10:39:15,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:15,878 INFO L129 PetriNetUnfolder]: 18/188 cut-off events. [2022-07-12 10:39:15,878 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-07-12 10:39:15,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 188 events. 18/188 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 361 event pairs, 3 based on Foata normal form. 3/175 useless extension candidates. Maximal degree in co-relation 240. Up to 30 conditions per place. [2022-07-12 10:39:15,883 INFO L132 encePairwiseOnDemand]: 127/133 looper letters, 14 selfloop transitions, 5 changer transitions 2/118 dead transitions. [2022-07-12 10:39:15,883 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 118 transitions, 298 flow [2022-07-12 10:39:15,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:39:15,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:39:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2022-07-12 10:39:15,885 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8796992481203008 [2022-07-12 10:39:15,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2022-07-12 10:39:15,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2022-07-12 10:39:15,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:15,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2022-07-12 10:39:15,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,888 INFO L186 Difference]: Start difference. First operand has 119 places, 113 transitions, 244 flow. Second operand 3 states and 351 transitions. [2022-07-12 10:39:15,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 118 transitions, 298 flow [2022-07-12 10:39:15,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 118 transitions, 292 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-07-12 10:39:15,893 INFO L242 Difference]: Finished difference. Result has 117 places, 115 transitions, 263 flow [2022-07-12 10:39:15,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=117, PETRI_TRANSITIONS=115} [2022-07-12 10:39:15,896 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2022-07-12 10:39:15,896 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 115 transitions, 263 flow [2022-07-12 10:39:15,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,897 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:15,897 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:15,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:39:15,898 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:15,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:15,898 INFO L85 PathProgramCache]: Analyzing trace with hash 315089418, now seen corresponding path program 1 times [2022-07-12 10:39:15,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:15,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312608234] [2022-07-12 10:39:15,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:15,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:15,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:15,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312608234] [2022-07-12 10:39:15,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312608234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:15,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:15,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:39:15,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113313749] [2022-07-12 10:39:15,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:15,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:39:15,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:15,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:39:15,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:39:15,988 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 133 [2022-07-12 10:39:15,989 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 115 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:15,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:15,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 133 [2022-07-12 10:39:15,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:16,030 INFO L129 PetriNetUnfolder]: 29/229 cut-off events. [2022-07-12 10:39:16,031 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-07-12 10:39:16,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 229 events. 29/229 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 667 event pairs, 7 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 322. Up to 46 conditions per place. [2022-07-12 10:39:16,034 INFO L132 encePairwiseOnDemand]: 130/133 looper letters, 16 selfloop transitions, 2 changer transitions 1/120 dead transitions. [2022-07-12 10:39:16,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 120 transitions, 316 flow [2022-07-12 10:39:16,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:39:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:39:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2022-07-12 10:39:16,035 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9022556390977443 [2022-07-12 10:39:16,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2022-07-12 10:39:16,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2022-07-12 10:39:16,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:16,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2022-07-12 10:39:16,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:16,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:16,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:16,042 INFO L186 Difference]: Start difference. First operand has 117 places, 115 transitions, 263 flow. Second operand 3 states and 360 transitions. [2022-07-12 10:39:16,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 120 transitions, 316 flow [2022-07-12 10:39:16,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:39:16,045 INFO L242 Difference]: Finished difference. Result has 119 places, 115 transitions, 266 flow [2022-07-12 10:39:16,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=119, PETRI_TRANSITIONS=115} [2022-07-12 10:39:16,047 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2022-07-12 10:39:16,053 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 115 transitions, 266 flow [2022-07-12 10:39:16,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:16,053 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:16,053 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:16,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:39:16,054 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:16,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:16,055 INFO L85 PathProgramCache]: Analyzing trace with hash 660397636, now seen corresponding path program 1 times [2022-07-12 10:39:16,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:16,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779223336] [2022-07-12 10:39:16,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:16,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:16,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:16,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779223336] [2022-07-12 10:39:16,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779223336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:16,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:16,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:39:16,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640804270] [2022-07-12 10:39:16,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:16,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:39:16,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:16,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:39:16,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:39:16,236 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 133 [2022-07-12 10:39:16,237 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 115 transitions, 266 flow. Second operand has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 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) [2022-07-12 10:39:16,237 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:16,237 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 133 [2022-07-12 10:39:16,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:16,374 INFO L129 PetriNetUnfolder]: 25/291 cut-off events. [2022-07-12 10:39:16,374 INFO L130 PetriNetUnfolder]: For 51/55 co-relation queries the response was YES. [2022-07-12 10:39:16,375 INFO L84 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 291 events. 25/291 cut-off events. For 51/55 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 957 event pairs, 9 based on Foata normal form. 3/274 useless extension candidates. Maximal degree in co-relation 416. Up to 28 conditions per place. [2022-07-12 10:39:16,375 INFO L132 encePairwiseOnDemand]: 122/133 looper letters, 24 selfloop transitions, 9 changer transitions 11/131 dead transitions. [2022-07-12 10:39:16,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 131 transitions, 398 flow [2022-07-12 10:39:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:39:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:39:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 934 transitions. [2022-07-12 10:39:16,378 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7802840434419381 [2022-07-12 10:39:16,378 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 934 transitions. [2022-07-12 10:39:16,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 934 transitions. [2022-07-12 10:39:16,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:16,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 934 transitions. [2022-07-12 10:39:16,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.77777777777777) internal successors, (934), 9 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:16,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:16,382 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:16,382 INFO L186 Difference]: Start difference. First operand has 119 places, 115 transitions, 266 flow. Second operand 9 states and 934 transitions. [2022-07-12 10:39:16,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 131 transitions, 398 flow [2022-07-12 10:39:16,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 131 transitions, 396 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:39:16,385 INFO L242 Difference]: Finished difference. Result has 128 places, 116 transitions, 292 flow [2022-07-12 10:39:16,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=292, PETRI_PLACES=128, PETRI_TRANSITIONS=116} [2022-07-12 10:39:16,385 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 10 predicate places. [2022-07-12 10:39:16,386 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 116 transitions, 292 flow [2022-07-12 10:39:16,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 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) [2022-07-12 10:39:16,386 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:16,386 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:16,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:39:16,387 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:16,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:16,387 INFO L85 PathProgramCache]: Analyzing trace with hash 787603777, now seen corresponding path program 1 times [2022-07-12 10:39:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:16,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342710319] [2022-07-12 10:39:16,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:39:16,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:16,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342710319] [2022-07-12 10:39:16,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342710319] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:39:16,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029264524] [2022-07-12 10:39:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:16,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:16,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:16,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:39:16,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 10:39:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:16,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-12 10:39:16,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:39:16,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:17,163 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:39:17,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 10:39:17,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 10:39:17,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:17,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:17,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-07-12 10:39:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:17,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:39:18,881 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:18,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 51 [2022-07-12 10:39:18,891 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:18,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 325 treesize of output 309 [2022-07-12 10:39:18,903 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:18,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 293 treesize of output 261 [2022-07-12 10:39:18,913 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:18,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 237 [2022-07-12 10:39:19,071 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:19,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 51 [2022-07-12 10:39:19,079 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:19,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 153 [2022-07-12 10:39:19,087 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:19,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 129 [2022-07-12 10:39:19,095 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:19,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 117 [2022-07-12 10:39:20,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 10:39:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:20,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029264524] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:39:20,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:39:20,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 27, 25] total 51 [2022-07-12 10:39:20,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388863812] [2022-07-12 10:39:20,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:39:20,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-12 10:39:20,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:20,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-12 10:39:20,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=1875, Unknown=66, NotChecked=0, Total=2550 [2022-07-12 10:39:20,167 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 133 [2022-07-12 10:39:20,170 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 116 transitions, 292 flow. Second operand has 51 states, 51 states have (on average 61.78431372549019) internal successors, (3151), 51 states have internal predecessors, (3151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:20,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:20,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 133 [2022-07-12 10:39:20,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:21,234 INFO L129 PetriNetUnfolder]: 128/750 cut-off events. [2022-07-12 10:39:21,234 INFO L130 PetriNetUnfolder]: For 193/209 co-relation queries the response was YES. [2022-07-12 10:39:21,236 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 750 events. 128/750 cut-off events. For 193/209 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4510 event pairs, 6 based on Foata normal form. 2/694 useless extension candidates. Maximal degree in co-relation 1247. Up to 78 conditions per place. [2022-07-12 10:39:21,238 INFO L132 encePairwiseOnDemand]: 102/133 looper letters, 89 selfloop transitions, 39 changer transitions 20/202 dead transitions. [2022-07-12 10:39:21,238 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 202 transitions, 832 flow [2022-07-12 10:39:21,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-12 10:39:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-07-12 10:39:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2333 transitions. [2022-07-12 10:39:21,243 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4740906319853688 [2022-07-12 10:39:21,243 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 2333 transitions. [2022-07-12 10:39:21,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 2333 transitions. [2022-07-12 10:39:21,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:21,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2333 transitions. [2022-07-12 10:39:21,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 63.054054054054056) internal successors, (2333), 37 states have internal predecessors, (2333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:21,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 133.0) internal successors, (5054), 38 states have internal predecessors, (5054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:21,253 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 133.0) internal successors, (5054), 38 states have internal predecessors, (5054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:21,253 INFO L186 Difference]: Start difference. First operand has 128 places, 116 transitions, 292 flow. Second operand 37 states and 2333 transitions. [2022-07-12 10:39:21,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 202 transitions, 832 flow [2022-07-12 10:39:21,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 202 transitions, 812 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-07-12 10:39:21,257 INFO L242 Difference]: Finished difference. Result has 171 places, 136 transitions, 495 flow [2022-07-12 10:39:21,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=495, PETRI_PLACES=171, PETRI_TRANSITIONS=136} [2022-07-12 10:39:21,258 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 53 predicate places. [2022-07-12 10:39:21,258 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 136 transitions, 495 flow [2022-07-12 10:39:21,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 61.78431372549019) internal successors, (3151), 51 states have internal predecessors, (3151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:21,259 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:21,259 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:21,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 10:39:21,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 10:39:21,474 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:21,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:21,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1743264357, now seen corresponding path program 2 times [2022-07-12 10:39:21,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:21,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49701255] [2022-07-12 10:39:21,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:21,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:39:21,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:21,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49701255] [2022-07-12 10:39:21,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49701255] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:21,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:21,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 10:39:21,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265149082] [2022-07-12 10:39:21,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:21,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:39:21,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:21,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:39:21,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 10:39:21,535 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 133 [2022-07-12 10:39:21,536 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 136 transitions, 495 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 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) [2022-07-12 10:39:21,536 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:21,536 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 133 [2022-07-12 10:39:21,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:21,618 INFO L129 PetriNetUnfolder]: 98/801 cut-off events. [2022-07-12 10:39:21,619 INFO L130 PetriNetUnfolder]: For 756/804 co-relation queries the response was YES. [2022-07-12 10:39:21,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 801 events. 98/801 cut-off events. For 756/804 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4632 event pairs, 6 based on Foata normal form. 21/762 useless extension candidates. Maximal degree in co-relation 1485. Up to 101 conditions per place. [2022-07-12 10:39:21,623 INFO L132 encePairwiseOnDemand]: 129/133 looper letters, 31 selfloop transitions, 16 changer transitions 0/157 dead transitions. [2022-07-12 10:39:21,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 157 transitions, 724 flow [2022-07-12 10:39:21,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 10:39:21,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-12 10:39:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2022-07-12 10:39:21,624 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8947368421052632 [2022-07-12 10:39:21,624 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2022-07-12 10:39:21,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2022-07-12 10:39:21,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:21,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2022-07-12 10:39:21,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:21,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:21,626 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:21,626 INFO L186 Difference]: Start difference. First operand has 171 places, 136 transitions, 495 flow. Second operand 4 states and 476 transitions. [2022-07-12 10:39:21,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 157 transitions, 724 flow [2022-07-12 10:39:21,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 157 transitions, 646 flow, removed 18 selfloop flow, removed 22 redundant places. [2022-07-12 10:39:21,631 INFO L242 Difference]: Finished difference. Result has 150 places, 149 transitions, 610 flow [2022-07-12 10:39:21,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=610, PETRI_PLACES=150, PETRI_TRANSITIONS=149} [2022-07-12 10:39:21,632 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 32 predicate places. [2022-07-12 10:39:21,632 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 149 transitions, 610 flow [2022-07-12 10:39:21,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 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) [2022-07-12 10:39:21,633 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:21,633 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:21,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:39:21,633 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:21,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:21,634 INFO L85 PathProgramCache]: Analyzing trace with hash 209023655, now seen corresponding path program 3 times [2022-07-12 10:39:21,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:21,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360175601] [2022-07-12 10:39:21,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:21,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:39:21,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:21,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360175601] [2022-07-12 10:39:21,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360175601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:21,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:21,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 10:39:21,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111063312] [2022-07-12 10:39:21,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:21,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:39:21,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:21,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:39:21,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 10:39:21,708 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 133 [2022-07-12 10:39:21,708 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 149 transitions, 610 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:21,708 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:21,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 133 [2022-07-12 10:39:21,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:21,853 INFO L129 PetriNetUnfolder]: 172/1415 cut-off events. [2022-07-12 10:39:21,853 INFO L130 PetriNetUnfolder]: For 1367/1380 co-relation queries the response was YES. [2022-07-12 10:39:21,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 1415 events. 172/1415 cut-off events. For 1367/1380 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 10848 event pairs, 37 based on Foata normal form. 49/1330 useless extension candidates. Maximal degree in co-relation 2599. Up to 193 conditions per place. [2022-07-12 10:39:21,860 INFO L132 encePairwiseOnDemand]: 129/133 looper letters, 46 selfloop transitions, 4 changer transitions 1/163 dead transitions. [2022-07-12 10:39:21,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 163 transitions, 825 flow [2022-07-12 10:39:21,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 10:39:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-12 10:39:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 474 transitions. [2022-07-12 10:39:21,861 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8909774436090225 [2022-07-12 10:39:21,862 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 474 transitions. [2022-07-12 10:39:21,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 474 transitions. [2022-07-12 10:39:21,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:21,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 474 transitions. [2022-07-12 10:39:21,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:21,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:21,864 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:21,864 INFO L186 Difference]: Start difference. First operand has 150 places, 149 transitions, 610 flow. Second operand 4 states and 474 transitions. [2022-07-12 10:39:21,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 163 transitions, 825 flow [2022-07-12 10:39:21,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 163 transitions, 813 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-07-12 10:39:21,868 INFO L242 Difference]: Finished difference. Result has 155 places, 148 transitions, 606 flow [2022-07-12 10:39:21,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=606, PETRI_PLACES=155, PETRI_TRANSITIONS=148} [2022-07-12 10:39:21,868 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 37 predicate places. [2022-07-12 10:39:21,869 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 148 transitions, 606 flow [2022-07-12 10:39:21,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:21,869 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:21,869 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:21,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:39:21,869 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:21,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:21,870 INFO L85 PathProgramCache]: Analyzing trace with hash 4844825, now seen corresponding path program 1 times [2022-07-12 10:39:21,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:21,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761729117] [2022-07-12 10:39:21,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:21,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:21,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:21,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761729117] [2022-07-12 10:39:21,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761729117] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:39:21,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158066300] [2022-07-12 10:39:21,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:21,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:21,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:21,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:39:21,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 10:39:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:22,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 10:39:22,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:39:22,424 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:22,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:39:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:22,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158066300] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:39:22,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:39:22,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 33 [2022-07-12 10:39:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688819912] [2022-07-12 10:39:22,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:39:22,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 10:39:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 10:39:22,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 10:39:22,848 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 133 [2022-07-12 10:39:22,851 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 148 transitions, 606 flow. Second operand has 33 states, 33 states have (on average 96.57575757575758) internal successors, (3187), 33 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:22,851 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:22,851 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 133 [2022-07-12 10:39:22,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:23,963 INFO L129 PetriNetUnfolder]: 349/2116 cut-off events. [2022-07-12 10:39:23,963 INFO L130 PetriNetUnfolder]: For 2957/2965 co-relation queries the response was YES. [2022-07-12 10:39:23,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4262 conditions, 2116 events. 349/2116 cut-off events. For 2957/2965 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 17892 event pairs, 109 based on Foata normal form. 75/1996 useless extension candidates. Maximal degree in co-relation 4238. Up to 314 conditions per place. [2022-07-12 10:39:23,973 INFO L132 encePairwiseOnDemand]: 114/133 looper letters, 68 selfloop transitions, 43 changer transitions 18/216 dead transitions. [2022-07-12 10:39:23,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 216 transitions, 1206 flow [2022-07-12 10:39:23,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 10:39:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-07-12 10:39:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2449 transitions. [2022-07-12 10:39:23,978 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7365413533834586 [2022-07-12 10:39:23,978 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2449 transitions. [2022-07-12 10:39:23,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2449 transitions. [2022-07-12 10:39:23,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:23,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2449 transitions. [2022-07-12 10:39:23,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 97.96) internal successors, (2449), 25 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:23,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 133.0) internal successors, (3458), 26 states have internal predecessors, (3458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:23,987 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 133.0) internal successors, (3458), 26 states have internal predecessors, (3458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:23,987 INFO L186 Difference]: Start difference. First operand has 155 places, 148 transitions, 606 flow. Second operand 25 states and 2449 transitions. [2022-07-12 10:39:23,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 216 transitions, 1206 flow [2022-07-12 10:39:23,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 216 transitions, 1187 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-07-12 10:39:23,994 INFO L242 Difference]: Finished difference. Result has 189 places, 168 transitions, 926 flow [2022-07-12 10:39:23,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=926, PETRI_PLACES=189, PETRI_TRANSITIONS=168} [2022-07-12 10:39:23,995 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 71 predicate places. [2022-07-12 10:39:23,995 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 168 transitions, 926 flow [2022-07-12 10:39:23,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 96.57575757575758) internal successors, (3187), 33 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:23,996 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:23,996 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:24,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 10:39:24,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-12 10:39:24,213 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:24,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:24,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1831596973, now seen corresponding path program 2 times [2022-07-12 10:39:24,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:24,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187610930] [2022-07-12 10:39:24,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:24,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:24,343 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:24,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:24,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187610930] [2022-07-12 10:39:24,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187610930] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:39:24,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343413140] [2022-07-12 10:39:24,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:39:24,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:24,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:24,357 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:39:24,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 10:39:24,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:39:24,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:39:24,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 10:39:24,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:39:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:24,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:39:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:25,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343413140] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:39:25,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:39:25,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 29 [2022-07-12 10:39:25,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681973029] [2022-07-12 10:39:25,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:39:25,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 10:39:25,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:25,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 10:39:25,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2022-07-12 10:39:25,156 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 133 [2022-07-12 10:39:25,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 168 transitions, 926 flow. Second operand has 29 states, 29 states have (on average 96.79310344827586) internal successors, (2807), 29 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:25,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:25,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 133 [2022-07-12 10:39:25,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:25,940 INFO L129 PetriNetUnfolder]: 179/1194 cut-off events. [2022-07-12 10:39:25,940 INFO L130 PetriNetUnfolder]: For 2422/2434 co-relation queries the response was YES. [2022-07-12 10:39:25,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 1194 events. 179/1194 cut-off events. For 2422/2434 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 8403 event pairs, 87 based on Foata normal form. 8/1129 useless extension candidates. Maximal degree in co-relation 2818. Up to 314 conditions per place. [2022-07-12 10:39:25,948 INFO L132 encePairwiseOnDemand]: 115/133 looper letters, 59 selfloop transitions, 19 changer transitions 25/190 dead transitions. [2022-07-12 10:39:25,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 190 transitions, 1116 flow [2022-07-12 10:39:25,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 10:39:25,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-12 10:39:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2059 transitions. [2022-07-12 10:39:25,953 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7372001432151808 [2022-07-12 10:39:25,953 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2059 transitions. [2022-07-12 10:39:25,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2059 transitions. [2022-07-12 10:39:25,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:25,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2059 transitions. [2022-07-12 10:39:25,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 98.04761904761905) internal successors, (2059), 21 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:25,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 133.0) internal successors, (2926), 22 states have internal predecessors, (2926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:25,962 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 133.0) internal successors, (2926), 22 states have internal predecessors, (2926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:25,962 INFO L186 Difference]: Start difference. First operand has 189 places, 168 transitions, 926 flow. Second operand 21 states and 2059 transitions. [2022-07-12 10:39:25,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 190 transitions, 1116 flow [2022-07-12 10:39:25,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 190 transitions, 1067 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-07-12 10:39:25,970 INFO L242 Difference]: Finished difference. Result has 199 places, 147 transitions, 690 flow [2022-07-12 10:39:25,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=690, PETRI_PLACES=199, PETRI_TRANSITIONS=147} [2022-07-12 10:39:25,971 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 81 predicate places. [2022-07-12 10:39:25,971 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 147 transitions, 690 flow [2022-07-12 10:39:25,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 96.79310344827586) internal successors, (2807), 29 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:25,972 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:25,973 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:26,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 10:39:26,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:26,188 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:26,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:26,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1401725035, now seen corresponding path program 3 times [2022-07-12 10:39:26,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:26,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804518538] [2022-07-12 10:39:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:26,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:26,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804518538] [2022-07-12 10:39:26,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804518538] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:39:26,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611561381] [2022-07-12 10:39:26,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:39:26,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:26,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:26,348 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) [2022-07-12 10:39:26,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 10:39:26,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-12 10:39:26,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:39:26,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 10:39:26,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:39:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 10:39:26,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:39:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 10:39:26,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611561381] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:39:26,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:39:26,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-07-12 10:39:26,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110277145] [2022-07-12 10:39:26,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:39:26,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 10:39:26,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:26,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 10:39:26,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2022-07-12 10:39:26,861 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 133 [2022-07-12 10:39:26,868 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 147 transitions, 690 flow. Second operand has 26 states, 26 states have (on average 96.84615384615384) internal successors, (2518), 26 states have internal predecessors, (2518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:26,873 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:26,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 133 [2022-07-12 10:39:26,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:27,511 INFO L129 PetriNetUnfolder]: 159/1099 cut-off events. [2022-07-12 10:39:27,512 INFO L130 PetriNetUnfolder]: For 2471/2479 co-relation queries the response was YES. [2022-07-12 10:39:27,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2662 conditions, 1099 events. 159/1099 cut-off events. For 2471/2479 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7459 event pairs, 99 based on Foata normal form. 2/1033 useless extension candidates. Maximal degree in co-relation 2625. Up to 338 conditions per place. [2022-07-12 10:39:27,518 INFO L132 encePairwiseOnDemand]: 115/133 looper letters, 52 selfloop transitions, 19 changer transitions 8/166 dead transitions. [2022-07-12 10:39:27,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 166 transitions, 922 flow [2022-07-12 10:39:27,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 10:39:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-07-12 10:39:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1756 transitions. [2022-07-12 10:39:27,521 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.733500417710944 [2022-07-12 10:39:27,521 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1756 transitions. [2022-07-12 10:39:27,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1756 transitions. [2022-07-12 10:39:27,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:27,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1756 transitions. [2022-07-12 10:39:27,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 97.55555555555556) internal successors, (1756), 18 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:27,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 133.0) internal successors, (2527), 19 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:27,527 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 133.0) internal successors, (2527), 19 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:27,527 INFO L186 Difference]: Start difference. First operand has 199 places, 147 transitions, 690 flow. Second operand 18 states and 1756 transitions. [2022-07-12 10:39:27,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 166 transitions, 922 flow [2022-07-12 10:39:27,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 166 transitions, 865 flow, removed 9 selfloop flow, removed 17 redundant places. [2022-07-12 10:39:27,533 INFO L242 Difference]: Finished difference. Result has 194 places, 146 transitions, 673 flow [2022-07-12 10:39:27,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=673, PETRI_PLACES=194, PETRI_TRANSITIONS=146} [2022-07-12 10:39:27,534 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 76 predicate places. [2022-07-12 10:39:27,534 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 146 transitions, 673 flow [2022-07-12 10:39:27,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 96.84615384615384) internal successors, (2518), 26 states have internal predecessors, (2518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:27,535 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:27,535 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:27,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-12 10:39:27,749 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 [2022-07-12 10:39:27,749 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:27,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1541184629, now seen corresponding path program 4 times [2022-07-12 10:39:27,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:27,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199439261] [2022-07-12 10:39:27,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:27,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:27,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:27,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199439261] [2022-07-12 10:39:27,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199439261] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:39:27,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602309503] [2022-07-12 10:39:27,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 10:39:27,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:27,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:27,899 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) [2022-07-12 10:39:27,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 10:39:27,993 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 10:39:27,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:39:27,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 10:39:27,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:39:28,333 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:28,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:39:28,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:28,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602309503] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:39:28,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:39:28,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 31 [2022-07-12 10:39:28,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704227426] [2022-07-12 10:39:28,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:39:28,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 10:39:28,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:28,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 10:39:28,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2022-07-12 10:39:28,766 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 133 [2022-07-12 10:39:28,768 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 146 transitions, 673 flow. Second operand has 31 states, 31 states have (on average 96.6774193548387) internal successors, (2997), 31 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:28,768 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:28,768 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 133 [2022-07-12 10:39:28,768 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:29,499 INFO L129 PetriNetUnfolder]: 154/1023 cut-off events. [2022-07-12 10:39:29,499 INFO L130 PetriNetUnfolder]: For 2085/2093 co-relation queries the response was YES. [2022-07-12 10:39:29,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2447 conditions, 1023 events. 154/1023 cut-off events. For 2085/2093 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 6676 event pairs, 77 based on Foata normal form. 2/962 useless extension candidates. Maximal degree in co-relation 2410. Up to 314 conditions per place. [2022-07-12 10:39:29,506 INFO L132 encePairwiseOnDemand]: 115/133 looper letters, 41 selfloop transitions, 17 changer transitions 29/170 dead transitions. [2022-07-12 10:39:29,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 170 transitions, 919 flow [2022-07-12 10:39:29,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 10:39:29,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-07-12 10:39:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2138 transitions. [2022-07-12 10:39:29,518 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7306903622693096 [2022-07-12 10:39:29,518 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2138 transitions. [2022-07-12 10:39:29,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2138 transitions. [2022-07-12 10:39:29,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:29,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2138 transitions. [2022-07-12 10:39:29,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 97.18181818181819) internal successors, (2138), 22 states have internal predecessors, (2138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:29,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 133.0) internal successors, (3059), 23 states have internal predecessors, (3059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:29,524 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 133.0) internal successors, (3059), 23 states have internal predecessors, (3059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:29,524 INFO L186 Difference]: Start difference. First operand has 194 places, 146 transitions, 673 flow. Second operand 22 states and 2138 transitions. [2022-07-12 10:39:29,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 170 transitions, 919 flow [2022-07-12 10:39:29,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 170 transitions, 867 flow, removed 9 selfloop flow, removed 16 redundant places. [2022-07-12 10:39:29,529 INFO L242 Difference]: Finished difference. Result has 196 places, 136 transitions, 594 flow [2022-07-12 10:39:29,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=594, PETRI_PLACES=196, PETRI_TRANSITIONS=136} [2022-07-12 10:39:29,530 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 78 predicate places. [2022-07-12 10:39:29,530 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 136 transitions, 594 flow [2022-07-12 10:39:29,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 96.6774193548387) internal successors, (2997), 31 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:29,531 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:29,531 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:29,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-12 10:39:29,747 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,SelfDestructingSolverStorable11 [2022-07-12 10:39:29,747 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:29,748 INFO L85 PathProgramCache]: Analyzing trace with hash -212533129, now seen corresponding path program 5 times [2022-07-12 10:39:29,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:29,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027679148] [2022-07-12 10:39:29,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:29,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:39:29,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:29,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027679148] [2022-07-12 10:39:29,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027679148] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:39:29,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718622058] [2022-07-12 10:39:29,936 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 10:39:29,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:29,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:29,938 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) [2022-07-12 10:39:29,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 10:39:30,016 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-07-12 10:39:30,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:39:30,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-12 10:39:30,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:39:30,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:30,241 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:39:30,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 10:39:30,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 10:39:30,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:30,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:31,182 INFO L356 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2022-07-12 10:39:31,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 20 [2022-07-12 10:39:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:31,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:39:32,767 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:32,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 88 [2022-07-12 10:39:32,796 INFO L356 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-07-12 10:39:32,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 271 treesize of output 275 [2022-07-12 10:39:32,830 INFO L356 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-07-12 10:39:32,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 223 [2022-07-12 10:39:32,858 INFO L356 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-07-12 10:39:32,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 185 treesize of output 197 [2022-07-12 10:39:33,383 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:33,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 88 [2022-07-12 10:39:33,400 INFO L356 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-07-12 10:39:33,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 571 treesize of output 511 [2022-07-12 10:39:33,418 INFO L356 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-07-12 10:39:33,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 503 treesize of output 459 [2022-07-12 10:39:33,435 INFO L356 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-07-12 10:39:33,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 451 treesize of output 355 [2022-07-12 10:39:34,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 10:39:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:34,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718622058] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:39:34,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:39:34,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 29, 28] total 58 [2022-07-12 10:39:34,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930691750] [2022-07-12 10:39:34,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:39:34,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-07-12 10:39:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:34,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-07-12 10:39:34,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=2787, Unknown=51, NotChecked=0, Total=3306 [2022-07-12 10:39:34,403 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 133 [2022-07-12 10:39:34,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 136 transitions, 594 flow. Second operand has 58 states, 58 states have (on average 58.08620689655172) internal successors, (3369), 58 states have internal predecessors, (3369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:34,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:34,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 133 [2022-07-12 10:39:34,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:40,407 INFO L129 PetriNetUnfolder]: 1478/5629 cut-off events. [2022-07-12 10:39:40,408 INFO L130 PetriNetUnfolder]: For 20412/20465 co-relation queries the response was YES. [2022-07-12 10:39:40,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16842 conditions, 5629 events. 1478/5629 cut-off events. For 20412/20465 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 54341 event pairs, 128 based on Foata normal form. 35/5361 useless extension candidates. Maximal degree in co-relation 16804. Up to 635 conditions per place. [2022-07-12 10:39:40,449 INFO L132 encePairwiseOnDemand]: 102/133 looper letters, 315 selfloop transitions, 156 changer transitions 119/641 dead transitions. [2022-07-12 10:39:40,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 641 transitions, 4912 flow [2022-07-12 10:39:40,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-07-12 10:39:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2022-07-12 10:39:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 5413 transitions. [2022-07-12 10:39:40,455 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.46249145591250856 [2022-07-12 10:39:40,456 INFO L72 ComplementDD]: Start complementDD. Operand 88 states and 5413 transitions. [2022-07-12 10:39:40,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 5413 transitions. [2022-07-12 10:39:40,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:40,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 88 states and 5413 transitions. [2022-07-12 10:39:40,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 89 states, 88 states have (on average 61.51136363636363) internal successors, (5413), 88 states have internal predecessors, (5413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:40,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 89 states, 89 states have (on average 133.0) internal successors, (11837), 89 states have internal predecessors, (11837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:40,475 INFO L81 ComplementDD]: Finished complementDD. Result has 89 states, 89 states have (on average 133.0) internal successors, (11837), 89 states have internal predecessors, (11837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:40,475 INFO L186 Difference]: Start difference. First operand has 196 places, 136 transitions, 594 flow. Second operand 88 states and 5413 transitions. [2022-07-12 10:39:40,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 641 transitions, 4912 flow [2022-07-12 10:39:40,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 641 transitions, 4404 flow, removed 238 selfloop flow, removed 21 redundant places. [2022-07-12 10:39:40,494 INFO L242 Difference]: Finished difference. Result has 291 places, 272 transitions, 2610 flow [2022-07-12 10:39:40,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=2610, PETRI_PLACES=291, PETRI_TRANSITIONS=272} [2022-07-12 10:39:40,495 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 173 predicate places. [2022-07-12 10:39:40,495 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 272 transitions, 2610 flow [2022-07-12 10:39:40,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 58.08620689655172) internal successors, (3369), 58 states have internal predecessors, (3369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:40,496 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:40,496 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:40,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 10:39:40,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:40,713 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:40,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:40,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1006484589, now seen corresponding path program 6 times [2022-07-12 10:39:40,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:40,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670474742] [2022-07-12 10:39:40,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:40,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:39:40,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:40,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670474742] [2022-07-12 10:39:40,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670474742] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:39:40,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344233034] [2022-07-12 10:39:40,861 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 10:39:40,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:40,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:40,862 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) [2022-07-12 10:39:40,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 10:39:40,941 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-07-12 10:39:40,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:39:40,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-12 10:39:40,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:39:40,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:41,240 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:39:41,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 10:39:41,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 10:39:41,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:41,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:42,008 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 10:39:42,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-07-12 10:39:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:42,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:39:42,608 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~n~0 c_~back~0) (< .cse0 0) (and (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) c_~queue~0.base)) (.cse2 (* c_~back~0 4))) (or (not (= (select .cse1 (+ c_~queue~0.offset .cse2)) 1)) (not (< 1 (let ((.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse3)) (select .cse1 (+ c_~queue~0.offset .cse3 4)))))) (not (= (+ (select .cse1 (+ c_~queue~0.offset .cse2 4)) 1) 0))))) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) c_~queue~0.base)) (.cse5 (* c_~back~0 4))) (or (not (= (select .cse4 (+ c_~queue~0.offset .cse5)) 1)) (not (< (let ((.cse6 (* c_~front~0 4))) (+ c_~sum~0 (select .cse4 (+ c_~queue~0.offset .cse6)) (select .cse4 (+ c_~queue~0.offset .cse6 4)))) 0)) (not (= (+ (select .cse4 (+ c_~queue~0.offset .cse5 4)) 1) 0)))))) (< c_~back~0 0) (<= c_~n~0 .cse0))) is different from false [2022-07-12 10:39:42,754 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~n~0 c_~back~0) (< .cse0 0) (< c_~back~0 0) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) c_~queue~0.base)) (.cse2 (* c_~back~0 4))) (or (not (= (+ (select .cse1 (+ c_~queue~0.offset .cse2 4)) 1) 0)) (not (< 1 (let ((.cse3 (* c_~front~0 4))) (+ (select .cse1 (+ c_~queue~0.offset .cse3 4)) c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse3)))))) (not (= (select .cse1 (+ c_~queue~0.offset .cse2)) 1))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse5 (* c_~back~0 4)) (.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) c_~queue~0.base))) (or (not (= (+ (select .cse4 (+ c_~queue~0.offset .cse5 4)) 1) 0)) (not (= (select .cse4 (+ c_~queue~0.offset .cse5)) 1)) (not (< (let ((.cse6 (* c_~front~0 4))) (+ (select .cse4 (+ c_~queue~0.offset .cse6 4)) c_~sum~0 (select .cse4 (+ c_~queue~0.offset .cse6)))) 0)))))))) is different from false [2022-07-12 10:39:42,846 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~front~0 1))) (or (and (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse1 (* c_~back~0 4)) (.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (not (= (+ 1 (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4))) 0)) (not (< (let ((.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ .cse2 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (select .cse0 (+ .cse2 |c_ULTIMATE.start_main_#t~ret11#1.offset|)))) 0))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse4 (* c_~back~0 4)) (.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (select .cse3 (+ .cse4 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (not (= (+ 1 (select .cse3 (+ .cse4 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4))) 0)) (not (< 1 (let ((.cse5 (* c_~front~0 4))) (+ c_~sum~0 (select .cse3 (+ .cse5 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (select .cse3 (+ .cse5 |c_ULTIMATE.start_main_#t~ret11#1.offset|)))))))))) (<= c_~n~0 c_~back~0) (< .cse6 0) (< c_~back~0 0) (<= c_~n~0 .cse6))) is different from false [2022-07-12 10:39:42,957 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~n~0 c_~back~0) (< .cse0 0) (and (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse2 (* c_~back~0 4))) (or (not (= (+ (select .cse1 (+ .cse2 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) 0)) (not (< (let ((.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse1 (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse1 (+ .cse3 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) 0)) (not (= (select .cse1 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse5 (* c_~back~0 4)) (.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse4 (+ .cse5 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) 0)) (not (= (select .cse4 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (let ((.cse6 (* c_~front~0 4))) (+ c_~sum~0 (select .cse4 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse4 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))))) (< c_~back~0 0) (<= c_~n~0 .cse0))) is different from false [2022-07-12 10:39:43,087 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~front~0 1))) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~n~0 c_~back~0) (< .cse0 0) (and (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse2 (* c_~back~0 4))) (or (not (= (+ (select .cse1 (+ .cse2 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) 0)) (not (< (let ((.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse1 (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse1 (+ .cse3 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) 0)) (not (= (select .cse1 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse5 (* c_~back~0 4)) (.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse4 (+ .cse5 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) 0)) (not (= (select .cse4 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (let ((.cse6 (* c_~front~0 4))) (+ c_~sum~0 (select .cse4 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse4 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))))) (< c_~back~0 0) (<= c_~n~0 .cse0))) is different from false [2022-07-12 10:39:43,116 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~front~0 1))) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~n~0 c_~back~0) (< .cse0 0) (and (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse2 (* c_~back~0 4))) (or (not (= (+ (select .cse1 (+ .cse2 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) 0)) (not (< (let ((.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse1 (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse1 (+ .cse3 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) 0)) (not (= (select .cse1 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse5 (* c_~back~0 4)) (.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse4 (+ .cse5 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) 0)) (not (= (select .cse4 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (let ((.cse6 (* c_~front~0 4))) (+ c_~sum~0 (select .cse4 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse4 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))))) (< c_~back~0 0) (<= c_~n~0 .cse0))) is different from false [2022-07-12 10:39:43,155 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:43,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 88 [2022-07-12 10:39:43,187 INFO L356 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-07-12 10:39:43,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 571 treesize of output 555 [2022-07-12 10:39:43,226 INFO L356 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-07-12 10:39:43,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 503 treesize of output 503 [2022-07-12 10:39:43,264 INFO L356 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-07-12 10:39:43,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 451 treesize of output 399 [2022-07-12 10:39:44,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:44,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 88 [2022-07-12 10:39:44,083 INFO L356 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-07-12 10:39:44,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 271 treesize of output 245 [2022-07-12 10:39:44,100 INFO L356 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-07-12 10:39:44,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 193 [2022-07-12 10:39:44,117 INFO L356 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-07-12 10:39:44,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 185 treesize of output 167 [2022-07-12 10:39:44,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 10:39:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-12 10:39:44,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344233034] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:39:44,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:39:44,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 29, 28] total 57 [2022-07-12 10:39:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108538969] [2022-07-12 10:39:44,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:39:44,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-12 10:39:44,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:44,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-12 10:39:44,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=1999, Unknown=23, NotChecked=618, Total=3192 [2022-07-12 10:39:44,994 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 133 [2022-07-12 10:39:44,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 272 transitions, 2610 flow. Second operand has 57 states, 57 states have (on average 58.1578947368421) internal successors, (3315), 57 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:44,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:44,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 133 [2022-07-12 10:39:44,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:49,761 INFO L129 PetriNetUnfolder]: 2542/10160 cut-off events. [2022-07-12 10:39:49,761 INFO L130 PetriNetUnfolder]: For 108446/108608 co-relation queries the response was YES. [2022-07-12 10:39:49,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41552 conditions, 10160 events. 2542/10160 cut-off events. For 108446/108608 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 111099 event pairs, 489 based on Foata normal form. 79/9599 useless extension candidates. Maximal degree in co-relation 41477. Up to 1237 conditions per place. [2022-07-12 10:39:49,856 INFO L132 encePairwiseOnDemand]: 104/133 looper letters, 297 selfloop transitions, 138 changer transitions 94/580 dead transitions. [2022-07-12 10:39:49,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 580 transitions, 7209 flow [2022-07-12 10:39:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-07-12 10:39:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-07-12 10:39:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 3648 transitions. [2022-07-12 10:39:49,860 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2022-07-12 10:39:49,860 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 3648 transitions. [2022-07-12 10:39:49,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 3648 transitions. [2022-07-12 10:39:49,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:49,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 3648 transitions. [2022-07-12 10:39:49,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 60.8) internal successors, (3648), 60 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:49,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 133.0) internal successors, (8113), 61 states have internal predecessors, (8113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:49,872 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 133.0) internal successors, (8113), 61 states have internal predecessors, (8113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:49,872 INFO L186 Difference]: Start difference. First operand has 291 places, 272 transitions, 2610 flow. Second operand 60 states and 3648 transitions. [2022-07-12 10:39:49,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 580 transitions, 7209 flow [2022-07-12 10:39:50,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 580 transitions, 5691 flow, removed 739 selfloop flow, removed 24 redundant places. [2022-07-12 10:39:50,104 INFO L242 Difference]: Finished difference. Result has 343 places, 317 transitions, 2798 flow [2022-07-12 10:39:50,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=1720, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=2798, PETRI_PLACES=343, PETRI_TRANSITIONS=317} [2022-07-12 10:39:50,104 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 225 predicate places. [2022-07-12 10:39:50,104 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 317 transitions, 2798 flow [2022-07-12 10:39:50,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 58.1578947368421) internal successors, (3315), 57 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:50,105 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:50,106 INFO L200 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:50,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 10:39:50,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:50,306 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:50,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:50,307 INFO L85 PathProgramCache]: Analyzing trace with hash -918281834, now seen corresponding path program 7 times [2022-07-12 10:39:50,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:50,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788641457] [2022-07-12 10:39:50,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:50,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 10:39:50,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:50,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788641457] [2022-07-12 10:39:50,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788641457] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:39:50,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558828147] [2022-07-12 10:39:50,364 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 10:39:50,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:50,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:50,380 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) [2022-07-12 10:39:50,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 10:39:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:50,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 10:39:50,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:39:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 37 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 10:39:50,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:39:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 23 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:39:50,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558828147] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:39:50,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:39:50,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 15 [2022-07-12 10:39:50,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570516154] [2022-07-12 10:39:50,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:39:50,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 10:39:50,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:50,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 10:39:50,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:39:50,866 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 133 [2022-07-12 10:39:50,867 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 317 transitions, 2798 flow. Second operand has 15 states, 15 states have (on average 112.4) internal successors, (1686), 15 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:50,867 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:50,867 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 133 [2022-07-12 10:39:50,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:52,639 INFO L129 PetriNetUnfolder]: 1223/9149 cut-off events. [2022-07-12 10:39:52,639 INFO L130 PetriNetUnfolder]: For 98103/98338 co-relation queries the response was YES. [2022-07-12 10:39:52,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35232 conditions, 9149 events. 1223/9149 cut-off events. For 98103/98338 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 108159 event pairs, 214 based on Foata normal form. 135/8748 useless extension candidates. Maximal degree in co-relation 35141. Up to 1010 conditions per place. [2022-07-12 10:39:52,726 INFO L132 encePairwiseOnDemand]: 127/133 looper letters, 187 selfloop transitions, 264 changer transitions 0/584 dead transitions. [2022-07-12 10:39:52,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 584 transitions, 7042 flow [2022-07-12 10:39:52,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:39:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:39:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 925 transitions. [2022-07-12 10:39:52,728 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8693609022556391 [2022-07-12 10:39:52,728 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 925 transitions. [2022-07-12 10:39:52,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 925 transitions. [2022-07-12 10:39:52,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:52,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 925 transitions. [2022-07-12 10:39:52,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.625) internal successors, (925), 8 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:52,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 133.0) internal successors, (1197), 9 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:52,731 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 133.0) internal successors, (1197), 9 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:52,731 INFO L186 Difference]: Start difference. First operand has 343 places, 317 transitions, 2798 flow. Second operand 8 states and 925 transitions. [2022-07-12 10:39:52,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 584 transitions, 7042 flow [2022-07-12 10:39:52,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 584 transitions, 6446 flow, removed 259 selfloop flow, removed 42 redundant places. [2022-07-12 10:39:52,887 INFO L242 Difference]: Finished difference. Result has 297 places, 552 transitions, 6548 flow [2022-07-12 10:39:52,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=2526, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6548, PETRI_PLACES=297, PETRI_TRANSITIONS=552} [2022-07-12 10:39:52,888 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 179 predicate places. [2022-07-12 10:39:52,889 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 552 transitions, 6548 flow [2022-07-12 10:39:52,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 112.4) internal successors, (1686), 15 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:52,890 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:52,890 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:52,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-12 10:39:53,108 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,SelfDestructingSolverStorable14 [2022-07-12 10:39:53,109 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:53,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:53,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1541788391, now seen corresponding path program 8 times [2022-07-12 10:39:53,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:53,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320546881] [2022-07-12 10:39:53,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:53,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:53,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:53,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320546881] [2022-07-12 10:39:53,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320546881] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:39:53,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997383069] [2022-07-12 10:39:53,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:39:53,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:53,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:53,257 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) [2022-07-12 10:39:53,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 10:39:53,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:39:53,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:39:53,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 10:39:53,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:39:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 25 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:53,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:39:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:54,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997383069] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:39:54,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:39:54,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 42 [2022-07-12 10:39:54,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278661619] [2022-07-12 10:39:54,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:39:54,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 10:39:54,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:54,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 10:39:54,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1520, Unknown=0, NotChecked=0, Total=1722 [2022-07-12 10:39:54,089 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 133 [2022-07-12 10:39:54,091 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 552 transitions, 6548 flow. Second operand has 42 states, 42 states have (on average 96.5952380952381) internal successors, (4057), 42 states have internal predecessors, (4057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:54,091 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:54,091 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 133 [2022-07-12 10:39:54,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:56,468 INFO L129 PetriNetUnfolder]: 771/4460 cut-off events. [2022-07-12 10:39:56,468 INFO L130 PetriNetUnfolder]: For 49263/49319 co-relation queries the response was YES. [2022-07-12 10:39:56,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18029 conditions, 4460 events. 771/4460 cut-off events. For 49263/49319 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 42196 event pairs, 432 based on Foata normal form. 24/4199 useless extension candidates. Maximal degree in co-relation 17946. Up to 1614 conditions per place. [2022-07-12 10:39:56,506 INFO L132 encePairwiseOnDemand]: 116/133 looper letters, 176 selfloop transitions, 15 changer transitions 77/351 dead transitions. [2022-07-12 10:39:56,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 351 transitions, 4108 flow [2022-07-12 10:39:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-12 10:39:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-07-12 10:39:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3111 transitions. [2022-07-12 10:39:56,509 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7309680451127819 [2022-07-12 10:39:56,509 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 3111 transitions. [2022-07-12 10:39:56,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 3111 transitions. [2022-07-12 10:39:56,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:56,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 3111 transitions. [2022-07-12 10:39:56,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 97.21875) internal successors, (3111), 32 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:56,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 133.0) internal successors, (4389), 33 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:56,516 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 133.0) internal successors, (4389), 33 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:56,516 INFO L186 Difference]: Start difference. First operand has 297 places, 552 transitions, 6548 flow. Second operand 32 states and 3111 transitions. [2022-07-12 10:39:56,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 351 transitions, 4108 flow [2022-07-12 10:39:56,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 351 transitions, 3645 flow, removed 142 selfloop flow, removed 26 redundant places. [2022-07-12 10:39:56,598 INFO L242 Difference]: Finished difference. Result has 288 places, 270 transitions, 2371 flow [2022-07-12 10:39:56,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=2553, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2371, PETRI_PLACES=288, PETRI_TRANSITIONS=270} [2022-07-12 10:39:56,599 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 170 predicate places. [2022-07-12 10:39:56,599 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 270 transitions, 2371 flow [2022-07-12 10:39:56,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 96.5952380952381) internal successors, (4057), 42 states have internal predecessors, (4057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:56,600 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:56,600 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:56,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 10:39:56,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 10:39:56,832 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:39:56,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:56,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1503284874, now seen corresponding path program 9 times [2022-07-12 10:39:56,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:56,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101249293] [2022-07-12 10:39:56,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:56,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:57,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:57,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101249293] [2022-07-12 10:39:57,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101249293] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:39:57,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056096160] [2022-07-12 10:39:57,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:39:57,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:57,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:57,530 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) [2022-07-12 10:39:57,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 10:39:57,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 10:39:57,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:39:57,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-12 10:39:57,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:39:59,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:39:59,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:39:59,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:39:59,180 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:59,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 17 [2022-07-12 10:39:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:59,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:39:59,548 INFO L356 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-07-12 10:39:59,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 66 [2022-07-12 10:40:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:40:00,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056096160] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:40:00,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:40:00,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 22] total 69 [2022-07-12 10:40:00,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028883320] [2022-07-12 10:40:00,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:40:00,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-12 10:40:00,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:40:00,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-12 10:40:00,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=631, Invalid=4061, Unknown=0, NotChecked=0, Total=4692 [2022-07-12 10:40:00,749 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 133 [2022-07-12 10:40:00,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 270 transitions, 2371 flow. Second operand has 69 states, 69 states have (on average 67.95652173913044) internal successors, (4689), 69 states have internal predecessors, (4689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:00,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:40:00,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 133 [2022-07-12 10:40:00,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:40:12,820 INFO L129 PetriNetUnfolder]: 6995/25681 cut-off events. [2022-07-12 10:40:12,820 INFO L130 PetriNetUnfolder]: For 273603/273914 co-relation queries the response was YES. [2022-07-12 10:40:13,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109563 conditions, 25681 events. 6995/25681 cut-off events. For 273603/273914 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 313151 event pairs, 1241 based on Foata normal form. 130/24503 useless extension candidates. Maximal degree in co-relation 109487. Up to 3408 conditions per place. [2022-07-12 10:40:13,277 INFO L132 encePairwiseOnDemand]: 101/133 looper letters, 466 selfloop transitions, 623 changer transitions 179/1325 dead transitions. [2022-07-12 10:40:13,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 1325 transitions, 17508 flow [2022-07-12 10:40:13,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-07-12 10:40:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2022-07-12 10:40:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 8376 transitions. [2022-07-12 10:40:13,297 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.5292222152018702 [2022-07-12 10:40:13,297 INFO L72 ComplementDD]: Start complementDD. Operand 119 states and 8376 transitions. [2022-07-12 10:40:13,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 8376 transitions. [2022-07-12 10:40:13,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:40:13,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 119 states and 8376 transitions. [2022-07-12 10:40:13,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 120 states, 119 states have (on average 70.38655462184875) internal successors, (8376), 119 states have internal predecessors, (8376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:13,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 120 states, 120 states have (on average 133.0) internal successors, (15960), 120 states have internal predecessors, (15960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:13,365 INFO L81 ComplementDD]: Finished complementDD. Result has 120 states, 120 states have (on average 133.0) internal successors, (15960), 120 states have internal predecessors, (15960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:13,365 INFO L186 Difference]: Start difference. First operand has 288 places, 270 transitions, 2371 flow. Second operand 119 states and 8376 transitions. [2022-07-12 10:40:13,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 1325 transitions, 17508 flow [2022-07-12 10:40:13,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 1325 transitions, 15649 flow, removed 918 selfloop flow, removed 39 redundant places. [2022-07-12 10:40:13,787 INFO L242 Difference]: Finished difference. Result has 415 places, 865 transitions, 13170 flow [2022-07-12 10:40:13,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=119, PETRI_FLOW=13170, PETRI_PLACES=415, PETRI_TRANSITIONS=865} [2022-07-12 10:40:13,788 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 297 predicate places. [2022-07-12 10:40:13,788 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 865 transitions, 13170 flow [2022-07-12 10:40:13,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 67.95652173913044) internal successors, (4689), 69 states have internal predecessors, (4689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:13,789 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:40:13,789 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:40:13,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 10:40:14,009 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,SelfDestructingSolverStorable16 [2022-07-12 10:40:14,010 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:40:14,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:40:14,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1288661520, now seen corresponding path program 10 times [2022-07-12 10:40:14,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:40:14,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016630836] [2022-07-12 10:40:14,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:40:14,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:40:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:40:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:40:15,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:40:15,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016630836] [2022-07-12 10:40:15,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016630836] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:40:15,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302070288] [2022-07-12 10:40:15,003 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 10:40:15,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:40:15,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:40:15,004 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) [2022-07-12 10:40:15,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 10:40:15,083 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 10:40:15,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:40:15,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-12 10:40:15,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:40:16,113 INFO L356 Elim1Store]: treesize reduction 39, result has 23.5 percent of original size [2022-07-12 10:40:16,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 26 [2022-07-12 10:40:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:40:16,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:40:16,695 INFO L356 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-07-12 10:40:16,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 66 [2022-07-12 10:40:18,348 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:40:18,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302070288] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:40:18,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:40:18,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 26, 25] total 80 [2022-07-12 10:40:18,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412034275] [2022-07-12 10:40:18,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:40:18,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-07-12 10:40:18,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:40:18,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-07-12 10:40:18,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=5637, Unknown=0, NotChecked=0, Total=6320 [2022-07-12 10:40:18,353 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 133 [2022-07-12 10:40:18,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 865 transitions, 13170 flow. Second operand has 80 states, 80 states have (on average 57.7125) internal successors, (4617), 80 states have internal predecessors, (4617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:18,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:40:18,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 133 [2022-07-12 10:40:18,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:40:51,561 INFO L129 PetriNetUnfolder]: 13943/51821 cut-off events. [2022-07-12 10:40:51,562 INFO L130 PetriNetUnfolder]: For 1185189/1186398 co-relation queries the response was YES. [2022-07-12 10:40:53,153 INFO L84 FinitePrefix]: Finished finitePrefix Result has 301721 conditions, 51821 events. 13943/51821 cut-off events. For 1185189/1186398 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 695367 event pairs, 2264 based on Foata normal form. 231/49082 useless extension candidates. Maximal degree in co-relation 301583. Up to 7735 conditions per place. [2022-07-12 10:40:53,354 INFO L132 encePairwiseOnDemand]: 96/133 looper letters, 1095 selfloop transitions, 1120 changer transitions 201/2467 dead transitions. [2022-07-12 10:40:53,354 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 2467 transitions, 46504 flow [2022-07-12 10:40:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2022-07-12 10:40:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2022-07-12 10:40:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 9182 transitions. [2022-07-12 10:40:53,363 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.460250626566416 [2022-07-12 10:40:53,363 INFO L72 ComplementDD]: Start complementDD. Operand 150 states and 9182 transitions. [2022-07-12 10:40:53,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 9182 transitions. [2022-07-12 10:40:53,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:40:53,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 150 states and 9182 transitions. [2022-07-12 10:40:53,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 151 states, 150 states have (on average 61.21333333333333) internal successors, (9182), 150 states have internal predecessors, (9182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:53,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 151 states, 151 states have (on average 133.0) internal successors, (20083), 151 states have internal predecessors, (20083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:53,392 INFO L81 ComplementDD]: Finished complementDD. Result has 151 states, 151 states have (on average 133.0) internal successors, (20083), 151 states have internal predecessors, (20083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:53,392 INFO L186 Difference]: Start difference. First operand has 415 places, 865 transitions, 13170 flow. Second operand 150 states and 9182 transitions. [2022-07-12 10:40:53,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 2467 transitions, 46504 flow [2022-07-12 10:40:55,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 2467 transitions, 39416 flow, removed 3522 selfloop flow, removed 50 redundant places. [2022-07-12 10:40:55,793 INFO L242 Difference]: Finished difference. Result has 571 places, 1771 transitions, 29901 flow [2022-07-12 10:40:55,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=11114, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=865, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=361, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=150, PETRI_FLOW=29901, PETRI_PLACES=571, PETRI_TRANSITIONS=1771} [2022-07-12 10:40:55,794 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 453 predicate places. [2022-07-12 10:40:55,794 INFO L495 AbstractCegarLoop]: Abstraction has has 571 places, 1771 transitions, 29901 flow [2022-07-12 10:40:55,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 57.7125) internal successors, (4617), 80 states have internal predecessors, (4617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:55,795 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:40:55,795 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:40:55,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 10:40:56,011 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,SelfDestructingSolverStorable17 [2022-07-12 10:40:56,013 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:40:56,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:40:56,013 INFO L85 PathProgramCache]: Analyzing trace with hash -794456120, now seen corresponding path program 11 times [2022-07-12 10:40:56,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:40:56,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603736707] [2022-07-12 10:40:56,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:40:56,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:40:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:40:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:40:57,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:40:57,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603736707] [2022-07-12 10:40:57,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603736707] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:40:57,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156529118] [2022-07-12 10:40:57,153 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 10:40:57,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:40:57,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:40:57,154 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) [2022-07-12 10:40:57,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 10:40:57,255 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-12 10:40:57,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:40:57,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 10:40:57,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:40:58,452 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 10:40:58,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 19 [2022-07-12 10:40:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:40:58,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:40:58,893 INFO L356 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-07-12 10:40:58,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 78 [2022-07-12 10:40:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:40:59,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156529118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:40:59,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:40:59,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 25, 25] total 74 [2022-07-12 10:40:59,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167530487] [2022-07-12 10:40:59,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:40:59,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-07-12 10:40:59,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:40:59,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-07-12 10:40:59,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=4739, Unknown=0, NotChecked=0, Total=5402 [2022-07-12 10:40:59,931 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 133 [2022-07-12 10:40:59,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 1771 transitions, 29901 flow. Second operand has 74 states, 74 states have (on average 57.932432432432435) internal successors, (4287), 74 states have internal predecessors, (4287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:59,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:40:59,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 133 [2022-07-12 10:40:59,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand