/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 22:59:44,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 22:59:44,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 22:59:44,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 22:59:44,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 22:59:44,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 22:59:44,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 22:59:44,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 22:59:44,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 22:59:44,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 22:59:44,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 22:59:44,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 22:59:44,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 22:59:44,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 22:59:44,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 22:59:44,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 22:59:44,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 22:59:44,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 22:59:44,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 22:59:44,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 22:59:44,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 22:59:44,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 22:59:44,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 22:59:44,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 22:59:44,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 22:59:44,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 22:59:44,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 22:59:44,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 22:59:44,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 22:59:44,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 22:59:44,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 22:59:44,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 22:59:44,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 22:59:44,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 22:59:44,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 22:59:44,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 22:59:44,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 22:59:44,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 22:59:44,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 22:59:44,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 22:59:44,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 22:59:44,613 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-09-20 22:59:44,637 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 22:59:44,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 22:59:44,638 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 22:59:44,638 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 22:59:44,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 22:59:44,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 22:59:44,639 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 22:59:44,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 22:59:44,639 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 22:59:44,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 22:59:44,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 22:59:44,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 22:59:44,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 22:59:44,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 22:59:44,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 22:59:44,639 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 22:59:44,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 22:59:44,639 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 22:59:44,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 22:59:44,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 22:59:44,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 22:59:44,640 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 22:59:44,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 22:59:44,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:59:44,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 22:59:44,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 22:59:44,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 22:59:44,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 22:59:44,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 22:59:44,640 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 22:59:44,641 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 22:59:44,641 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-09-20 22:59:44,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 22:59:44,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 22:59:44,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 22:59:44,817 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 22:59:44,821 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 22:59:44,821 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2022-09-20 22:59:44,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1cfb4828/c0fa147382a04023a96309e54286c3cc/FLAGacfd85152 [2022-09-20 22:59:45,213 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 22:59:45,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2022-09-20 22:59:45,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1cfb4828/c0fa147382a04023a96309e54286c3cc/FLAGacfd85152 [2022-09-20 22:59:45,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1cfb4828/c0fa147382a04023a96309e54286c3cc [2022-09-20 22:59:45,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 22:59:45,228 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 22:59:45,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 22:59:45,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 22:59:45,231 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 22:59:45,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:59:45" (1/1) ... [2022-09-20 22:59:45,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ccbfaaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:59:45, skipping insertion in model container [2022-09-20 22:59:45,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:59:45" (1/1) ... [2022-09-20 22:59:45,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 22:59:45,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 22:59:45,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-09-20 22:59:45,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:59:45,386 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 22:59:45,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-09-20 22:59:45,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:59:45,424 INFO L208 MainTranslator]: Completed translation [2022-09-20 22:59:45,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:59:45 WrapperNode [2022-09-20 22:59:45,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 22:59:45,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 22:59:45,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 22:59:45,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 22:59:45,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:59:45" (1/1) ... [2022-09-20 22:59:45,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:59:45" (1/1) ... [2022-09-20 22:59:45,465 INFO L138 Inliner]: procedures = 22, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-09-20 22:59:45,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 22:59:45,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 22:59:45,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 22:59:45,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 22:59:45,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:59:45" (1/1) ... [2022-09-20 22:59:45,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:59:45" (1/1) ... [2022-09-20 22:59:45,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:59:45" (1/1) ... [2022-09-20 22:59:45,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:59:45" (1/1) ... [2022-09-20 22:59:45,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:59:45" (1/1) ... [2022-09-20 22:59:45,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:59:45" (1/1) ... [2022-09-20 22:59:45,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:59:45" (1/1) ... [2022-09-20 22:59:45,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 22:59:45,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 22:59:45,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 22:59:45,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 22:59:45,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:59:45" (1/1) ... [2022-09-20 22:59:45,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:59:45,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:59:45,514 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-09-20 22:59:45,515 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-09-20 22:59:45,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 22:59:45,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-20 22:59:45,538 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-20 22:59:45,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-20 22:59:45,539 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-20 22:59:45,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-20 22:59:45,539 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-20 22:59:45,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 22:59:45,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 22:59:45,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 22:59:45,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 22:59:45,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 22:59:45,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 22:59:45,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 22:59:45,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-20 22:59:45,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 22:59:45,540 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 22:59:45,598 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 22:59:45,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 22:59:45,742 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 22:59:45,829 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 22:59:45,829 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-20 22:59:45,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:59:45 BoogieIcfgContainer [2022-09-20 22:59:45,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 22:59:45,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 22:59:45,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 22:59:45,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 22:59:45,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 10:59:45" (1/3) ... [2022-09-20 22:59:45,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699450a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:59:45, skipping insertion in model container [2022-09-20 22:59:45,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:59:45" (2/3) ... [2022-09-20 22:59:45,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699450a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:59:45, skipping insertion in model container [2022-09-20 22:59:45,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:59:45" (3/3) ... [2022-09-20 22:59:45,836 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2022-09-20 22:59:45,852 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 22:59:45,852 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-20 22:59:45,852 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 22:59:45,892 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-09-20 22:59:45,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 109 transitions, 242 flow [2022-09-20 22:59:45,954 INFO L130 PetriNetUnfolder]: 7/106 cut-off events. [2022-09-20 22:59:45,954 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 22:59:45,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 7/106 cut-off events. For 3/3 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/98 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-09-20 22:59:45,958 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 109 transitions, 242 flow [2022-09-20 22:59:45,961 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 95 transitions, 208 flow [2022-09-20 22:59:45,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 22:59:45,972 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@26db0a96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 22:59:45,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-09-20 22:59:45,991 INFO L130 PetriNetUnfolder]: 7/94 cut-off events. [2022-09-20 22:59:45,991 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 22:59:45,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:45,992 INFO L208 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] [2022-09-20 22:59:45,992 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:45,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:45,995 INFO L85 PathProgramCache]: Analyzing trace with hash 722273223, now seen corresponding path program 1 times [2022-09-20 22:59:46,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:46,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181369703] [2022-09-20 22:59:46,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:46,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:59:46,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:46,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181369703] [2022-09-20 22:59:46,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181369703] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:59:46,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:59:46,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:59:46,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247000651] [2022-09-20 22:59:46,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:59:46,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-20 22:59:46,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:46,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-20 22:59:46,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-20 22:59:46,226 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 109 [2022-09-20 22:59:46,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 208 flow. Second operand has 2 states, 2 states have (on average 99.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 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-09-20 22:59:46,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:46,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 109 [2022-09-20 22:59:46,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:59:46,309 INFO L130 PetriNetUnfolder]: 36/184 cut-off events. [2022-09-20 22:59:46,309 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-09-20 22:59:46,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 184 events. 36/184 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 458 event pairs, 7 based on Foata normal form. 18/184 useless extension candidates. Maximal degree in co-relation 178. Up to 49 conditions per place. [2022-09-20 22:59:46,311 INFO L137 encePairwiseOnDemand]: 106/109 looper letters, 10 selfloop transitions, 0 changer transitions 1/92 dead transitions. [2022-09-20 22:59:46,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 92 transitions, 222 flow [2022-09-20 22:59:46,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-20 22:59:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-09-20 22:59:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 203 transitions. [2022-09-20 22:59:46,324 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9311926605504587 [2022-09-20 22:59:46,324 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 203 transitions. [2022-09-20 22:59:46,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 203 transitions. [2022-09-20 22:59:46,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:59:46,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 203 transitions. [2022-09-20 22:59:46,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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-09-20 22:59:46,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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-09-20 22:59:46,337 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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-09-20 22:59:46,338 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 208 flow. Second operand 2 states and 203 transitions. [2022-09-20 22:59:46,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 92 transitions, 222 flow [2022-09-20 22:59:46,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 210 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-09-20 22:59:46,342 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 188 flow [2022-09-20 22:59:46,344 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=188, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2022-09-20 22:59:46,346 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, -5 predicate places. [2022-09-20 22:59:46,346 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 188 flow [2022-09-20 22:59:46,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 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-09-20 22:59:46,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:46,346 INFO L208 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] [2022-09-20 22:59:46,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 22:59:46,347 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:46,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:46,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1533337733, now seen corresponding path program 1 times [2022-09-20 22:59:46,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:46,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754111971] [2022-09-20 22:59:46,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:46,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:59:46,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:46,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754111971] [2022-09-20 22:59:46,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754111971] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:59:46,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:59:46,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:59:46,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164843703] [2022-09-20 22:59:46,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:59:46,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:59:46,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:46,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:59:46,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:59:46,613 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-09-20 22:59:46,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 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-09-20 22:59:46,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:46,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-09-20 22:59:46,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:59:46,779 INFO L130 PetriNetUnfolder]: 105/308 cut-off events. [2022-09-20 22:59:46,783 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-09-20 22:59:46,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 308 events. 105/308 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1176 event pairs, 4 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 488. Up to 71 conditions per place. [2022-09-20 22:59:46,789 INFO L137 encePairwiseOnDemand]: 103/109 looper letters, 34 selfloop transitions, 6 changer transitions 0/108 dead transitions. [2022-09-20 22:59:46,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 108 transitions, 305 flow [2022-09-20 22:59:46,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-20 22:59:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-09-20 22:59:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 527 transitions. [2022-09-20 22:59:46,795 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8058103975535168 [2022-09-20 22:59:46,795 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 527 transitions. [2022-09-20 22:59:46,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 527 transitions. [2022-09-20 22:59:46,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:59:46,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 527 transitions. [2022-09-20 22:59:46,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 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-09-20 22:59:46,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:59:46,800 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:59:46,800 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 188 flow. Second operand 6 states and 527 transitions. [2022-09-20 22:59:46,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 108 transitions, 305 flow [2022-09-20 22:59:46,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 108 transitions, 305 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-20 22:59:46,804 INFO L231 Difference]: Finished difference. Result has 99 places, 93 transitions, 213 flow [2022-09-20 22:59:46,804 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=99, PETRI_TRANSITIONS=93} [2022-09-20 22:59:46,809 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2022-09-20 22:59:46,809 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 93 transitions, 213 flow [2022-09-20 22:59:46,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 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-09-20 22:59:46,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:46,810 INFO L208 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] [2022-09-20 22:59:46,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 22:59:46,810 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:46,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:46,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2109042441, now seen corresponding path program 2 times [2022-09-20 22:59:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:46,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698979196] [2022-09-20 22:59:46,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:46,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:59:46,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:46,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698979196] [2022-09-20 22:59:46,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698979196] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:59:46,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:59:46,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:59:46,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534111061] [2022-09-20 22:59:46,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:59:46,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:59:46,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:46,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:59:46,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:59:46,960 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-09-20 22:59:46,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 93 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 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-09-20 22:59:46,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:46,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-09-20 22:59:46,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:59:47,068 INFO L130 PetriNetUnfolder]: 95/307 cut-off events. [2022-09-20 22:59:47,068 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-09-20 22:59:47,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 307 events. 95/307 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1186 event pairs, 20 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 526. Up to 71 conditions per place. [2022-09-20 22:59:47,071 INFO L137 encePairwiseOnDemand]: 103/109 looper letters, 33 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2022-09-20 22:59:47,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 109 transitions, 339 flow [2022-09-20 22:59:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-20 22:59:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-09-20 22:59:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2022-09-20 22:59:47,073 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8042813455657493 [2022-09-20 22:59:47,073 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 526 transitions. [2022-09-20 22:59:47,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 526 transitions. [2022-09-20 22:59:47,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:59:47,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 526 transitions. [2022-09-20 22:59:47,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 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-09-20 22:59:47,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:59:47,077 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:59:47,077 INFO L175 Difference]: Start difference. First operand has 99 places, 93 transitions, 213 flow. Second operand 6 states and 526 transitions. [2022-09-20 22:59:47,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 109 transitions, 339 flow [2022-09-20 22:59:47,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 109 transitions, 330 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-09-20 22:59:47,080 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 243 flow [2022-09-20 22:59:47,081 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2022-09-20 22:59:47,082 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 5 predicate places. [2022-09-20 22:59:47,082 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 243 flow [2022-09-20 22:59:47,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 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-09-20 22:59:47,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:47,083 INFO L208 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] [2022-09-20 22:59:47,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 22:59:47,083 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:47,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:47,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1584814429, now seen corresponding path program 3 times [2022-09-20 22:59:47,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:47,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072701940] [2022-09-20 22:59:47,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:47,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:59:47,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:47,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072701940] [2022-09-20 22:59:47,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072701940] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:59:47,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:59:47,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:59:47,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636408350] [2022-09-20 22:59:47,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:59:47,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:59:47,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:47,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:59:47,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:59:47,292 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-09-20 22:59:47,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 243 flow. Second operand has 7 states, 7 states have (on average 83.28571428571429) internal successors, (583), 7 states have internal predecessors, (583), 0 states have call successors, (0), 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-09-20 22:59:47,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:47,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-09-20 22:59:47,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:59:47,408 INFO L130 PetriNetUnfolder]: 99/314 cut-off events. [2022-09-20 22:59:47,408 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-09-20 22:59:47,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 314 events. 99/314 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1210 event pairs, 20 based on Foata normal form. 3/291 useless extension candidates. Maximal degree in co-relation 574. Up to 71 conditions per place. [2022-09-20 22:59:47,411 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 36 selfloop transitions, 10 changer transitions 0/114 dead transitions. [2022-09-20 22:59:47,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 114 transitions, 379 flow [2022-09-20 22:59:47,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 22:59:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 22:59:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 612 transitions. [2022-09-20 22:59:47,413 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8020969855832241 [2022-09-20 22:59:47,413 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 612 transitions. [2022-09-20 22:59:47,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 612 transitions. [2022-09-20 22:59:47,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:59:47,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 612 transitions. [2022-09-20 22:59:47,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.42857142857143) internal successors, (612), 7 states have internal predecessors, (612), 0 states have call successors, (0), 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-09-20 22:59:47,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 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-09-20 22:59:47,417 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 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-09-20 22:59:47,417 INFO L175 Difference]: Start difference. First operand has 103 places, 96 transitions, 243 flow. Second operand 7 states and 612 transitions. [2022-09-20 22:59:47,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 114 transitions, 379 flow [2022-09-20 22:59:47,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 114 transitions, 370 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-09-20 22:59:47,421 INFO L231 Difference]: Finished difference. Result has 108 places, 98 transitions, 273 flow [2022-09-20 22:59:47,421 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=273, PETRI_PLACES=108, PETRI_TRANSITIONS=98} [2022-09-20 22:59:47,422 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 10 predicate places. [2022-09-20 22:59:47,423 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 98 transitions, 273 flow [2022-09-20 22:59:47,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.28571428571429) internal successors, (583), 7 states have internal predecessors, (583), 0 states have call successors, (0), 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-09-20 22:59:47,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:47,426 INFO L208 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] [2022-09-20 22:59:47,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 22:59:47,426 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:47,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:47,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1728675125, now seen corresponding path program 4 times [2022-09-20 22:59:47,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:47,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925645638] [2022-09-20 22:59:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:47,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:59:47,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:47,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925645638] [2022-09-20 22:59:47,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925645638] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:59:47,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:59:47,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:59:47,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389405280] [2022-09-20 22:59:47,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:59:47,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:59:47,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:47,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:59:47,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:59:47,547 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-09-20 22:59:47,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 98 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 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-09-20 22:59:47,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:47,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-09-20 22:59:47,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:59:47,645 INFO L130 PetriNetUnfolder]: 114/342 cut-off events. [2022-09-20 22:59:47,645 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-09-20 22:59:47,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 342 events. 114/342 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1399 event pairs, 8 based on Foata normal form. 5/315 useless extension candidates. Maximal degree in co-relation 674. Up to 63 conditions per place. [2022-09-20 22:59:47,648 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 36 selfloop transitions, 10 changer transitions 0/115 dead transitions. [2022-09-20 22:59:47,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 115 transitions, 415 flow [2022-09-20 22:59:47,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 22:59:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 22:59:47,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 612 transitions. [2022-09-20 22:59:47,650 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8020969855832241 [2022-09-20 22:59:47,650 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 612 transitions. [2022-09-20 22:59:47,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 612 transitions. [2022-09-20 22:59:47,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:59:47,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 612 transitions. [2022-09-20 22:59:47,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.42857142857143) internal successors, (612), 7 states have internal predecessors, (612), 0 states have call successors, (0), 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-09-20 22:59:47,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 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-09-20 22:59:47,652 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 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-09-20 22:59:47,652 INFO L175 Difference]: Start difference. First operand has 108 places, 98 transitions, 273 flow. Second operand 7 states and 612 transitions. [2022-09-20 22:59:47,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 115 transitions, 415 flow [2022-09-20 22:59:47,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 115 transitions, 402 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 22:59:47,657 INFO L231 Difference]: Finished difference. Result has 112 places, 100 transitions, 301 flow [2022-09-20 22:59:47,658 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=112, PETRI_TRANSITIONS=100} [2022-09-20 22:59:47,659 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 14 predicate places. [2022-09-20 22:59:47,659 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 100 transitions, 301 flow [2022-09-20 22:59:47,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 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-09-20 22:59:47,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:47,660 INFO L208 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] [2022-09-20 22:59:47,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 22:59:47,660 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:47,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash 953172313, now seen corresponding path program 5 times [2022-09-20 22:59:47,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:47,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53409287] [2022-09-20 22:59:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:47,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:59:47,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:47,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53409287] [2022-09-20 22:59:47,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53409287] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:59:47,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:59:47,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:59:47,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655141543] [2022-09-20 22:59:47,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:59:47,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:59:47,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:47,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:59:47,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:59:47,761 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-09-20 22:59:47,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 100 transitions, 301 flow. Second operand has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:59:47,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:47,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-09-20 22:59:47,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:59:47,923 INFO L130 PetriNetUnfolder]: 264/742 cut-off events. [2022-09-20 22:59:47,923 INFO L131 PetriNetUnfolder]: For 509/509 co-relation queries the response was YES. [2022-09-20 22:59:47,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1603 conditions, 742 events. 264/742 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4348 event pairs, 39 based on Foata normal form. 8/697 useless extension candidates. Maximal degree in co-relation 1592. Up to 179 conditions per place. [2022-09-20 22:59:47,928 INFO L137 encePairwiseOnDemand]: 98/109 looper letters, 36 selfloop transitions, 7 changer transitions 38/148 dead transitions. [2022-09-20 22:59:47,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 148 transitions, 660 flow [2022-09-20 22:59:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:59:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:59:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 784 transitions. [2022-09-20 22:59:47,930 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.799184505606524 [2022-09-20 22:59:47,930 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 784 transitions. [2022-09-20 22:59:47,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 784 transitions. [2022-09-20 22:59:47,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:59:47,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 784 transitions. [2022-09-20 22:59:47,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.11111111111111) internal successors, (784), 9 states have internal predecessors, (784), 0 states have call successors, (0), 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-09-20 22:59:47,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 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-09-20 22:59:47,934 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 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-09-20 22:59:47,934 INFO L175 Difference]: Start difference. First operand has 112 places, 100 transitions, 301 flow. Second operand 9 states and 784 transitions. [2022-09-20 22:59:47,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 148 transitions, 660 flow [2022-09-20 22:59:47,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 148 transitions, 644 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 22:59:47,938 INFO L231 Difference]: Finished difference. Result has 121 places, 101 transitions, 333 flow [2022-09-20 22:59:47,938 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=333, PETRI_PLACES=121, PETRI_TRANSITIONS=101} [2022-09-20 22:59:47,939 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 23 predicate places. [2022-09-20 22:59:47,939 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 101 transitions, 333 flow [2022-09-20 22:59:47,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:59:47,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:47,939 INFO L208 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] [2022-09-20 22:59:47,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 22:59:47,939 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:47,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:47,940 INFO L85 PathProgramCache]: Analyzing trace with hash 162582982, now seen corresponding path program 1 times [2022-09-20 22:59:47,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:47,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786358799] [2022-09-20 22:59:47,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:47,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:59:48,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:48,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786358799] [2022-09-20 22:59:48,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786358799] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:59:48,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650231776] [2022-09-20 22:59:48,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:48,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:59:48,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:59:48,039 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-09-20 22:59:48,040 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-09-20 22:59:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:48,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 12 conjunts are in the unsatisfiable core [2022-09-20 22:59:48,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:59:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:59:48,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-20 22:59:48,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650231776] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:59:48,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-20 22:59:48,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-09-20 22:59:48,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623185823] [2022-09-20 22:59:48,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:59:48,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-09-20 22:59:48,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:48,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-09-20 22:59:48,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:59:48,319 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 109 [2022-09-20 22:59:48,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 101 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:59:48,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:48,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 109 [2022-09-20 22:59:48,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:59:48,418 INFO L130 PetriNetUnfolder]: 98/341 cut-off events. [2022-09-20 22:59:48,418 INFO L131 PetriNetUnfolder]: For 370/375 co-relation queries the response was YES. [2022-09-20 22:59:48,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 341 events. 98/341 cut-off events. For 370/375 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1269 event pairs, 4 based on Foata normal form. 3/314 useless extension candidates. Maximal degree in co-relation 766. Up to 126 conditions per place. [2022-09-20 22:59:48,421 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 22 selfloop transitions, 6 changer transitions 0/106 dead transitions. [2022-09-20 22:59:48,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 106 transitions, 404 flow [2022-09-20 22:59:48,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-20 22:59:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-09-20 22:59:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-09-20 22:59:48,423 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8256880733944955 [2022-09-20 22:59:48,423 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 450 transitions. [2022-09-20 22:59:48,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 450 transitions. [2022-09-20 22:59:48,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:59:48,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 450 transitions. [2022-09-20 22:59:48,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:59:48,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 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-09-20 22:59:48,425 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 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-09-20 22:59:48,425 INFO L175 Difference]: Start difference. First operand has 121 places, 101 transitions, 333 flow. Second operand 5 states and 450 transitions. [2022-09-20 22:59:48,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 106 transitions, 404 flow [2022-09-20 22:59:48,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 106 transitions, 388 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-09-20 22:59:48,429 INFO L231 Difference]: Finished difference. Result has 117 places, 104 transitions, 350 flow [2022-09-20 22:59:48,429 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=350, PETRI_PLACES=117, PETRI_TRANSITIONS=104} [2022-09-20 22:59:48,430 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 19 predicate places. [2022-09-20 22:59:48,430 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 104 transitions, 350 flow [2022-09-20 22:59:48,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:59:48,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:48,430 INFO L208 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] [2022-09-20 22:59:48,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-09-20 22:59:48,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:59:48,644 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:48,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:48,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1009373789, now seen corresponding path program 1 times [2022-09-20 22:59:48,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:48,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272404002] [2022-09-20 22:59:48,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:48,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:59:48,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:48,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272404002] [2022-09-20 22:59:48,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272404002] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:59:48,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347257744] [2022-09-20 22:59:48,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:48,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:59:48,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:59:48,715 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-09-20 22:59:48,716 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-09-20 22:59:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:48,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 12 conjunts are in the unsatisfiable core [2022-09-20 22:59:48,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:59:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:59:48,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-20 22:59:48,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347257744] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:59:48,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-20 22:59:48,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-09-20 22:59:48,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513501321] [2022-09-20 22:59:48,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:59:48,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-09-20 22:59:48,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:48,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-09-20 22:59:48,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:59:48,867 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 109 [2022-09-20 22:59:48,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 104 transitions, 350 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:59:48,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:48,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 109 [2022-09-20 22:59:48,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:59:48,955 INFO L130 PetriNetUnfolder]: 91/349 cut-off events. [2022-09-20 22:59:48,955 INFO L131 PetriNetUnfolder]: For 433/448 co-relation queries the response was YES. [2022-09-20 22:59:48,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 349 events. 91/349 cut-off events. For 433/448 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1423 event pairs, 0 based on Foata normal form. 2/316 useless extension candidates. Maximal degree in co-relation 806. Up to 119 conditions per place. [2022-09-20 22:59:48,957 INFO L137 encePairwiseOnDemand]: 103/109 looper letters, 22 selfloop transitions, 5 changer transitions 0/105 dead transitions. [2022-09-20 22:59:48,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 105 transitions, 403 flow [2022-09-20 22:59:48,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-20 22:59:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-09-20 22:59:48,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-09-20 22:59:48,959 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8238532110091743 [2022-09-20 22:59:48,959 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 449 transitions. [2022-09-20 22:59:48,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 449 transitions. [2022-09-20 22:59:48,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:59:48,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 449 transitions. [2022-09-20 22:59:48,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:59:48,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 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-09-20 22:59:48,961 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 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-09-20 22:59:48,961 INFO L175 Difference]: Start difference. First operand has 117 places, 104 transitions, 350 flow. Second operand 5 states and 449 transitions. [2022-09-20 22:59:48,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 105 transitions, 403 flow [2022-09-20 22:59:48,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 105 transitions, 396 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-09-20 22:59:48,964 INFO L231 Difference]: Finished difference. Result has 118 places, 103 transitions, 346 flow [2022-09-20 22:59:48,964 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=118, PETRI_TRANSITIONS=103} [2022-09-20 22:59:48,965 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 20 predicate places. [2022-09-20 22:59:48,965 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 103 transitions, 346 flow [2022-09-20 22:59:48,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:59:48,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:48,965 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2022-09-20 22:59:48,986 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-09-20 22:59:49,184 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,SelfDestructingSolverStorable7 [2022-09-20 22:59:49,184 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:49,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:49,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1142726848, now seen corresponding path program 1 times [2022-09-20 22:59:49,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:49,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315407571] [2022-09-20 22:59:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:49,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:59:49,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:49,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315407571] [2022-09-20 22:59:49,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315407571] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:59:49,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495252722] [2022-09-20 22:59:49,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:49,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:59:49,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:59:49,296 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-09-20 22:59:49,298 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-09-20 22:59:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:49,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2022-09-20 22:59:49,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:59:49,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:59:49,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:59:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:59:49,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495252722] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:59:49,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:59:49,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2022-09-20 22:59:49,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111662283] [2022-09-20 22:59:49,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:59:49,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-09-20 22:59:49,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:49,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-09-20 22:59:49,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-09-20 22:59:49,560 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-09-20 22:59:49,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 103 transitions, 346 flow. Second operand has 14 states, 14 states have (on average 81.78571428571429) internal successors, (1145), 14 states have internal predecessors, (1145), 0 states have call successors, (0), 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-09-20 22:59:49,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:49,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-09-20 22:59:49,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:59:49,958 INFO L130 PetriNetUnfolder]: 441/1176 cut-off events. [2022-09-20 22:59:49,958 INFO L131 PetriNetUnfolder]: For 1660/1705 co-relation queries the response was YES. [2022-09-20 22:59:49,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3181 conditions, 1176 events. 441/1176 cut-off events. For 1660/1705 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7412 event pairs, 11 based on Foata normal form. 15/1100 useless extension candidates. Maximal degree in co-relation 3165. Up to 176 conditions per place. [2022-09-20 22:59:49,965 INFO L137 encePairwiseOnDemand]: 95/109 looper letters, 61 selfloop transitions, 29 changer transitions 72/229 dead transitions. [2022-09-20 22:59:49,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 229 transitions, 1424 flow [2022-09-20 22:59:49,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-20 22:59:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-09-20 22:59:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1805 transitions. [2022-09-20 22:59:49,969 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7885539536915683 [2022-09-20 22:59:49,969 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1805 transitions. [2022-09-20 22:59:49,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1805 transitions. [2022-09-20 22:59:49,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:59:49,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1805 transitions. [2022-09-20 22:59:49,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 85.95238095238095) internal successors, (1805), 21 states have internal predecessors, (1805), 0 states have call successors, (0), 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-09-20 22:59:49,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 109.0) internal successors, (2398), 22 states have internal predecessors, (2398), 0 states have call successors, (0), 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-09-20 22:59:49,976 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 109.0) internal successors, (2398), 22 states have internal predecessors, (2398), 0 states have call successors, (0), 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-09-20 22:59:49,976 INFO L175 Difference]: Start difference. First operand has 118 places, 103 transitions, 346 flow. Second operand 21 states and 1805 transitions. [2022-09-20 22:59:49,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 229 transitions, 1424 flow [2022-09-20 22:59:49,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 229 transitions, 1412 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 22:59:49,982 INFO L231 Difference]: Finished difference. Result has 145 places, 120 transitions, 578 flow [2022-09-20 22:59:49,982 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=578, PETRI_PLACES=145, PETRI_TRANSITIONS=120} [2022-09-20 22:59:49,983 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 47 predicate places. [2022-09-20 22:59:49,983 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 120 transitions, 578 flow [2022-09-20 22:59:49,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 81.78571428571429) internal successors, (1145), 14 states have internal predecessors, (1145), 0 states have call successors, (0), 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-09-20 22:59:49,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:49,983 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2022-09-20 22:59:50,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-20 22:59:50,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:59:50,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:50,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash 788203809, now seen corresponding path program 2 times [2022-09-20 22:59:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:50,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380763732] [2022-09-20 22:59:50,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:50,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 22:59:50,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:50,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380763732] [2022-09-20 22:59:50,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380763732] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:59:50,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049726372] [2022-09-20 22:59:50,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-20 22:59:50,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:59:50,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:59:50,244 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-09-20 22:59:50,245 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-09-20 22:59:50,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-20 22:59:50,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 22:59:50,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2022-09-20 22:59:50,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:59:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:59:50,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:59:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 22:59:50,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049726372] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:59:50,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:59:50,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2022-09-20 22:59:50,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228633515] [2022-09-20 22:59:50,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:59:50,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 22:59:50,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:50,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 22:59:50,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-09-20 22:59:50,442 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-09-20 22:59:50,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 120 transitions, 578 flow. Second operand has 9 states, 9 states have (on average 90.44444444444444) internal successors, (814), 9 states have internal predecessors, (814), 0 states have call successors, (0), 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-09-20 22:59:50,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:50,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-09-20 22:59:50,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:59:50,614 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][135], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 56#L115-4true, Black: 140#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 135#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 19#L83true, Black: 144#true, Black: 1228#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1230#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1224#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 705#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 1238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 72#L96true, Black: 704#(<= 1 ~pos~0), Black: 1242#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 1226#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 1232#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 703#(<= 0 ~pos~0), Black: 1240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 1255#true, Black: 158#true, 1026#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 150#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 115#true, 17#L46true, Black: 183#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 443#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~pos~0 ~c1~0)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 163#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 175#(<= 0 ~pos~0)]) [2022-09-20 22:59:50,615 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-09-20 22:59:50,615 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-09-20 22:59:50,615 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-09-20 22:59:50,615 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-09-20 22:59:50,619 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][135], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 56#L115-4true, Black: 140#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 135#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 19#L83true, Black: 1228#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 144#true, Black: 1230#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1224#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 705#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 1238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 72#L96true, Black: 704#(<= 1 ~pos~0), Black: 1242#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 1226#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 1232#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 703#(<= 0 ~pos~0), Black: 1240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 1255#true, Black: 158#true, 1026#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 150#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 115#true, 17#L46true, Black: 183#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 443#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~pos~0 ~c1~0)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 175#(<= 0 ~pos~0), 163#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)]) [2022-09-20 22:59:50,619 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-09-20 22:59:50,619 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-09-20 22:59:50,619 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-09-20 22:59:50,620 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-09-20 22:59:50,620 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-09-20 22:59:50,629 INFO L130 PetriNetUnfolder]: 415/1341 cut-off events. [2022-09-20 22:59:50,630 INFO L131 PetriNetUnfolder]: For 6086/6171 co-relation queries the response was YES. [2022-09-20 22:59:50,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4562 conditions, 1341 events. 415/1341 cut-off events. For 6086/6171 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9185 event pairs, 10 based on Foata normal form. 37/1238 useless extension candidates. Maximal degree in co-relation 4535. Up to 305 conditions per place. [2022-09-20 22:59:50,642 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 72 selfloop transitions, 16 changer transitions 0/176 dead transitions. [2022-09-20 22:59:50,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 176 transitions, 1224 flow [2022-09-20 22:59:50,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 22:59:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 22:59:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 659 transitions. [2022-09-20 22:59:50,644 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8636959370904325 [2022-09-20 22:59:50,644 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 659 transitions. [2022-09-20 22:59:50,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 659 transitions. [2022-09-20 22:59:50,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:59:50,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 659 transitions. [2022-09-20 22:59:50,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 0 states have call successors, (0), 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-09-20 22:59:50,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 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-09-20 22:59:50,647 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 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-09-20 22:59:50,647 INFO L175 Difference]: Start difference. First operand has 145 places, 120 transitions, 578 flow. Second operand 7 states and 659 transitions. [2022-09-20 22:59:50,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 176 transitions, 1224 flow [2022-09-20 22:59:50,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 176 transitions, 1030 flow, removed 92 selfloop flow, removed 9 redundant places. [2022-09-20 22:59:50,663 INFO L231 Difference]: Finished difference. Result has 136 places, 130 transitions, 652 flow [2022-09-20 22:59:50,664 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=652, PETRI_PLACES=136, PETRI_TRANSITIONS=130} [2022-09-20 22:59:50,664 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 38 predicate places. [2022-09-20 22:59:50,664 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 130 transitions, 652 flow [2022-09-20 22:59:50,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.44444444444444) internal successors, (814), 9 states have internal predecessors, (814), 0 states have call successors, (0), 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-09-20 22:59:50,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:50,665 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2022-09-20 22:59:50,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-09-20 22:59:50,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:59:50,881 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:50,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:50,881 INFO L85 PathProgramCache]: Analyzing trace with hash -570541926, now seen corresponding path program 1 times [2022-09-20 22:59:50,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:50,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151247391] [2022-09-20 22:59:50,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:50,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 22:59:50,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:50,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151247391] [2022-09-20 22:59:50,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151247391] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:59:50,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:59:50,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-09-20 22:59:50,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501296736] [2022-09-20 22:59:50,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:59:50,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-09-20 22:59:50,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:50,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-09-20 22:59:50,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-20 22:59:50,939 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-09-20 22:59:50,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 130 transitions, 652 flow. Second operand has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 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-09-20 22:59:50,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:50,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-09-20 22:59:50,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:59:51,062 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][112], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 56#L115-4true, Black: 1368#(= ~c1~0 0), Black: 1801#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~c1~0 0)), Black: 1260#(<= ~c1~0 1), Black: 140#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 135#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 19#L83true, Black: 144#true, Black: 1230#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1224#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), 72#L96true, Black: 704#(<= 1 ~pos~0), Black: 1226#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 1232#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 703#(<= 0 ~pos~0), 1806#true, 1255#true, Black: 158#true, 1026#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 150#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 115#true, 17#L46true, Black: 183#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 443#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~pos~0 ~c1~0)), 163#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 175#(<= 0 ~pos~0)]) [2022-09-20 22:59:51,062 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-09-20 22:59:51,062 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-09-20 22:59:51,062 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-09-20 22:59:51,062 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-09-20 22:59:51,072 INFO L130 PetriNetUnfolder]: 386/1315 cut-off events. [2022-09-20 22:59:51,072 INFO L131 PetriNetUnfolder]: For 5121/5182 co-relation queries the response was YES. [2022-09-20 22:59:51,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4092 conditions, 1315 events. 386/1315 cut-off events. For 5121/5182 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 8844 event pairs, 17 based on Foata normal form. 56/1218 useless extension candidates. Maximal degree in co-relation 4066. Up to 383 conditions per place. [2022-09-20 22:59:51,084 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 49 selfloop transitions, 10 changer transitions 0/147 dead transitions. [2022-09-20 22:59:51,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 147 transitions, 922 flow [2022-09-20 22:59:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-20 22:59:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-09-20 22:59:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-09-20 22:59:51,085 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8513761467889909 [2022-09-20 22:59:51,085 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 464 transitions. [2022-09-20 22:59:51,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 464 transitions. [2022-09-20 22:59:51,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:59:51,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 464 transitions. [2022-09-20 22:59:51,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 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-09-20 22:59:51,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 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-09-20 22:59:51,087 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 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-09-20 22:59:51,087 INFO L175 Difference]: Start difference. First operand has 136 places, 130 transitions, 652 flow. Second operand 5 states and 464 transitions. [2022-09-20 22:59:51,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 147 transitions, 922 flow [2022-09-20 22:59:51,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 147 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 22:59:51,095 INFO L231 Difference]: Finished difference. Result has 139 places, 133 transitions, 722 flow [2022-09-20 22:59:51,095 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=722, PETRI_PLACES=139, PETRI_TRANSITIONS=133} [2022-09-20 22:59:51,096 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 41 predicate places. [2022-09-20 22:59:51,096 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 133 transitions, 722 flow [2022-09-20 22:59:51,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 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-09-20 22:59:51,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:51,096 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2022-09-20 22:59:51,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 22:59:51,096 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:51,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash 471205434, now seen corresponding path program 1 times [2022-09-20 22:59:51,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:51,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101629634] [2022-09-20 22:59:51,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:51,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 22:59:51,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:51,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101629634] [2022-09-20 22:59:51,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101629634] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:59:51,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982169849] [2022-09-20 22:59:51,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:51,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:59:51,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:59:51,164 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-09-20 22:59:51,165 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-09-20 22:59:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:51,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 18 conjunts are in the unsatisfiable core [2022-09-20 22:59:51,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:59:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:59:51,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:59:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 22:59:51,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982169849] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:59:51,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:59:51,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 11 [2022-09-20 22:59:51,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771459820] [2022-09-20 22:59:51,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:59:51,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:59:51,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:51,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:59:51,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:59:51,398 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 109 [2022-09-20 22:59:51,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 133 transitions, 722 flow. Second operand has 11 states, 11 states have (on average 87.54545454545455) internal successors, (963), 11 states have internal predecessors, (963), 0 states have call successors, (0), 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-09-20 22:59:51,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:51,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 109 [2022-09-20 22:59:51,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:59:51,678 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][184], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 56#L115-4true, Black: 1368#(= ~c1~0 0), Black: 1801#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~c1~0 0)), Black: 1260#(<= ~c1~0 1), Black: 140#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 135#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1810#(<= ~c2~0 0), 1819#(<= ~c2~0 0), 19#L83true, Black: 144#true, Black: 1230#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1224#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 704#(<= 1 ~pos~0), 72#L96true, Black: 1226#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 1232#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 703#(<= 0 ~pos~0), 1255#true, 1806#true, Black: 158#true, 1026#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 150#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 17#L46true, 115#true, Black: 183#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 443#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~pos~0 ~c1~0)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 163#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 175#(<= 0 ~pos~0)]) [2022-09-20 22:59:51,678 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-09-20 22:59:51,678 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-09-20 22:59:51,678 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-09-20 22:59:51,678 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-09-20 22:59:51,718 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][166], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 56#L115-4true, Black: 1368#(= ~c1~0 0), Black: 1801#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~c1~0 0)), Black: 1260#(<= ~c1~0 1), Black: 140#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 135#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1815#true, Black: 1810#(<= ~c2~0 0), 19#L83true, Black: 144#true, Black: 1230#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1224#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), 72#L96true, Black: 704#(<= 1 ~pos~0), Black: 1226#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 1232#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 703#(<= 0 ~pos~0), 1255#true, 1806#true, Black: 158#true, 1026#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 150#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 17#L46true, 115#true, Black: 183#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 443#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~pos~0 ~c1~0)), Black: 175#(<= 0 ~pos~0), 163#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)]) [2022-09-20 22:59:51,718 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-09-20 22:59:51,718 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:59:51,718 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:59:51,718 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:59:51,720 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][184], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 56#L115-4true, Black: 1368#(= ~c1~0 0), Black: 1801#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~c1~0 0)), Black: 140#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 135#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1260#(<= ~c1~0 1), Black: 1810#(<= ~c2~0 0), 1819#(<= ~c2~0 0), 19#L83true, Black: 144#true, Black: 1230#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1224#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), 72#L96true, Black: 704#(<= 1 ~pos~0), Black: 1226#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 1232#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 703#(<= 0 ~pos~0), 1806#true, Black: 158#true, 1026#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 150#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 17#L46true, 115#true, Black: 183#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 443#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~pos~0 ~c1~0)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 175#(<= 0 ~pos~0), 163#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)]) [2022-09-20 22:59:51,720 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-09-20 22:59:51,720 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:59:51,720 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:59:51,720 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:59:51,722 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][184], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 56#L115-4true, Black: 1368#(= ~c1~0 0), Black: 1801#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~c1~0 0)), Black: 1260#(<= ~c1~0 1), Black: 140#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 135#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1810#(<= ~c2~0 0), 1819#(<= ~c2~0 0), 19#L83true, Black: 144#true, Black: 1230#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1224#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), 72#L96true, Black: 704#(<= 1 ~pos~0), Black: 1226#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 1232#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 703#(<= 0 ~pos~0), 1255#true, 1806#true, Black: 158#true, 1026#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 150#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 17#L46true, 115#true, Black: 183#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 443#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~pos~0 ~c1~0)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 175#(<= 0 ~pos~0), 163#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)]) [2022-09-20 22:59:51,722 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-09-20 22:59:51,722 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-09-20 22:59:51,722 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-09-20 22:59:51,723 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-09-20 22:59:51,723 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-09-20 22:59:51,787 INFO L130 PetriNetUnfolder]: 762/2654 cut-off events. [2022-09-20 22:59:51,787 INFO L131 PetriNetUnfolder]: For 13308/13664 co-relation queries the response was YES. [2022-09-20 22:59:51,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8884 conditions, 2654 events. 762/2654 cut-off events. For 13308/13664 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 22016 event pairs, 7 based on Foata normal form. 113/2454 useless extension candidates. Maximal degree in co-relation 8856. Up to 549 conditions per place. [2022-09-20 22:59:51,806 INFO L137 encePairwiseOnDemand]: 100/109 looper letters, 80 selfloop transitions, 46 changer transitions 0/209 dead transitions. [2022-09-20 22:59:51,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 209 transitions, 1686 flow [2022-09-20 22:59:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 22:59:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 22:59:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 995 transitions. [2022-09-20 22:59:51,808 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8298582151793161 [2022-09-20 22:59:51,809 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 995 transitions. [2022-09-20 22:59:51,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 995 transitions. [2022-09-20 22:59:51,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:59:51,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 995 transitions. [2022-09-20 22:59:51,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 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-09-20 22:59:51,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 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-09-20 22:59:51,812 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 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-09-20 22:59:51,812 INFO L175 Difference]: Start difference. First operand has 139 places, 133 transitions, 722 flow. Second operand 11 states and 995 transitions. [2022-09-20 22:59:51,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 209 transitions, 1686 flow [2022-09-20 22:59:51,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 209 transitions, 1667 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-09-20 22:59:51,826 INFO L231 Difference]: Finished difference. Result has 152 places, 168 transitions, 1292 flow [2022-09-20 22:59:51,827 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1292, PETRI_PLACES=152, PETRI_TRANSITIONS=168} [2022-09-20 22:59:51,827 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 54 predicate places. [2022-09-20 22:59:51,828 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 168 transitions, 1292 flow [2022-09-20 22:59:51,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 87.54545454545455) internal successors, (963), 11 states have internal predecessors, (963), 0 states have call successors, (0), 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-09-20 22:59:51,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:51,828 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2022-09-20 22:59:51,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-09-20 22:59:52,039 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-09-20 22:59:52,040 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:52,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:52,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1436408223, now seen corresponding path program 3 times [2022-09-20 22:59:52,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:52,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689047474] [2022-09-20 22:59:52,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:52,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 22:59:52,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:52,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689047474] [2022-09-20 22:59:52,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689047474] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:59:52,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27994201] [2022-09-20 22:59:52,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-20 22:59:52,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:59:52,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:59:52,136 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-09-20 22:59:52,137 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-09-20 22:59:52,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-09-20 22:59:52,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 22:59:52,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 14 conjunts are in the unsatisfiable core [2022-09-20 22:59:52,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:59:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 22:59:52,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:59:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 22:59:52,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27994201] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:59:52,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:59:52,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2022-09-20 22:59:52,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280880572] [2022-09-20 22:59:52,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:59:52,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-09-20 22:59:52,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:52,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-09-20 22:59:52,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-09-20 22:59:52,377 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-09-20 22:59:52,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 168 transitions, 1292 flow. Second operand has 15 states, 15 states have (on average 81.86666666666666) internal successors, (1228), 15 states have internal predecessors, (1228), 0 states have call successors, (0), 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-09-20 22:59:52,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:52,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-09-20 22:59:52,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:59:53,808 INFO L130 PetriNetUnfolder]: 2949/8180 cut-off events. [2022-09-20 22:59:53,809 INFO L131 PetriNetUnfolder]: For 53986/54929 co-relation queries the response was YES. [2022-09-20 22:59:53,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32056 conditions, 8180 events. 2949/8180 cut-off events. For 53986/54929 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 81698 event pairs, 90 based on Foata normal form. 272/7788 useless extension candidates. Maximal degree in co-relation 32022. Up to 1549 conditions per place. [2022-09-20 22:59:53,877 INFO L137 encePairwiseOnDemand]: 95/109 looper letters, 91 selfloop transitions, 123 changer transitions 185/466 dead transitions. [2022-09-20 22:59:53,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 466 transitions, 5643 flow [2022-09-20 22:59:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-20 22:59:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-09-20 22:59:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2241 transitions. [2022-09-20 22:59:53,882 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7907551164431899 [2022-09-20 22:59:53,882 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2241 transitions. [2022-09-20 22:59:53,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2241 transitions. [2022-09-20 22:59:53,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:59:53,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2241 transitions. [2022-09-20 22:59:53,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 86.1923076923077) internal successors, (2241), 26 states have internal predecessors, (2241), 0 states have call successors, (0), 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-09-20 22:59:53,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 109.0) internal successors, (2943), 27 states have internal predecessors, (2943), 0 states have call successors, (0), 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-09-20 22:59:53,891 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 109.0) internal successors, (2943), 27 states have internal predecessors, (2943), 0 states have call successors, (0), 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-09-20 22:59:53,891 INFO L175 Difference]: Start difference. First operand has 152 places, 168 transitions, 1292 flow. Second operand 26 states and 2241 transitions. [2022-09-20 22:59:53,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 466 transitions, 5643 flow [2022-09-20 22:59:53,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 466 transitions, 5331 flow, removed 152 selfloop flow, removed 3 redundant places. [2022-09-20 22:59:53,953 INFO L231 Difference]: Finished difference. Result has 190 places, 223 transitions, 2482 flow [2022-09-20 22:59:53,953 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2482, PETRI_PLACES=190, PETRI_TRANSITIONS=223} [2022-09-20 22:59:53,954 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 92 predicate places. [2022-09-20 22:59:53,954 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 223 transitions, 2482 flow [2022-09-20 22:59:53,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 81.86666666666666) internal successors, (1228), 15 states have internal predecessors, (1228), 0 states have call successors, (0), 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-09-20 22:59:53,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:53,954 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 3, 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] [2022-09-20 22:59:53,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-09-20 22:59:54,159 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-09-20 22:59:54,159 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:54,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:54,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1996504666, now seen corresponding path program 4 times [2022-09-20 22:59:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:54,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582723451] [2022-09-20 22:59:54,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:54,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-09-20 22:59:54,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:54,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582723451] [2022-09-20 22:59:54,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582723451] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:59:54,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858818831] [2022-09-20 22:59:54,216 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-09-20 22:59:54,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:59:54,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:59:54,217 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-09-20 22:59:54,219 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-09-20 22:59:54,285 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-09-20 22:59:54,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 22:59:54,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 14 conjunts are in the unsatisfiable core [2022-09-20 22:59:54,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:59:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 22:59:54,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:59:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-09-20 22:59:54,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858818831] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:59:54,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:59:54,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 10 [2022-09-20 22:59:54,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679309712] [2022-09-20 22:59:54,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:59:54,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 22:59:54,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:54,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 22:59:54,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-09-20 22:59:54,465 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-09-20 22:59:54,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 223 transitions, 2482 flow. Second operand has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 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-09-20 22:59:54,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:54,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-09-20 22:59:54,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:59:55,330 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][348], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 56#L115-4true, Black: 1368#(= ~c1~0 0), Black: 1801#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~c1~0 0)), Black: 1260#(<= ~c1~0 1), Black: 140#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 135#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1810#(<= ~c2~0 0), Black: 144#true, 72#L96true, 1255#true, Black: 158#true, Black: 2985#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2965#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2969#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 2959#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), 150#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 2379#(<= 2 ~pos~0), Black: 2963#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 2967#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2961#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 2378#(<= 1 ~pos~0), Black: 2973#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 2975#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2380#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 2983#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2979#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2377#(<= 0 ~pos~0), Black: 2971#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 183#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 443#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~pos~0 ~c1~0)), 163#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 175#(<= 0 ~pos~0), Black: 1995#(and (<= ~c2~0 1) (= ~pos~0 1)), Black: 1820#(<= ~c2~0 1), Black: 2011#(and (<= ~c2~0 0) (= (+ ~pos~0 1) 1)), Black: 1928#(and (= ~pos~0 0) (= ~pos~0 ~c2~0)), Black: 2365#(and (= ~pos~0 1) (<= ~c2~0 0)), 3003#true, 2731#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 1819#(<= ~c2~0 0), 19#L83true, Black: 1230#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1224#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 704#(<= 1 ~pos~0), Black: 1226#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 1232#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 703#(<= 0 ~pos~0), 1026#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 115#true, 17#L46true]) [2022-09-20 22:59:55,331 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-09-20 22:59:55,331 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-09-20 22:59:55,331 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-09-20 22:59:55,331 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-09-20 22:59:55,385 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][387], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 56#L115-4true, Black: 1368#(= ~c1~0 0), Black: 1801#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~c1~0 0)), Black: 1260#(<= ~c1~0 1), Black: 140#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 135#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1815#true, Black: 1810#(<= ~c2~0 0), Black: 144#true, 72#L96true, 1255#true, Black: 158#true, Black: 2985#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2965#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2969#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 2959#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), 150#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 2379#(<= 2 ~pos~0), Black: 2963#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 2967#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2961#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 2378#(<= 1 ~pos~0), Black: 2973#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 2975#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2380#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 2983#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2979#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2377#(<= 0 ~pos~0), Black: 2971#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 183#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 443#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~pos~0 ~c1~0)), 163#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 175#(<= 0 ~pos~0), Black: 1995#(and (<= ~c2~0 1) (= ~pos~0 1)), Black: 1820#(<= ~c2~0 1), Black: 2011#(and (<= ~c2~0 0) (= (+ ~pos~0 1) 1)), Black: 1928#(and (= ~pos~0 0) (= ~pos~0 ~c2~0)), Black: 1819#(<= ~c2~0 0), Black: 2365#(and (= ~pos~0 1) (<= ~c2~0 0)), 3003#true, 2731#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 19#L83true, Black: 1230#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1224#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 704#(<= 1 ~pos~0), Black: 1226#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 1232#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 703#(<= 0 ~pos~0), 1026#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 115#true, 17#L46true]) [2022-09-20 22:59:55,385 INFO L383 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2022-09-20 22:59:55,385 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-09-20 22:59:55,385 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-09-20 22:59:55,385 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-09-20 22:59:55,388 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][399], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 56#L115-4true, Black: 1368#(= ~c1~0 0), Black: 1801#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~c1~0 0)), Black: 1260#(<= ~c1~0 1), Black: 140#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 135#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1810#(<= ~c2~0 0), Black: 144#true, 72#L96true, 1255#true, Black: 158#true, Black: 2985#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2965#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2969#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 2959#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), 150#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 2379#(<= 2 ~pos~0), Black: 2963#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 2967#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2961#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 2378#(<= 1 ~pos~0), Black: 2973#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 2975#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2380#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 2983#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2979#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2377#(<= 0 ~pos~0), Black: 2971#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 183#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 443#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~pos~0 ~c1~0)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 163#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 175#(<= 0 ~pos~0), Black: 1995#(and (<= ~c2~0 1) (= ~pos~0 1)), Black: 1820#(<= ~c2~0 1), Black: 2011#(and (<= ~c2~0 0) (= (+ ~pos~0 1) 1)), Black: 1928#(and (= ~pos~0 0) (= ~pos~0 ~c2~0)), Black: 2365#(and (= ~pos~0 1) (<= ~c2~0 0)), 3008#(<= ~c1~0 1), 2731#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 1819#(<= ~c2~0 0), 19#L83true, Black: 1230#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1224#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 704#(<= 1 ~pos~0), Black: 1226#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 1232#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 703#(<= 0 ~pos~0), 1026#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 115#true, 17#L46true]) [2022-09-20 22:59:55,388 INFO L383 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2022-09-20 22:59:55,388 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-09-20 22:59:55,388 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-09-20 22:59:55,388 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-09-20 22:59:55,419 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][410], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 56#L115-4true, Black: 1368#(= ~c1~0 0), Black: 1801#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~c1~0 0)), Black: 1260#(<= ~c1~0 1), Black: 140#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 135#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1810#(<= ~c2~0 0), Black: 144#true, 72#L96true, 1255#true, Black: 158#true, Black: 2985#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2965#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2969#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 2959#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 2379#(<= 2 ~pos~0), 150#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 2963#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 2967#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2961#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 2378#(<= 1 ~pos~0), Black: 2973#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 2975#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2380#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 2983#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2979#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2377#(<= 0 ~pos~0), Black: 2971#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 183#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 443#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~pos~0 ~c1~0)), Black: 175#(<= 0 ~pos~0), 163#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 1995#(and (<= ~c2~0 1) (= ~pos~0 1)), Black: 1820#(<= ~c2~0 1), Black: 2011#(and (<= ~c2~0 0) (= (+ ~pos~0 1) 1)), Black: 1928#(and (= ~pos~0 0) (= ~pos~0 ~c2~0)), Black: 2365#(and (= ~pos~0 1) (<= ~c2~0 0)), 3009#(<= ~c1~0 2), 2731#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 1819#(<= ~c2~0 0), 19#L83true, Black: 1230#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1224#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 704#(<= 1 ~pos~0), Black: 1226#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 1232#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 703#(<= 0 ~pos~0), 1026#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 115#true, 17#L46true]) [2022-09-20 22:59:55,419 INFO L383 tUnfolder$Statistics]: this new event has 105 ancestors and is cut-off event [2022-09-20 22:59:55,419 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-09-20 22:59:55,419 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-09-20 22:59:55,419 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-09-20 22:59:55,431 INFO L130 PetriNetUnfolder]: 1763/5902 cut-off events. [2022-09-20 22:59:55,431 INFO L131 PetriNetUnfolder]: For 101042/102284 co-relation queries the response was YES. [2022-09-20 22:59:55,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29130 conditions, 5902 events. 1763/5902 cut-off events. For 101042/102284 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 57132 event pairs, 37 based on Foata normal form. 236/5493 useless extension candidates. Maximal degree in co-relation 29079. Up to 1270 conditions per place. [2022-09-20 22:59:55,499 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 263 selfloop transitions, 58 changer transitions 0/419 dead transitions. [2022-09-20 22:59:55,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 419 transitions, 6317 flow [2022-09-20 22:59:55,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-20 22:59:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-09-20 22:59:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 755 transitions. [2022-09-20 22:59:55,500 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8658256880733946 [2022-09-20 22:59:55,500 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 755 transitions. [2022-09-20 22:59:55,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 755 transitions. [2022-09-20 22:59:55,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:59:55,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 755 transitions. [2022-09-20 22:59:55,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.375) internal successors, (755), 8 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:59:55,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 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-09-20 22:59:55,503 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 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-09-20 22:59:55,503 INFO L175 Difference]: Start difference. First operand has 190 places, 223 transitions, 2482 flow. Second operand 8 states and 755 transitions. [2022-09-20 22:59:55,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 419 transitions, 6317 flow [2022-09-20 22:59:55,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 419 transitions, 5430 flow, removed 428 selfloop flow, removed 16 redundant places. [2022-09-20 22:59:55,690 INFO L231 Difference]: Finished difference. Result has 170 places, 248 transitions, 2647 flow [2022-09-20 22:59:55,690 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=2153, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2647, PETRI_PLACES=170, PETRI_TRANSITIONS=248} [2022-09-20 22:59:55,691 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 72 predicate places. [2022-09-20 22:59:55,691 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 248 transitions, 2647 flow [2022-09-20 22:59:55,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 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-09-20 22:59:55,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:55,691 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 3, 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] [2022-09-20 22:59:55,724 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-09-20 22:59:55,907 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-09-20 22:59:55,909 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:55,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:55,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2041141257, now seen corresponding path program 2 times [2022-09-20 22:59:55,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:55,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753145832] [2022-09-20 22:59:55,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:55,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-09-20 22:59:55,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:55,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753145832] [2022-09-20 22:59:55,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753145832] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:59:55,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:59:55,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:59:55,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610423654] [2022-09-20 22:59:55,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:59:55,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:59:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:55,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:59:55,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:59:55,987 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-09-20 22:59:55,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 248 transitions, 2647 flow. Second operand has 8 states, 8 states have (on average 80.125) internal successors, (641), 8 states have internal predecessors, (641), 0 states have call successors, (0), 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-09-20 22:59:55,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:55,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-09-20 22:59:55,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:59:57,626 INFO L130 PetriNetUnfolder]: 4399/11368 cut-off events. [2022-09-20 22:59:57,626 INFO L131 PetriNetUnfolder]: For 116846/118398 co-relation queries the response was YES. [2022-09-20 22:59:57,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51359 conditions, 11368 events. 4399/11368 cut-off events. For 116846/118398 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 114263 event pairs, 508 based on Foata normal form. 225/10558 useless extension candidates. Maximal degree in co-relation 51317. Up to 4533 conditions per place. [2022-09-20 22:59:57,723 INFO L137 encePairwiseOnDemand]: 97/109 looper letters, 250 selfloop transitions, 35 changer transitions 49/399 dead transitions. [2022-09-20 22:59:57,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 399 transitions, 5455 flow [2022-09-20 22:59:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 22:59:57,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 22:59:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 922 transitions. [2022-09-20 22:59:57,725 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7689741451209341 [2022-09-20 22:59:57,725 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 922 transitions. [2022-09-20 22:59:57,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 922 transitions. [2022-09-20 22:59:57,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:59:57,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 922 transitions. [2022-09-20 22:59:57,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 83.81818181818181) internal successors, (922), 11 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:59:57,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 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-09-20 22:59:57,728 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 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-09-20 22:59:57,728 INFO L175 Difference]: Start difference. First operand has 170 places, 248 transitions, 2647 flow. Second operand 11 states and 922 transitions. [2022-09-20 22:59:57,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 399 transitions, 5455 flow [2022-09-20 22:59:58,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 399 transitions, 5194 flow, removed 108 selfloop flow, removed 5 redundant places. [2022-09-20 22:59:58,120 INFO L231 Difference]: Finished difference. Result has 180 places, 265 transitions, 2916 flow [2022-09-20 22:59:58,120 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=2521, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2916, PETRI_PLACES=180, PETRI_TRANSITIONS=265} [2022-09-20 22:59:58,120 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 82 predicate places. [2022-09-20 22:59:58,120 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 265 transitions, 2916 flow [2022-09-20 22:59:58,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 80.125) internal successors, (641), 8 states have internal predecessors, (641), 0 states have call successors, (0), 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-09-20 22:59:58,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:59:58,121 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 6, 3, 3, 3, 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] [2022-09-20 22:59:58,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-09-20 22:59:58,121 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 22:59:58,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:59:58,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2068539086, now seen corresponding path program 5 times [2022-09-20 22:59:58,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:59:58,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141951300] [2022-09-20 22:59:58,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:59:58,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:59:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:59:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-09-20 22:59:58,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:59:58,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141951300] [2022-09-20 22:59:58,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141951300] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:59:58,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037533252] [2022-09-20 22:59:58,195 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-09-20 22:59:58,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:59:58,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:59:58,196 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-09-20 22:59:58,197 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-09-20 22:59:58,266 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-09-20 22:59:58,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 22:59:58,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core [2022-09-20 22:59:58,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:59:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 14 proven. 43 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-09-20 22:59:58,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:59:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-09-20 22:59:58,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037533252] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:59:58,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:59:58,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 16 [2022-09-20 22:59:58,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111108518] [2022-09-20 22:59:58,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:59:58,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-09-20 22:59:58,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:59:58,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-09-20 22:59:58,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-09-20 22:59:58,494 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-09-20 22:59:58,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 265 transitions, 2916 flow. Second operand has 16 states, 16 states have (on average 82.0) internal successors, (1312), 16 states have internal predecessors, (1312), 0 states have call successors, (0), 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-09-20 22:59:58,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:59:58,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-09-20 22:59:58,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:00:02,244 INFO L130 PetriNetUnfolder]: 8476/21561 cut-off events. [2022-09-20 23:00:02,244 INFO L131 PetriNetUnfolder]: For 240902/244840 co-relation queries the response was YES. [2022-09-20 23:00:02,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101016 conditions, 21561 events. 8476/21561 cut-off events. For 240902/244840 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 238676 event pairs, 346 based on Foata normal form. 1142/20949 useless extension candidates. Maximal degree in co-relation 100970. Up to 3972 conditions per place. [2022-09-20 23:00:02,456 INFO L137 encePairwiseOnDemand]: 96/109 looper letters, 109 selfloop transitions, 368 changer transitions 264/808 dead transitions. [2022-09-20 23:00:02,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 808 transitions, 12675 flow [2022-09-20 23:00:02,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-20 23:00:02,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-09-20 23:00:02,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2672 transitions. [2022-09-20 23:00:02,459 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7907664989641906 [2022-09-20 23:00:02,459 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2672 transitions. [2022-09-20 23:00:02,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2672 transitions. [2022-09-20 23:00:02,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:00:02,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2672 transitions. [2022-09-20 23:00:02,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 86.19354838709677) internal successors, (2672), 31 states have internal predecessors, (2672), 0 states have call successors, (0), 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-09-20 23:00:02,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 109.0) internal successors, (3488), 32 states have internal predecessors, (3488), 0 states have call successors, (0), 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-09-20 23:00:02,466 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 109.0) internal successors, (3488), 32 states have internal predecessors, (3488), 0 states have call successors, (0), 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-09-20 23:00:02,466 INFO L175 Difference]: Start difference. First operand has 180 places, 265 transitions, 2916 flow. Second operand 31 states and 2672 transitions. [2022-09-20 23:00:02,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 808 transitions, 12675 flow [2022-09-20 23:00:03,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 808 transitions, 12273 flow, removed 154 selfloop flow, removed 13 redundant places. [2022-09-20 23:00:03,069 INFO L231 Difference]: Finished difference. Result has 206 places, 493 transitions, 7905 flow [2022-09-20 23:00:03,069 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=2843, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=7905, PETRI_PLACES=206, PETRI_TRANSITIONS=493} [2022-09-20 23:00:03,069 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 108 predicate places. [2022-09-20 23:00:03,069 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 493 transitions, 7905 flow [2022-09-20 23:00:03,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 82.0) internal successors, (1312), 16 states have internal predecessors, (1312), 0 states have call successors, (0), 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-09-20 23:00:03,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:00:03,070 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 4, 4, 4, 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] [2022-09-20 23:00:03,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-09-20 23:00:03,274 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,SelfDestructingSolverStorable15 [2022-09-20 23:00:03,275 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:00:03,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:00:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash -767535325, now seen corresponding path program 6 times [2022-09-20 23:00:03,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:00:03,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086284331] [2022-09-20 23:00:03,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:00:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:00:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:00:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-09-20 23:00:03,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:00:03,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086284331] [2022-09-20 23:00:03,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086284331] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:00:03,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:00:03,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 23:00:03,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348927364] [2022-09-20 23:00:03,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:00:03,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 23:00:03,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:00:03,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 23:00:03,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-09-20 23:00:03,359 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-09-20 23:00:03,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 493 transitions, 7905 flow. Second operand has 8 states, 8 states have (on average 80.125) internal successors, (641), 8 states have internal predecessors, (641), 0 states have call successors, (0), 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-09-20 23:00:03,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:00:03,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-09-20 23:00:03,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:00:07,777 INFO L130 PetriNetUnfolder]: 9770/23185 cut-off events. [2022-09-20 23:00:07,777 INFO L131 PetriNetUnfolder]: For 296348/297195 co-relation queries the response was YES. [2022-09-20 23:00:07,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120177 conditions, 23185 events. 9770/23185 cut-off events. For 296348/297195 co-relation queries the response was YES. Maximal size of possible extension queue 1222. Compared 255984 event pairs, 1047 based on Foata normal form. 150/21324 useless extension candidates. Maximal degree in co-relation 120125. Up to 10648 conditions per place. [2022-09-20 23:00:08,027 INFO L137 encePairwiseOnDemand]: 97/109 looper letters, 537 selfloop transitions, 76 changer transitions 56/751 dead transitions. [2022-09-20 23:00:08,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 751 transitions, 13781 flow [2022-09-20 23:00:08,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 23:00:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 23:00:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 926 transitions. [2022-09-20 23:00:08,029 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7723102585487907 [2022-09-20 23:00:08,029 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 926 transitions. [2022-09-20 23:00:08,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 926 transitions. [2022-09-20 23:00:08,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:00:08,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 926 transitions. [2022-09-20 23:00:08,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 84.18181818181819) internal successors, (926), 11 states have internal predecessors, (926), 0 states have call successors, (0), 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-09-20 23:00:08,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 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-09-20 23:00:08,031 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 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-09-20 23:00:08,031 INFO L175 Difference]: Start difference. First operand has 206 places, 493 transitions, 7905 flow. Second operand 11 states and 926 transitions. [2022-09-20 23:00:08,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 751 transitions, 13781 flow [2022-09-20 23:00:08,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 751 transitions, 12263 flow, removed 751 selfloop flow, removed 11 redundant places. [2022-09-20 23:00:09,022 INFO L231 Difference]: Finished difference. Result has 195 places, 545 transitions, 8305 flow [2022-09-20 23:00:09,022 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=7101, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8305, PETRI_PLACES=195, PETRI_TRANSITIONS=545} [2022-09-20 23:00:09,023 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 97 predicate places. [2022-09-20 23:00:09,023 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 545 transitions, 8305 flow [2022-09-20 23:00:09,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 80.125) internal successors, (641), 8 states have internal predecessors, (641), 0 states have call successors, (0), 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-09-20 23:00:09,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:00:09,023 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 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] [2022-09-20 23:00:09,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-09-20 23:00:09,024 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:00:09,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:00:09,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1926724202, now seen corresponding path program 1 times [2022-09-20 23:00:09,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:00:09,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884119597] [2022-09-20 23:00:09,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:00:09,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:00:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:00:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-09-20 23:00:09,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:00:09,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884119597] [2022-09-20 23:00:09,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884119597] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:00:09,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197946500] [2022-09-20 23:00:09,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:00:09,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:00:09,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:00:09,139 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-09-20 23:00:09,140 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-09-20 23:00:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:00:09,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 28 conjunts are in the unsatisfiable core [2022-09-20 23:00:09,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:00:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:00:09,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:00:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-09-20 23:00:09,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197946500] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 23:00:09,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 23:00:09,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 7] total 23 [2022-09-20 23:00:09,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700264854] [2022-09-20 23:00:09,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 23:00:09,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-09-20 23:00:09,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:00:09,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-09-20 23:00:09,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-09-20 23:00:09,538 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-09-20 23:00:09,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 545 transitions, 8305 flow. Second operand has 23 states, 23 states have (on average 80.43478260869566) internal successors, (1850), 23 states have internal predecessors, (1850), 0 states have call successors, (0), 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-09-20 23:00:09,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:00:09,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-09-20 23:00:09,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:00:22,052 INFO L130 PetriNetUnfolder]: 24103/57451 cut-off events. [2022-09-20 23:00:22,053 INFO L131 PetriNetUnfolder]: For 578195/587751 co-relation queries the response was YES. [2022-09-20 23:00:22,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269606 conditions, 57451 events. 24103/57451 cut-off events. For 578195/587751 co-relation queries the response was YES. Maximal size of possible extension queue 2605. Compared 707365 event pairs, 737 based on Foata normal form. 3702/56223 useless extension candidates. Maximal degree in co-relation 269554. Up to 10084 conditions per place. [2022-09-20 23:00:23,127 INFO L137 encePairwiseOnDemand]: 95/109 looper letters, 985 selfloop transitions, 1483 changer transitions 108/2641 dead transitions. [2022-09-20 23:00:23,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 2641 transitions, 45557 flow [2022-09-20 23:00:23,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-09-20 23:00:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-09-20 23:00:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 4035 transitions. [2022-09-20 23:00:23,131 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7876244388053875 [2022-09-20 23:00:23,131 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 4035 transitions. [2022-09-20 23:00:23,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 4035 transitions. [2022-09-20 23:00:23,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:00:23,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 4035 transitions. [2022-09-20 23:00:23,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 85.85106382978724) internal successors, (4035), 47 states have internal predecessors, (4035), 0 states have call successors, (0), 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-09-20 23:00:23,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 109.0) internal successors, (5232), 48 states have internal predecessors, (5232), 0 states have call successors, (0), 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-09-20 23:00:23,139 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 109.0) internal successors, (5232), 48 states have internal predecessors, (5232), 0 states have call successors, (0), 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-09-20 23:00:23,139 INFO L175 Difference]: Start difference. First operand has 195 places, 545 transitions, 8305 flow. Second operand 47 states and 4035 transitions. [2022-09-20 23:00:23,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 2641 transitions, 45557 flow [2022-09-20 23:00:26,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 2641 transitions, 45054 flow, removed 104 selfloop flow, removed 11 redundant places. [2022-09-20 23:00:26,421 INFO L231 Difference]: Finished difference. Result has 259 places, 1906 transitions, 37843 flow [2022-09-20 23:00:26,421 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=7657, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=362, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=37843, PETRI_PLACES=259, PETRI_TRANSITIONS=1906} [2022-09-20 23:00:26,421 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 161 predicate places. [2022-09-20 23:00:26,421 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 1906 transitions, 37843 flow [2022-09-20 23:00:26,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 80.43478260869566) internal successors, (1850), 23 states have internal predecessors, (1850), 0 states have call successors, (0), 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-09-20 23:00:26,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:00:26,422 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 23:00:26,440 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-09-20 23:00:26,640 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,SelfDestructingSolverStorable17 [2022-09-20 23:00:26,641 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:00:26,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:00:26,641 INFO L85 PathProgramCache]: Analyzing trace with hash 503137041, now seen corresponding path program 2 times [2022-09-20 23:00:26,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:00:26,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517453393] [2022-09-20 23:00:26,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:00:26,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:00:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:00:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 19 proven. 42 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-09-20 23:00:26,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:00:26,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517453393] [2022-09-20 23:00:26,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517453393] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:00:26,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324873503] [2022-09-20 23:00:26,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-20 23:00:26,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:00:26,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:00:26,776 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-09-20 23:00:26,777 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-09-20 23:00:26,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-20 23:00:26,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:00:26,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 18 conjunts are in the unsatisfiable core [2022-09-20 23:00:26,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:00:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 19 proven. 42 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-09-20 23:00:26,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:00:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 33 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-09-20 23:00:27,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324873503] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 23:00:27,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 23:00:27,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 20 [2022-09-20 23:00:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658284229] [2022-09-20 23:00:27,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 23:00:27,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-09-20 23:00:27,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:00:27,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-09-20 23:00:27,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-09-20 23:00:27,112 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 109 [2022-09-20 23:00:27,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 1906 transitions, 37843 flow. Second operand has 20 states, 20 states have (on average 78.4) internal successors, (1568), 20 states have internal predecessors, (1568), 0 states have call successors, (0), 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-09-20 23:00:27,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:00:27,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 109 [2022-09-20 23:00:27,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:01:08,215 INFO L130 PetriNetUnfolder]: 40908/98076 cut-off events. [2022-09-20 23:01:08,215 INFO L131 PetriNetUnfolder]: For 1615242/1635199 co-relation queries the response was YES. [2022-09-20 23:01:10,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531784 conditions, 98076 events. 40908/98076 cut-off events. For 1615242/1635199 co-relation queries the response was YES. Maximal size of possible extension queue 3562. Compared 1269406 event pairs, 1317 based on Foata normal form. 4447/94159 useless extension candidates. Maximal degree in co-relation 531704. Up to 17806 conditions per place. [2022-09-20 23:01:10,974 INFO L137 encePairwiseOnDemand]: 95/109 looper letters, 370 selfloop transitions, 2794 changer transitions 688/3915 dead transitions. [2022-09-20 23:01:10,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 3915 transitions, 84187 flow [2022-09-20 23:01:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-20 23:01:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-09-20 23:01:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2625 transitions. [2022-09-20 23:01:10,976 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7525802752293578 [2022-09-20 23:01:10,977 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 2625 transitions. [2022-09-20 23:01:10,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 2625 transitions. [2022-09-20 23:01:10,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:01:10,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2625 transitions. [2022-09-20 23:01:10,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 82.03125) internal successors, (2625), 32 states have internal predecessors, (2625), 0 states have call successors, (0), 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-09-20 23:01:10,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 109.0) internal successors, (3597), 33 states have internal predecessors, (3597), 0 states have call successors, (0), 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-09-20 23:01:10,982 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 109.0) internal successors, (3597), 33 states have internal predecessors, (3597), 0 states have call successors, (0), 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-09-20 23:01:10,982 INFO L175 Difference]: Start difference. First operand has 259 places, 1906 transitions, 37843 flow. Second operand 32 states and 2625 transitions. [2022-09-20 23:01:10,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 3915 transitions, 84187 flow